Journal of Korean Society of Industrial and Systems Engineering (산업경영시스템학회지)

Society of Korea Industrial and System Engineering (한국산업경영시스템학회)
권호 표지
DOI QR코드

DOI QR Code

Heuristics for Rich Vehicle Routing Problem : A Case of a Korean Mixed Feed Company

다특성 차량경로문제에 대한 휴리스틱 알고리즘 : 국내 복합사료 업체 사례

  • 손동훈 (인하대학교 물류전문대학원) ;
  • 김화중 (인하대학교 물류전문대학원)
  • Received : 2018.09.27
  • Accepted : 2018.10.15
  • Published : 2019.03.31
Download PDF
⟨ Previous Next ⟩

Abstract

The vehicle routing problem is one of the vibrant research problems for half a century. Many studies have extensively studied the vehicle routing problem in order to deal with practical decision-making issues in logistics. However, developments of new logistics strategies have inevitably required investigations on solution methods for solving the problem because of computational complexity and inherent constraints in the problem. For this reason, this paper suggests a simulated annealing (SA) algorithm for a variant of vehicle routing problem introduced by a previous study. The vehicle routing problem is a multi-depot and multi-trip vehicle routing problem with multiple heterogeneous vehicles restricted by the maximum permitted weight and the number of compartments. The SA algorithm generates an initial solution through a greedy-type algorithm and improves it using an enhanced SA procedure with three local search methods. A series of computational experiments are performed to evaluate the performance of the heuristic and several managerial findings are further discussed through scenario analyses. Experiment results show that the proposed SA algorithm can obtain good solutions within a reasonable computation time and scenario analyses show that a transportation system visiting non-dedicated factories shows better performance in truck management in terms of the numbers of vehicles used and trips for serving customer orders than another system visiting only dedicated factories.

Keywords

