Browse > Article

Ant Colony System for Vehicle Routing Problem with Time Window  

Lee, Sang-Heon (국방대학교 운영분석학과)
Lee, Seung-Won (국방대학교 운영분석학과)
Publication Information
Journal of the Korean Operations Research and Management Science Society / v.34, no.1, 2009 , pp. 153-165 More about this Journal
Abstract
This paper apollos an ant colony system (ACS) for the vehicle routing problem with time window (VRPTW). The VRPTW is a generalization of the VRP where the service of a customer can begin within the time windows defined by the earliest and latest times when the customer will permit the start of service. The ACS has been applied effectively in geographical environment such as TSP or VRP by meta-heuristic that imitate an ant's biologic special duality in route construction, 3 saving based ACS (SB-ACS) is introduced and its solution is improved by local search. Through iterative precesses, the SB-ACS is shown to drive the best solution. The algorithm has been tested on 56 Solomon benchmarking problems and compared to the best-known solutions on literature. Experimental results shows that SB-ACS algorithm could obtain food solution in total travel distance minimization.
Keywords
Vehicle Routing Problem; Time Window; Ant Colony System; Saving Algorithm; Two-opt;
Citations & Related Records
연도 인용수 순위
  • Reference
1 Bullnheimer, B., Hartl, R.F. and C. Strauss, Applying the Ant System to the Vehicle Routing Problem, Meta-Heuristics: Advances and Trends in Local Search Paradigms for Optimization, Kluwer, Boston, (1998), pp.100-120
2 Chiang, W.C. and R.A Russell, 'Simulated Annealing Metaheuristics for the Vehicle Routing Problem with time Windows,' Annals of Operations Research, Vol.63(1996), pp.3-27   DOI
3 Clarke, G. and J. Wright, 'Scheduling of Vehicle from a Central Depot to a Number of Delivery Points,' Operation Research, Vol.12, No.4(1964), pp.568-581   DOI   ScienceOn
4 Dorigo, M., V. Maniezzo, A. Colorni, 'Ant System : An Autocatalytic Optimizing Process,' Technical Report, (1991), pp.91-116
5 Hong, S.C. and Y.B. Park, 'A Two-phase Method for the Vehicle Routing Problems with Time Windows,' IE Interfaces, Vol.17 (2004), pp.103-110
6 Reimann, M., K. Doerner, and R.F. Hartl, 'D-ants : Savings Based Ants Divide and Conquer the Vehicle Routing Problems with time Window,' Computer and Operations Research, Vol.31, No.4(2004), pp.563-591   DOI   ScienceOn
7 Solomon, M.M., 'Algorithm for the Vehicle Routing and Scheduling Problems with Time Window Constraints,' Operations Research, Vol.35(1987), pp.254-265   DOI   ScienceOn
8 Taillad, E., P. Badeau, M. Gendreau, F. Geurtin, and J.Y. Potvin, 'A Tabu Search Heuristic for the Vehicle Routing Problem with Time Windows,' Transportation Science, Vol.31(1997), pp.170-186   DOI   ScienceOn
9 Chio-ho CHEN and Ching-Jung TING, 'A Hybrid Ant Colony System for Vehicle Routing Problem with Time Windows,' Journal of the Eastern Asia Society for Transportation Studies, Vol.6(2005), pp.2822-2836
10 Gambardella, L.M., E. Taillard, and G. Agazzi, MACS-VRPTW : A Multiple Ant Colony System for Vehicle Routing Problems with Time Windows, New Ideas in Optimization, McGraw-Hill, London, (1999), pp.63-76
11 Rochat, Y. and E.D Taillard, 'Probability Diversification and Intensification in Local Search for Vehicle Routing,' Journal of Heuristics, Vol.1(1995), pp.147-167   DOI
12 Dorigo, M. and G. Di Caro, The Ant Colony Optimization Meta-heuristic, New Ideas in Optimization, McGraw-Hill, New York, 1999
13 Desrochers, M., J. Desrosiers, and M.M Solomon, 'A New Optimization Algorithm for the Vehicle Routing Problem Time Windows,' Operations Research, Vol.40(1992), pp.342-354   DOI   ScienceOn
14 Koskosidis, Y.A., W.B. Powell, and M.M. Solomon, 'An Optimization-Based Heuristic for Vehicle Routing and Scheduling with Soft Time Window Constraints,' Transportation Science, Vol.26(1992), pp.69-85   DOI
15 Potvin, J.Y. and S. Bengio, 'The Vehicle Routing Problem with Time Windows Part II : Genetic Search,' INFORMS Journal on Computing, Vol.8(1996), pp.165-172   DOI   ScienceOn
16 Ball, M.O., T.L. Magnanti, C.L. Monma, G.L. Nemhauser, Network Routing, North-Holland, Amsterdam, 1995
17 Chiang, W.C. and R.A. Russell, 'A Reactive Tabu Search Metaheuristics for the Vehicle Routing Problem with Time Windows,' IN FORMS Journal on Computing, Vol.9(1997), pp.417-430   DOI   ScienceOn
18 Dorigo, M. and G. Di Caro, Ant Algorithm for Discrete Optimization, Artificial Life, MIT Press, (1999), pp.137 -172
19 Jose, B. and A. Mercer, 'A Tabu Search Algorithm for the Multi-trip Vehicle Routing and Scheduling Problem,' European Journal if Operations Researchs, Vol.100(1996), pp.180- 191   DOI   ScienceOn
20 Dantzig, G.B. and J.H. Ramser, 'The Truck Dispatching Problem,' Management Science, Vol.6(1959), pp.80-91   DOI   ScienceOn
21 Tan, K.C., L.H. Lee, Q.L. Zhu, and K. Ou, 'Heuristic Methods for Vehicle Routing Problem with Time Window,' Artificial Intelligence in Engineering, Vol.15(2000), pp.281-295
22 Bullnheimer, B., R.F. Hartl, and C. Strauss, An Improved Ant System for the Vehicle Routing Problem, Annals of Operations Research, Vol.89(1999), pp.319-328   DOI