Browse > Article

Application of Ant System Algorithm on Parcels Delivery Service in Korea  

Jo, Wan-Kyung (동부엔지니어링(주) 교통연구실)
Rhee, Jong-Ho (경기대학교 첨단산업공학부 도시.교통공학)
Publication Information
Journal of Korean Society of Transportation / v.23, no.4, 2005 , pp. 81-91 More about this Journal
Abstract
The Traveling Salesman Problem(TSP) is one of the NP-complete (None-deterministic Polynomial time complete) route optimization problems. Its calculation time increases very rapidly as the number of nodes does. Therefore, the near optimum solution has been searched by heuristic algorithms rather than the real optimum has. This paper reviews the Ant System Algorithm(ANS), an heuristic algorithm of TSP and its applicability in the parcel delivery service in Korea. ASA, which is an heuristic algorithm of NP-complete has been studied by M. Dorigo in the early 1990. ASA finds the optimum route by the probabilistic method based on the cumulated pheromone on the links by ants. ASA has been known as one of the efficient heuristic algorithms in terms of its calculation time and result. Its applications have been expanded to vehicle routing problems, network management and highway alignment planning. The precise criteria for vehicle routing has not been set up in the parcel delivery service of Korea. Vehicle routing has been determined by the vehicle deriver himself or herself. In this paper the applicability of ASA to the parcel delivery service has been reviewed. When the driver s vehicle routing is assumed to follow the Nearest Neighbor Algorithm (NNA) with 20 nodes (pick-up and drop-off places) in $10Km{\times}10Km$ service area, his or her decision was compared with ASA's one. Also, ASA showed better results than NNA as the number of nodes increases from 10 to 200. If ASA is applied, the transport cost savings could be expected in the parcel delivery service in Korea.
Keywords
Ant System;
Citations & Related Records
연도 인용수 순위
  • Reference
1 윤민영(1999), '병렬 유전 담금질 알고리즘에 대한 연구', 정보산업기술논총 제4집
2 최진영 외(2001), 'Genetic Algorithm Toolbox', 서울대학교
3 B.Bullnheimer, R.F.Hartl, C.Strauss(1999) , 'An improved ant system algorithm for the vehicle routing problem', Annals of Operations Research 89, pp.319-329   DOI
4 B.Bullnheimer, R.F.Hartl, C.Strauss(1997), 'Applying the Ant System to the Vehicle Routing Problem', Sophia-Antipolis, France July, pp.21-24
5 Karl Doerner, Richard F. Hartl. Marc Reimann(2001), 'A hybrid ACO algorithm for the Full Truckload Transportation Problem', Institut fur Information-sverarbeitung, Abt. Produktionsmanagement
6 Karl Doerner, Richard F. Hartl. Marc Reimann(2000), 'Ant Colony Optimization applied to the Pickup and Delivery Problem', Institut for Informationsverarbeitung, Abt. Produktionsmanagement
7 장병만(1990), '공공차량 경로문제 최적해법', 서울산업대학논문집 제31집, pp.207-219
8 윤대식(2001) , '교통수요분석', 박영사, pp.170-181
9 M. Dorigo, L.M. Gambardella(1997), 'Ant Colony System: A Cooperative Learning Approach to the Traveling Salesman Problem', IEEE Transactions on Evolutionary Computation, Vol.1   DOI   ScienceOn
10 John Sum, Hong Shen, Gilbert H. Young, Jie Wu(1999), 'Analysis on extended ant routing algorithms for network management', IEEE Transactions on Parallel and Distributed Systems
11 신주쿠구 코우에이 시스템 주식회사(1999), '자동배차시스템의 실례소계', 로지스틱스 워크숍 세미나 '99
12 Eric Bonabeau, Marco Dorigo, Guy Theraulaz (1999), 'Swarm Intelligence from Natural to Artificial Systems', Oxford University
13 V. Maniezzo, A. Carbonaro, H. Hildmann(2001), 'An ANTS Heuristic for the Long Term Car Pooling Problem', Department of Computer Science University of Bologna & Amsterdam
14 송성현, 강승우(1998), '분할배달을 고려한 발견적 배송경로 결정 방법', 과학기술연구논문집, Vol.9 No.2, pp.663-672
15 황홍석(1999), '차량경로문제를 위한 2-단계 발견적 방법', 동의대학교 산업기술연구지 제14권, pp.191-196
16 U.S. Department of Transportation(1981) 'The State of the Art in the Routing and Scheduling of Vehicles and Crews'
17 J.C. Jong(1998), 'Optimizing Highway Alignments with Genetic Algorithms', University of Maryland, College Park, USA
18 Manoj K. JHA(2001), 'Geographic Information Systems and Artificial Intelligence Integration in Transportation', SCI2001 & ISAS2001
19 M.Dorigo, V.Maniezzo, A.Colorni(1996), 'Ant System: Optimization by a Colony of Cooperating Agents', IEEE Transactions on Systems. Man. and Cybernetics-Part B: Cybernetics. Vol. 26   DOI
20 건설교통부(2001), '국가물류기본계획(2001-2020)'
21 M.K Jha, Ph.D. Dissertation(2000), 'A Geographic Information Systems-Based Model for Highway Design Optimization', University of Maryland, College Park, USA
22 M.Dorigo, V.Maniezzo, A.Colorni(1991), 'Ant System: An Autocatalytic Optimizing Process', Technical Report No.91-016
23 송성헌(1985), '배차문제의 발견적 해의 개선에 관한 연구', 홍대논총, Vol.17 No.2
24 이우승 외(2001), '서울시 택배제도 개선방안 연구', 서울시정개발연구원, pp13-50
25 류승헌, 김규호(1998), '진화계획법(EP)을 이용한 산업체 열병합발전시스템의 일간 최적운전계획', 영남대학교 연구논총 제4권, pp.61-71
26 M. Dorigo, G. Di Caro, L.M. Gambardella(1999), 'Ant Algotithms for Discrete Optimization', Technical Report IRIDIA/98-10, Universite Libre de Bruxelles, Belgium & To appear in Artificial Life Vol. 5, No.3, pp.137-172   DOI   ScienceOn
27 Reimann, M. Shtovba, S. Nepomuceno(2001) , 'A hybrid ACO-GA approach to solve Vehicle Routing Problems', Student Papers of the Complex Systems Summer School. Budapest July 15
28 박준환(2001), 'Tabu Search를 이용한 지선버스 노선설계에 관한 연구', 서울대학교 환경대학원
29 Karl Doerner, Richard F. Hartl. Marc Reimann(2000), 'Cooperative Ant Colonies for Optimizing Resource Allocation in Transportation', Institut fur Informationsverarbeitung, Abt. Produktionsmanagement
30 양성민(2001), '메타휴리스틱을 이용한 다기능기계의 일정계획', 공학기술연구지, Vol.6, No.1