References

  1. Baldacci, R., Christofides, N., and Mingozzi, A., An exact algorithm for the vehicle routing problem based on the set partitioning formulation with additional cuts, Mathematical Programming, 2008, Vol. 115, No. 2, pp. 351-385. https://doi.org/10.1007/s10107-007-0178-5
  2. Baldacci, R., Toth, P., and Vigo, D., Recent advances in vehicle oruting exact algorithms, 4OR : A Quarterly Journal of Operations Research, 2007, Vol. 5, No. 4, pp. 269-298.
  3. Cho, B.-M., Kim, J.-G., and Lee, D.-H., A two-stage heuristic for period vehicle routing : Minimizing the fleet size, Journal of Society of Korea Industrial and Systems Engineering, 2008, Vol. 31, No. 3, pp. 90-100.
  4. Dantzig, G.B. and Ramser, J.H., The Truck Dispatching Problem, Management Science, 1959, Vol. 6, No. 1, pp. 80-91. https://doi.org/10.1287/mnsc.6.1.80
  5. Fukasawa, R., Longo, H., Lysgaard, J., Aragao, M., Reis, M., Uchoa, E., and Werneck, R., Robust branchand- cut-and-price for the capacitated vehicle routing problem, Mathematical Programming, 2006, Vol. 106, No. 3, pp. 491-511. https://doi.org/10.1007/s10107-005-0644-x
  6. Goel, A. and Gruhn, V., Large neighborhood search for rich VRP with multiple pickup and delivery locations, In Operations Research Proceedings 2005, Haasis, H.D., Kopfer, H., and Schonberger, J. (Eds.), Operations Research Proceedings, 2005, pp. 367-372.
  7. Hartl, R.F., Hasle, G., and Janssens, G.K., Special issue on rich vehicle routing problems, Central European Journal of Operations Research, 2006, Vol. 14, No. 2, pp. 103-104. https://doi.org/10.1007/s10100-006-0162-9
  8. Kim, H.J., Kim, J.W., Yang, W.S., Lee, K.Y., and Kwon, O.S., Effects of Truck-shared Delivery : A Case of a Korean Mixed Feed Company, Journal of International Logistics and Trade, 2016, Vol. 14, No. 2, pp. 165-173. https://doi.org/10.24006/jilt.2016.14.2.003
  9. Kirkpatrick, S., Gelatt, C.D., and Vecchi, M.P., Optimization by simulated annealing, Science, 1983, Vol. 220, pp. 671-680. https://doi.org/10.1126/science.220.4598.671
  10. Lahyani, R., Khemakhem, M., and Semet, F., Rich Vehicle Routing Problems : From a Taxonomy to Definition, European Journal of Operational Research, 2015, Vol. 241, No. 1, pp. 1-14. https://doi.org/10.1016/j.ejor.2014.07.048
  11. Laporte, G., Fifty years of vehicle routing, Transportation Science, 2009, Vol. 43, No. 4, pp. 408-416. https://doi.org/10.1287/trsc.1090.0301
  12. Lee, S.-C. and Yu, J.-C., Improved VRP & GA-TSP model for multi-logistics center, Journal of the Korea Academia-Industrial Cooperation Society, 2007, Vol. 8, No. 5, pp. 1279-1288.
  13. Pellegrini, P., Application of Two Nearest Neighbor Approaches to a Rich Vehicle Routing Problem, Technical Report, 2005.
  14. Rieck, J. and Zimmermann, J., A new mixed integer linear model for a rich vehicle routing problem with docking constraints, Annuals of Operations Research, 2010, Vol. 181, No. 1, pp. 337-358. https://doi.org/10.1007/s10479-010-0748-4
  15. Ropke, S. and Pisinger, D., A unified heuristic for a large class of vehicle routing problems with backhauls, European Journal of Operational Research, 2006b, Vol. 171, No. 3, pp. 750-775. https://doi.org/10.1016/j.ejor.2004.09.004
  16. Ropke, S. and Pisinger, D., An adaptive large neighborhood search heuristic for the pickup and delivery problem with time windows, Transportation Science, 2006a, Vol. 40, No. 4, pp. 455-472. https://doi.org/10.1287/trsc.1050.0135
  17. Santillan, C.G., Reyes, L.C., Rodriguez, M.L.M., Barbosa, J.J.G., Opez, O.C.L., Zarate, G.R., and Hernandez, P., Variants of VRP to optimize logistics management problems, In Zezzatti, O., Ochoa, C.A., Chira, C., Hernandez, A., and Basurto, M. (Eds.), Logistics Management and Optimization through Hybrid Artificial Intelligence Systems, 2012, pp. 207-237.
  18. Shaw, P., Using constraint programming and local search methods to solve vehicle routing problems, In : Proceedings of the 4th International Conference on Principles and Practice of Constraint Programming (CP-98) (Lecture Notes in Computer Science), Maher, M. and Puget, J.F. (Eds.), 1998, pp. 417-431.
  19. Solomon, M.M., Algorithms for the vehicle routing and scheduling problems with time window constraints, Operations Research, 1987, Vol. 35, No. 2, pp. 166-324. https://doi.org/10.1287/opre.35.2.166
  20. Suman, B. and Kumar, P., A survey of simulated annealing as a tool for single and multiobjective optimization, Journal of the Operational Research Society, 2006, Vol. 57, No. 10, pp. 1143-1160. https://doi.org/10.1057/palgrave.jors.2602068
  21. Vidal, T., Crainic, T.G., Gendreau, M., and Prins, C., Heuristics for multi-attribute vehicle routing problems : A survey and synthesis, European Journal of Operational Research, 2013, Vol. 231, No. 1, pp. 1-21. https://doi.org/10.1016/j.ejor.2013.02.053
  22. Wen, M., Clausen, J., and Larsen, J., Rich Vehicle Routing Problems and Applications, [Ph.D Thesis], [Lyngby, Denmark] : Management, Technical University of Denmark, 2010.
  23. Wen, M., Krapper, E., Larsen, J., and Stidsen, T.K., A multilevel variable neighborhood search heuristic for a practical vehicle routing and driver scheduling problem, Networks, 2011, Vol. 58, No. 4, pp. 311-322. https://doi.org/10.1002/net.20470
  24. Wen, M., Larsen, J., Clausen, J.F., and Laporte, G., Vehicle routing with cross-docking, Journal of the Operational Research Society, 2008, Vol. 60, No. 12, pp. 1708-1718. https://doi.org/10.1057/jors.2008.108
  25. Zeng, L., Ong, H.L., and Ng, K.M., A generalized crossing local search method for solving vehicle routing problems, Journal of the Operational Research Society, 2007, Vol. 58, No. 4, pp. 528-532. https://doi.org/10.1057/palgrave.jors.2602171