Browse > Article
http://dx.doi.org/10.3745/KIPSTB.2010.17B.5.389

An Ant Colony Optimization Heuristic to solve the VRP with Time Window  

Hong, Myung-Duk (인하대학교 정보공학과)
Yu, Young-Hoon (인하대학교 컴퓨터정보공학과)
Jo, Geun-Sik (인하대학교 컴퓨터정보공학과)
Publication Information
The KIPS Transactions:PartB / v.17B, no.5, 2010 , pp. 389-398 More about this Journal
Abstract
The Vehicle Routing and Scheduling Problem with Time Windows(VRSPTW) is to establish a delivery route of minimum cost satisfying the time constraints and capacity demands of many customers. The VRSPTW takes a long time to generate a solution because this is a NP-hard problem. To generate the nearest optimal solution within a reasonable time, we propose the heuristic by using an ACO(Ant Colony Optimization) with multi-cost functions. The multi-cost functions can generate a feasible initial-route by applying various weight values, such as distance, demand, angle and time window, to the cost factors when each ant evaluates the cost to move to the next customer node. Our experimental results show that our heuristic can generate the nearest optimal solution more efficiently than Solomon I1 heuristic or Hybrid heuristic applied by the opportunity time.
Keywords
Vehicle Routing Problem; Combinatorial Optimization; Ant Colony Optimization; Meta Heuristic;
Citations & Related Records
Times Cited By KSCI : 2  (Citation Analysis)
연도 인용수 순위
1 Q. Chengming, C. Shoumei and S. Yunchuan, “Using Ant Colony System and Local Search Methods to Solve VRPTW,” IEEE Pacific-Asia Workshop on Computational Intelligence and Industrial Application, pp.478-482, 2008.
2 R. A. Russell, “An Effective heuristic for the M-tour traveling salesman problem with some side conditions,” Operations Research, Vol.25, No.3, pp.517-524, 1977.   DOI   ScienceOn
3 P. Prosser, and P. Shaw, “Study of greedy search with multiple improvement heuristics for vehicle routing problems,” Working paper, university of Strathclyde, Glasgow, Scotland, 1996.
4 M. Zargayouna, F. Balbo, and G. Scemama, “A multi-agent approach for the dynamic VRPTW,” In Proceedings of the International Workshop on Engineering Societies in the Agents World, Saint-Etienne, Springer Verlag, 2008.
5 O. Braysy, and M. Gendreau, “Vehicle Routing Problem with Time Windows, Part I - Route Construction and Local Search Algorithms,” Transportation Science, Vol.39, No.1, pp.104-118, 2005.   DOI   ScienceOn
6 H. Nazif, and L. S. Lee, “Optimized Crossover Genetic Algorithm for Vehicle Routing Problem with Time Windows,” American Journal of Applied Sciences, Vol.7, No.1, pp.95-101, 2010.   DOI   ScienceOn
7 N. A. El-Sherbeny, “Vehicle routing with time windows: An overview of exact, heuristic and metaheuristic methods,” Journal of King Saud University - Science, Vol.22, No.3, pp.123-131, 2010.   DOI   ScienceOn
8 유영훈, 차상진, 조근식, “시간 제약을 가지는 차량 경로 스케줄링 문제 해결을 위한 기회시간 반영 하이브리드 휴리스틱”, 지능정보연구, 제15권, 제3호, pp.129-142, 2009.
9 홍명덕, 유영훈, 조근식, “차량 경로 스케줄링 문제 해결을 위한 멀티 비용 함수를 갖는 개미 군집 최적화 기법 기반의 휴리스틱”, 제 33회 한국정보처리학회 춘계학술발표대회 논문집, 제17권, 제1호, pp.314-317, 2010.
10 이승관, 정태충, “Ant Colony System에서 효율적 경로 탐색을 위한 지역갱신과 전역갱신에서의 추가 강화에 관한 연구”, 한국정보처리학회 논문지, 제10-B권, 제3호, pp.237-242, 2003.
11 J. K. Lenstra, and A. H. G. Rinnooy Kan, “Complexity of vehicle routing and scheduling problems,” Networks, Vol.11, No.2, pp.221-227, 1981.   DOI
12 M. W. P. Savelsbergh, “Vehicle routing and computer graphics,” Centre for Mathematics and Computer Science, Amsterdam, Note OS-N8402, 1984.
13 S. R. Thangiah, K. E. Nygard, and P. L. Juell, “GIDEON: A genetic algorithm system for vehicle routing with time windows,” Artificial Intelligence Application, Proceedings., 7th IEEE Conference on., pp.322-328, 1991.
14 M. M. Solomon, “Algorithms for the vehicle routing and scheduling problems with time window constraints,” Operations Research, Vol.35, No.2, pp.254-265, 1987.   DOI   ScienceOn
15 B.-L. Garcia, J.-Y. Potvin, and J.-M. Rousseau, “A parallel implementation of the tabu search heuristic for vehicle routing problems with time window constraints,” Computers and Operations Research, Vol.21, No.9, pp.1025-1033, 1994.   DOI   ScienceOn
16 O. Braysy, and M. Gendreau, “Vehicle Routing Problem with Time Windows, Part II - Metaheuristics,” Transportation Science, Vol.39, No.1, pp.119-139, 2005.   DOI   ScienceOn
17 E. Taillard, P. Badeau, M. Gendreau, F. Guertin, and J.-Y. Potvin, “A Tabu Search heuristic for the Vehicle Routing Problem with Soft Time Windows,” Transportation Science, Vol.31, No.2, pp.170-186, 1997.   DOI   ScienceOn
18 B. Bullnheimer, R. F. Hartl, and C. Strauss, “Applying the Ant System to the Vehicle Routing Problem,” MIC97, pp.1-12, 1997.
19 L. M. Gambardella, 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, UK, pp.63-76, 1999.
20 M. Reimann, K. Doerner, and R. F. Hartl, “D-ants: Saving Based Ants Divide and Conquer the Vehicle Routing Problems with Time Window,” Computer and Operations Research, Vol.31, No.4, pp.563-591, 2004.   DOI   ScienceOn
21 L. Bodin, B. Golden, A. Assad, and M. Ball, “Routing and Scheduling of Vehicles and Crews: The State of the Art,” Computer and Operations Research, Vol.10, No.2, pp.63-211, 1983.   DOI   ScienceOn