DocumentCode :
496841
Title :
The Application of Immune Algorithm to Vehicle Scheduling Problem in Logistics Distribution
Author :
Kongyu, Yang ; Binbin, Gao ; Jihui, Lin
Author_Institution :
Beijing Inf. Sci. & Technol. Univ., Beijing, China
Volume :
1
fYear :
2009
fDate :
18-19 July 2009
Firstpage :
144
Lastpage :
148
Abstract :
The immune algorithm is an intelligential and heuristic algorithm which imitates high-evolvement of the organism and complicated immune system. Vehicle scheduling problem (VSP) with soft time windows is a variation of vehicle scheduling problem in logistics distribution, which is a typical NP-hard problem. The paper describes an improved immune optimization algorithm to solve the VSP, in which a new coding method, the adaptive mechanism of crossover and mutation, and evaluate function are introduced. Simulation results on a VSP problems show that the algorithm is efficient to solve the VSP problem.
Keywords :
computational complexity; logistics; optimisation; scheduling; transportation; NP-hard problem; adaptive mechanism; coding method; heuristic algorithm; immune optimization algorithm; immune system; intelligent algorithm; logistics distribution; soft time windows; vehicle scheduling problem; Constraint optimization; Evolution (biology); Heuristic algorithms; Immune system; Information processing; Information science; Logistics; Mathematical model; Scheduling algorithm; Vehicles; Evolutionary Computation; Immune algorithm; Vehicle scheduling problem (VSP);
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Information Processing, 2009. APCIP 2009. Asia-Pacific Conference on
Conference_Location :
Shenzhen
Print_ISBN :
978-0-7695-3699-6
Type :
conf
DOI :
10.1109/APCIP.2009.45
Filename :
5197017
Link To Document :
بازگشت