Study of the Logistics Vehicle Scheduling Problem Based on Improved Ants Algorithm

Author

Zhu, Yuhua ; Zhen, Tong ; Zhang, Qiuwen

Author_Institution

Sch. of Journalism & Commun., Henan Univ. of Technol., Zhengzhou, China

Volume

3

fYear

2009

fDate

14-16 Aug. 2009

Firstpage

71

Lastpage

74

Abstract

The paper describes the distribution vehicle routing optimization scheduling problem, and presents a mathematical model. Ant colony system which is a novel simulated evolutionary algorithm, it can good for NP-Hard problem. According to the features of the Vehicle routing problem with time windows and the ant colony algorithm, an improved ant colony system is proposed to solve this problem. An improved ant algorithm is proposed, Distribution of the path optimization solutions of the initial structure, route optimization, transfer rules, updating information etc. are improved. Experimental simulation proves the validity of the algorithm.

Keywords

distribution strategy; evolutionary computation; logistics; scheduling; NP-Hard problem; ant colony system; distribution vehicle routing optimization scheduling problem; improved ants algorithm; logistics vehicle scheduling problem; simulated evolutionary algorithm; time window; Ant colony optimization; Automotive engineering; Distributed computing; Educational institutions; Information science; Logistics; Paper technology; Routing; Scheduling algorithm; Vehicles; Improved Ants Algorithm; Logistics Vehicle Scheduling; Transition rules; VRPTW;

fLanguage

English

Publisher

ieee

Conference_Titel

Natural Computation, 2009. ICNC '09. Fifth International Conference on

Conference_Location

Tianjin

Print_ISBN

978-0-7695-3736-8

Type

conf

DOI

10.1109/ICNC.2009.85

Filename

5366814