Browse > Article

An Optimization Algorithm for The Pickup and Delivery Problem With Time Windows  

Kang, Ja-Young (Department of Industrial Engineering, Korea Advanced Institute of Science and Technology)
Zang, Hee-Jeong (Department of Industrial Engineering, Korea Advanced Institute of Science and Technology)
Kang, Jang-Ha (Department of Industrial Engineering, Korea Advanced Institute of Science and Technology)
Park, Sung-Soo (Department of Industrial Engineering, Korea Advanced Institute of Science and Technology)
Publication Information
Journal of Korean Institute of Industrial Engineers / v.33, no.1, 2007 , pp. 33-43 More about this Journal
Abstract
The pickup and delivery problem with time windows generally involves the construction of optimal routeswhich satisfy a set of transportation requests under pairing, precedence, time window, vehicle capacity, andavailability constraints. In this paper, we added some constraints to the problem and adopted an objectivefunction based on number of used vehicles, total travel distance and total schedule duration to consider morerealistic problems. A branch and price algohthm for the problem is proposed and an enumeration method is usedfor the subproblems. The algorithm was tested on randomly generated instances and computational results werereported.
Keywords
Pickup and Delivery Problem with Time Windows; Branch-and-Price Algorithm;
Citations & Related Records
연도 인용수 순위
  • Reference
1 Dumas, Y, Desrosiers, J. and Soumis, F. (1991), The Pickup and Delivery Problem with Time Windows, European Journal of Operational Research, 54, 7-22   DOI   ScienceOn
2 Lau, H. C. and Liang (2001), Z. Pickup and Delivery with Time Windows: Algorithms and Test Case Generation, 13th IEEE International Conference on Tools with Artificial Intelligence
3 Kammarti, P., Hammadi, S., Borne, P. and Ksouri, M. (2004), A New Hybrid Evolutionary Approach for the Pickup and Delivery Problem with Time Windows, 2004 IEEE International Corference on Systems, Man and Cybernetics
4 Savelsbergh, M. W. P. and Sol, M. (1998), DRIVE: Dynamic Routing of Independence Vehicles, Operations Research, 46(4),474-490   DOI   ScienceOn
5 Savelsbergh, M. W. P. and Sol, M. (1995), The General Pickup and Delivery Problem, Transportation Science, 29, 17-29   DOI
6 Ball, M. O., Magnanti, T. L., Monma, C. L. and Nemhauser, G. L. (1995), Network Routing, Handbooks in Operations Research and Management Science, 8, 35-139, Elsevier Science B. V., Amsterdam, Netherlands
7 Nanry, W. P. and Barnes, J. W. (2000), Solving the Pickup and Delivery Problem with Time Windows Using Reactive Tabu Search, Transportation Research, Part B, 34, 107-121   DOI   ScienceOn
8 Kang, J. (2004), An Optimization Algorithm for a Generalized Pickup and Delivery Problem with Time Windows, Korea Advanced Institute of Science and Technology, Thesis
9 Jih, W. R, Kao, C. Y and Hsu, J. Y. (2002), Using Family Competition Genetic Algorithm in Pickup and Delivery Problem with Time Window Constraints, Proceedings of the 2002 IEEE International Symposium on Intelligent Control
10 Barnhart, C, Johnson, E. L., Nemhauser, G. L., Savelsbergh, M. W. P. and Vance, P. H. (1998), Branch-and-Price: Column Generation for Solving Huge Integer Programs, Operations Research, 46, 316-329   DOI   ScienceOn
11 Li, H. and Lim. A. (2001), A metaheuristic for the pickup and delivery problem with time windows, 13th IEEE International Conference on Tools with Artificial Intelligence