Nearest L-Neighbor Method with De-crossing in Vehicle Routing Problem
0
조회
0
다운로드
0
인용
0
참고문헌
키워드
초록
The field of vehicle routing is currently growing rapidly because of many actual applications in truckload and less than truckload trucking, courier services, door to door services, and many other problems that generally hinder the optimization of transportation costs in a logistics network. The rapidly increasing number of customers in such a network has caused problems such as difficulty in cost optimization in terms of getting a global optimum solution in an acceptable time. Fast algorithms are needed to find sufficient solutions in a limited time that can be used for real-time scheduling. In this paper, the nearest L-method (NLNM) is proposed to obtain a vehicle routing solution. String neighbors of different lengths were chosen, tested and compared. The applied de-crossing procedure is meant to solve the routes by NLNM by giving a better solution and shorter computation time than that of NLNM with long string neighbors.
Abstract
The field of vehicle routing is currently growing rapidly because of many actual applications in truckload and less than truckload trucking, courier services, door to door services, and many other problems that generally hinder the optimization of transportation costs in a logistics network. The rapidly increasing number of customers in such a network has caused problems such as difficulty in cost optimization in terms of getting a global optimum solution in an acceptable time. Fast algorithms are needed to find sufficient solutions in a limited time that can be used for real-time scheduling. In this paper, the nearest L-method (NLNM) is proposed to obtain a vehicle routing solution. String neighbors of different lengths were chosen, tested and compared. The applied de-crossing procedure is meant to solve the routes by NLNM by giving a better solution and shorter computation time than that of NLNM with long string neighbors.
참고문헌 (19)
- Ahuja, R.K, "Network flows: theory, algorithms and applications" (1993), Prentice Hall
- Arya, S, "An Optimal Algorithm for Approximate Nearest Neighbor Searching in Fixed Dimensions", Journal of the A, 45(6), pp.891~923 (1994)
- Chitty, D.M, "A hybrid ant colony optimization technique for dynamic vehicle routing", Book chapter, Genetic and Evolutionary Computation – GECCO 2004, 48~59 (2004)
- Fabri, A, "On Dynamic Pickup and Delivery Vehicle Routing with Several Time Windows and Waiting Times", Journal of Transportation Research Part B, 40, pp.335~350 (2006)
- Fan, J, "A Multiple Vehicles Routing Problem Algorithm with Stochastic Demand", The Sixth World on Intelligent Control and Automation WCICA, ~ (2006)
- Gendreau, M, "Stochastic vehicle routing", European Journal Of Operational Research, 88, pp.3~12 (1996)
- Haghani, A, "A Dynamic Vehicle Routing Problem with Time-Dependent Travel Times", Journal of Computers & Operations Research, 32, pp.2959~2986 (2005)
- Hashimoto, H, "The Vehicle Routing Problem with Flexible Time Windows and Travelling Times", Journal of Discrete Applied Mathematics, 154, pp.2271~2290 (2006)
- Hanshar, F.T, "Dynamic vehicle routing using genetic algorithms", Applied Intelligent, 27, pp.89~99 (2007)
- Ichoua, S, "Vehicle Dispatching with Time-Dependent Travel Times", European Journal of Operational Research, 114, pp.379~396 (2003)
- Michalewicz, "Genetic algorithms + data structures = evolution programs" (1996), Springer
- Montemanni, R, "Ant colony system for a dynamic vehicle routing problem", Journal of Combinatorial Optimization, 10, pp.327~343 (2005)
- Simchi-Levi, D, "Design and Managing the Supply Chain: Concepts, Strategies and Case Studies" (2003), McGraw Hill
- "Solomon data"[URL]
- 신정훈, "컨테이너터미널 운영효율성을 위한 RTLS 기반 YT Dynamic Operation 모델", 한국항해항만학회지, 32(5), pp.369~377 (2008), 한국항해항만학회
- 신정훈, "컨테이너터미널 트랜스퍼 크레인의 배정 및 이동경로 최적화 모델", 한국항해항만학회지, 32(6), pp.465~471 (2008), 한국항해항만학회
- Shin, J.Y, "Vehicle Routing Problem for delivering containers using combined chassis trailers", Conference of 2008 KINPR, pp.155~156 (2008)
- Toth, P, "The Vehicle Routing Problem", Society for Industrial and Applied Mathematics (SIAM)., ~ (2002)
- Zeimpekis, V, "A Dynamic Real-Time Vehicle Routing System for Distribution Operations", Consumer Driven Electronic Transformation, Springer., ~ (2005)