Industrial Engineering and Management Systems

Korean Institute of Industrial Engineers (대한산업공학회)
권호 표지
DOI QR코드

DOI QR Code

A Genetic Algorithm Based Approach to the Profitable Tour Problem with Pick-up and Delivery

  • Lee, Hae-Kyeong (Department of Industrial and Management Engineering, Kyungsung University) ;
  • Ferdinand, Friska Natalia (Department of Industrial and Management Engineering, Kyungsung University) ;
  • Kim, Tai-Oun (Department of Industrial and Management Engineering, Kyungsung University) ;
  • Ko, Chang-Seong (Department of Industrial and Management Engineering, Kyungsung University)
  • Received : 2010.02.17
  • Accepted : 2010.05.17
  • Published : 2010.06.01
Download PDF
⟨ Previous Next ⟩

Abstract

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.

Keywords

References

  1. Balas, E. (1989), The prize collecting travelling salesman problem, Networks, chapter 19, 621-636. https://doi.org/10.1002/net.3230190602
  2. 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. https://doi.org/10.1016/0305-0548(83)90030-8
  3. Cheung, W., Leung, L. C. and Wong, Y. M. (2001), Strategic service network design for DHL Hong Kong. Interfaces, 31(4), 1-14.
  4. 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. https://doi.org/10.1111/j.1475-3995.1995.tb00023.x
  5. Feillet, D., Dejax, P. and Gendreau, M. (2005), Travelling salesman problems with profits, Transportation Science, 39(2), 188-205. https://doi.org/10.1287/trsc.1030.0079
  6. 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.
  7. Gen, M. and Cheng, R. (2000), Genetic Algorithms and Engineering Optimization, New York: Wiley
  8. Goldberg, D. E. (1989), Genetic Algorithms in Search, Optimization and Machine Learning, Reading, MA: Addison Wesley.
  9. 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. https://doi.org/10.1111/j.1475-3995.2007.00580.x
  10. 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. https://doi.org/10.1287/trsc.24.4.245
  11. Min, H. (1994), Location analysis of international consolidation terminals using the analytic hierarchy process, Journal of Business Logistics, 15(2), 25-44.
  12. 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.
  13. Powell, W. B. (1986), A local improvement heuristic for the design of less-than-truckload motor carrier networks, Transportation Science, 20(4), 246-257. https://doi.org/10.1287/trsc.20.4.246
  14. Schneider, J. B., Symons, J. G., and Goldman, M. (1972), Planning transportation terminal systems in urban regions, Transportation Research, 6(3), 257-273. https://doi.org/10.1016/0041-1647(72)90018-4
  15. 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.

Cited by

  1. A customer selection and vehicle scheduling model for moving companies vol.12, pp.9, 2010, https://doi.org/10.1080/19427867.2019.1671061