Application of ant colony optimization to logistic scheduling algorithm

Author

Sun, Ruoying ; Zhao, Gang ; Wang, Xingfen

Author_Institution

Sch. of Inf. Manage., Beijing Inf. Sci. & Technol. Univ., Beijing

Volume

2

fYear

2008

fDate

12-15 Oct. 2008

Firstpage

1565

Lastpage

1570

Abstract

The logistic scheduling is a typical combinatorial optimization problem. Vehicle routing optimization is one of the most critical parts in logistics, and the Vehicle Routing Problem (VRP) is an important problem occurring in many distribution systems. This paper proposes an improved ant colony optimization algorithm to optimize the dynamic assignment to the Capacitated Vehicle Routing Problem (CVRP) and the Vehicle Routing Problem with Time Windows (VRPTW). The improved algorithm tests several different combinations and derives the solution that is able to deliver more orders at the correct delivery date. Results show the effectiveness of the proposed algorithm.

Keywords

combinatorial mathematics; logistics; optimisation; transportation; ant colony optimization; capacitated vehicle routing problem; combinatorial optimization problem; distribution systems; logistic scheduling algorithm; vehicle routing optimization; ant colony optimization; logistics; vehicle routing problem;

fLanguage

English

Publisher

ieee

Conference_Titel

Service Operations and Logistics, and Informatics, 2008. IEEE/SOLI 2008. IEEE International Conference on

Conference_Location

Beijing

Print_ISBN

978-1-4244-2012-4

Electronic_ISBN

978-1-4244-2013-1

Type

conf

DOI

10.1109/SOLI.2008.4682775

Filename

4682775