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) |
1 | Min, H. (1994), Location analysis of international consolidation terminals using the analytic hierarchy process, Journal of Business Logistics, 15(2), 25-44. |
2 | 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. |
3 | Powell, W. B. (1986), A local improvement heuristic for the design of less-than-truckload motor carrier networks, Transportation Science, 20(4), 246-257. DOI ScienceOn |
4 | Schneider, J. B., Symons, J. G., and Goldman, M. (1972), Planning transportation terminal systems in urban regions, Transportation Research, 6(3), 257-273. DOI |
5 | 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. |
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 | 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. DOI |
10 | 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. DOI ScienceOn |
11 | Balas, E. (1989), The prize collecting travelling salesman problem, Networks, chapter 19, 621-636. DOI |
12 | 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. DOI ScienceOn |
13 | Feillet, D., Dejax, P. and Gendreau, M. (2005), Travelling salesman problems with profits, Transportation Science, 39(2), 188-205. DOI ScienceOn |
14 | Cheung, W., Leung, L. C. and Wong, Y. M. (2001), Strategic service network design for DHL Hong Kong. Interfaces, 31(4), 1-14. |
15 | 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. DOI ScienceOn |