Advanced SearchSearch Tips
A Genetic Algorithm Based Approach to the Profitable Tour Problem with Pick-up and Delivery
facebook(new window)  Pirnt(new window) E-mail(new window) Excel Download
 Title & Authors
A Genetic Algorithm Based Approach to the Profitable Tour Problem with Pick-up and Delivery
Lee, Hae-Kyeong; Ferdinand, Friska Natalia; Kim, Tai-Oun; Ko, Chang-Seong;
  PDF(new window)
As express courier market expands rapidly, companies are exposed to fierce competition. To cope with struggle for their survival, they are continuously making efforts to improve their service system. Even if most of service centers are directly linked to a consolidation terminal in courier service network, some of them with regional disadvantages are operated in milk run type from/to the consolidation terminal, which is a traditional PDP (Pick-up and Delivery Problem). This study suggests an approach to solve the PDP with the objective of maximizing the incremental profit, which belongs to PTP (Profitable Tour Problem) class. After the PTP is converted to TSP (Traveling Salesman Problem) with the same objective, a heuristic algorithm based on GA (Genetic Algorithm) is developed and examined through an example problem in practice of a courier service company in Korea.
Pick-up and Delivery Problem;Milk Run;Express Courier Service;Profitable Tour Problem;Traveling Salesman Problem;Genetic Algorithm;
 Cited by
택배에서 전략적 제휴를 활용한 수집 및 배달 경로 설계,프리스카;김홍배;고창성;

한국SCM학회지, 2015. vol.15. 1, pp.63-70
Balas, E. (1989), The prize collecting travelling salesman problem, Networks, chapter 19, 621-636. crossref(new window)

Bodin, L., Golden, B., Assad, A. and Ball, M. (1983), Routing and scheduling of vehicles and crews: The state of the art, Computers and Operations Research, 10(2), 63-211. crossref(new window)

Cheung, W., Leung, L. C. and Wong, Y. M. (2001), Strategic service network design for DHL Hong Kong. Interfaces, 31(4), 1-14.

Dell'Amico, M., Maffioli, F., and Värbrand, P. (1995), On prize-collecting tours and the asymmetric travelling salesman problem, International Transactions in Operational Research, 2(3), 297-308. crossref(new window)

Feillet, D., Dejax, P. and Gendreau, M. (2005), Travelling salesman problems with profits, Transportation Science, 39(2), 188-205. crossref(new window)

Fischetti, M. and Toth, P. (1988), An additive approach for the optimal solution of the prize-collecting travelling salesman problem, Vehicle Routing: Methods and Studies (B. L. Golden and A. A. Assad, eds), Elsevier Science Publishers, B.V., 319-343.

Gen, M. and Cheng, R. (2000), Genetic Algorithms and Engineering Optimization, New York: Wiley

Goldberg, D. E. (1989), Genetic Algorithms in Search, Optimization and Machine Learning, Reading, MA: Addison Wesley.

Ko, C. S., Min, H., and Ko, H. J. (2007), Determination of cutoff time for express courier services: A genetic algorithm approach, International Transactions in Operational Research, 14(2), 159-177. crossref(new window)

Leung, J. M. Y., Magnanti, T. L., and Singhal, V. (1990), Routing in point-to-point delivery systems: formulations and solution heuristics, Transportation Science, 24(4), 245-260. crossref(new window)

Min, H. (1994), Location analysis of international consolidation terminals using the analytic hierarchy process, Journal of Business Logistics, 15(2), 25-44.

Powell, W. B. and Sheffi, Y. (1983), The load planning problem of motor carriers: problem description and a proposed solution approach, Transportation Research, 17A(6), 471-480.

Powell, W. B. (1986), A local improvement heuristic for the design of less-than-truckload motor carrier networks, Transportation Science, 20(4), 246-257. crossref(new window)

Schneider, J. B., Symons, J. G., and Goldman, M. (1972), Planning transportation terminal systems in urban regions, Transportation Research, 6(3), 257-273. crossref(new window)

Tasgetiren, M. F. and Smith, A. E. (2000), A genetic algorithm for the orienteering problem, Proceedings of 2000 Congress Evolutionary Computation, San Diego, CA, 1190-1195.