Advertisement

Annals of Operations Research

, Volume 273, Issue 1–2, pp 163–186 | Cite as

Fresh seafood delivery routing problem using an improved ant colony optimization

  • Baozhen Yao
  • Chao ChenEmail author
  • Xiaolin Song
  • Xiaoli Yang
OR in Transportation

Abstract

Energy cost for keeping fresh seafood in cold condition is a main feature of a fresh seafood delivery routing problem. In the delivery routing problem, energy cost varies during the transportation process and the service process. In addition, there are many fresh seafood product factories whose seafood products should be delivered to a set of customers. Therefore, this paper models the fresh seafood delivery problem as a multi-depot vehicle routing problem, which aims to find the routes with the least cost. Due to the complexity of the problem, a method is used to reduce the complexity by changing the multi-depot vehicle routing problem into a vehicle routing problem with a dummy depot in this paper. Then, ant colony optimization (ACO) is used to solve this problem. Scanning strategy and crossover operation are also adopted to improve the performance of ACO. At last, the computational results of the benchmark problems of the multi-depot vehicle routing problem indicate the effectiveness of the algorithm. Furthermore, the real-life fresh seafood delivery routing problem from Dalian city suggests the proposed model is feasible.

Keywords

Fresh seafood Delivery routing problem Multi-depot Ant colony optimization Energy cost 

Notes

Acknowledgements

This work was supported in National Natural Science Foundation of China 51578112, 51208079 and 71571026, and the Fundamental Research Funds for the Central Universities DUT16YQ104.

References

  1. Albritton M. D., & Mcmullen, P. R. (2007). Optimal product design using a colony of virtual ants. European Journal of Operational Research, 176(1), 498–520.Google Scholar
  2. Angelelli, E., & Speranza, M. G. (2002). The periodic vehicle routing problem with intermediate facilities. European Journal of Operational Research, 137(2), 233–247.CrossRefGoogle Scholar
  3. Aras, N., Aksen, D., & Tekin, M. T. (2011). Selective multi-depot vehicle routing problem with pricing. Transportation Research Part C: Emerging Technologies, 19(5), 866–884.CrossRefGoogle Scholar
  4. Bell, J. E., & McMullen, P. R. (2004). Ant colony optimization techniques for the vehicle routing problem. Advanced Engineering Informatics, 1(8), 41–48.CrossRefGoogle Scholar
  5. Bullnheimer, B., Hartl, R. F., & Strauss, C. (1997). Applying the ant system to the vehicle routing problem. In Second metaheuristics international conference, MIC’97, Sophia-Antipolis France.Google Scholar
  6. Bullnheimer, B., Hartl, R. F., & Strauss, C. (1999). An improved ant system algorithm for the vehicle routing problem. Annals of Operations Research, 89, 319–328.CrossRefGoogle Scholar
  7. Chao, M. I., Golden, B. L., & Wasil, E. A. (1993). A new heuristic for the multi-depot vehicle routing problem that improves upon best known solutions. American Journal of Mathematical and Management Sciences, 13(3–4), 311–406.Google Scholar
  8. Chen, C. H., & Ting, C. J. (2006). An improved ant colony system algorithm for the vehicle routing problem. Journal of the Chinese Institute of Industrial Engineers, 23(2), 115–126.CrossRefGoogle Scholar
  9. Christofides, N., & Eilon, S. (1969). An algorithm for the vehicle dispatching problem. Journal of the Operational Research Society, 20, 309–318.CrossRefGoogle Scholar
  10. Colorni, A., Dorigo, M., Maniezzo, V., & Trubian, M. (1994). Ant system for job-shop scheduling. Jorbel-Belgian Journal of Operations Research Statistics and Computer Science, 34(1), 39–53.Google Scholar
  11. Cordeau, J. F., Gendreau, M., & Laporte, G. (1997). A tabu search heuristic for periodic and multi-depot vehicle routing problems. Networks, 30, 105–119.CrossRefGoogle Scholar
  12. Cornillier, F., Laporte, G., Boctor, F. F., & Renaud, J. (2009). The petrol station replenishment problem with time windows. Computers and Operations Research, 36(3), 919–935.CrossRefGoogle Scholar
  13. Croes, G. A. (1958). A method for solving traveling salesman problems. Operations Research, 6, 791–812.CrossRefGoogle Scholar
  14. Dondo, R. G., & Cerdá, J. (2009). A hybrid local improvement algorithm for large-scale multi-depot vehicle routing problems with time windows. Computers and Chemical Engineering, 33(2), 513–530.CrossRefGoogle Scholar
  15. Dorigo, M., Maniezzo, V., & Colorni, A. (1996). The ant system: Optimization by a colony of cooperating agents. IEEE Transactions on Systems, Mans, and Cybernetics, 1(26), 29–41.CrossRefGoogle Scholar
  16. Filipec, M., Skrlec, D., & Krajcar, S. (1997). Darwin meets computers: New approach to multiple depot capacitated vehicle routing problem. In 1997 IEEE International Conference on Systems, Man, and Cybernetics, 1997. Computational Cybernetics and Simulation. (Vol. 1, pp. 421–426). IEEE.Google Scholar
  17. Gambardella, L., Taillard, E., & Dorigo, M. (1997). Ant colonies for the QAP. Technical Report 97-4. Lugano: IDSIA.Google Scholar
  18. Gillett, B. E., & Johnson, J. G. (1976). Multi-terminal vehicle-dispatch algorithm. Omega, 4(6), 711–718.CrossRefGoogle Scholar
  19. Ho, W., Ho, G. T. S., Ji, P., & Lau, H. C. W. (2008). A hybrid genetic algorithm for the multi-depot vehicle routing problem. Engineering Applications of Artificial Intelligence, 21(4), 548–557.CrossRefGoogle Scholar
  20. Hsu, C. I., Hung, S. F., & Li, H. C. (2007). Vehicle routing problem with time-windows for perishable food delivery. Journal of Food Engineering, 80(2), 465–475.CrossRefGoogle Scholar
  21. Lim, A., & Zhu, W. (2006). A fast and effective insertion algorithm for multi-depot vehicle routing problem with fixed distribution of vehicles and a new simulated annealing approach. In International conference on industrial, engineering and other applications of applied intelligent systems (pp. 282–291). Berlin, Heidelberg: Springer.Google Scholar
  22. Luo, J. P., & Chen, M. R. (2014). Multi-phase modified shuffled frog leaping algorithm with extremal optimization for the MDVRP and the MDVRPTW. Computers and Industrial Engineering, 72, 84–97.CrossRefGoogle Scholar
  23. Mirabi, M., Fatemi Ghomib, S. M. T., & Jolaic, F. (2010). Efficient stochastic hybrid heuristics for the multi-depot vehicle routing problem. Robotics and Computer-Integrated Manufacturing, 26(6), 564–569.CrossRefGoogle Scholar
  24. Montoya-Torres, J. R., Franco, J. L., Isaza, S. N., Jiménez, H. F., & Herazo-Padilla, N. (2015). A literature review on the vehicle routing problem with multiple depots. Computers and Industrial Engineering, 79, 115–129.CrossRefGoogle Scholar
  25. Rahimi-Vahed, A., Crainic, T. G., Gendreau, M., & Rei, W. (2013). A path relinking algorithm for a multi-depot periodic vehicle routing problem. Journal of Heuristics, 19(3), 497–524.CrossRefGoogle Scholar
  26. Renaud, J., Laporte, G., & Boctor, F. F. (1996). A tabu search heuristic for the multi-depot vehicle routing problem. Computers and Operations Research, 23(3), 229–235.CrossRefGoogle Scholar
  27. Schoonderwoerd, R., Holland, O., Bruten, J., & Rothkrantz, L. (1997). Ant-based load balancing in telecommunications networks. Adaptive Behavior, 5(2), 169–207.CrossRefGoogle Scholar
  28. Tu, W., Fang, Z., Li, Q., Shaw, S. L., & Chen, B. (2014). A bi-level Voronoi diagram-based metaheuristic for a large-scale multi-depot vehicle routing problem. Transportation Research Part E: Logistics and Transportation Review, 61, 84–97.CrossRefGoogle Scholar
  29. Vidal, T., Crainic, T. G., Gendreau, M., Lahrichi, N., & Rei, W. (2012). A hybrid genetic algorithm for multidepot and periodic vehicle routing p Vidal roblems. Operations Research, 60(3), 611–624.CrossRefGoogle Scholar
  30. Vidal, T., Crainic, T. G., Gendreau, M., & Prins, C. (2014). Implicit depot assignments and rotations in vehicle routing heuristics. European Journal of Operational Research, 237(1), 15–28.CrossRefGoogle Scholar
  31. Wu, T. H., Low, C., & Bai, J. W. (2002). Heuristic solutions to multi-depot location-routing problems. Computers and Operations Research, 29(10), 1393–1415.CrossRefGoogle Scholar
  32. Yao, B. Z., Hu, P., Zhang, M. H., & Tian, X. M. (2014). Improved ant colony optimization for seafood product delivery routing problem. PROMET-TRAFFIC and Transportation, 26(1), 1–10.Google Scholar
  33. Yao, B. Z., Hu, P., Zhang, M. H., & Wang, S. (2013). Artificial bee colony algorithm with scanning strategy for periodic vehicle routing problem. SIMULATION: Transactions of the Society for Modeling and Simulation International, 89(6), 762–770.CrossRefGoogle Scholar
  34. Yu, B., & Yang, Z. Z. (2011). An ant colony optimization model: The period vehicle routing problem with time windows. Transportation Research Part E, 47(2), 166–181.CrossRefGoogle Scholar
  35. Yu, B., Yang, Z. Z., & Xie, J. X. (2011). A parallel improved ant colony optimization for multi-depot vehicle routing problem. Journal of the Operational Research Society, 62, 183–188.CrossRefGoogle Scholar
  36. Yu, B., Yang, Z. Z., & Yao, B. Z. (2009). An improved ant colony optimization for vehicle routing problem. European Journal of Operational Research, 196(1), 171–176.CrossRefGoogle Scholar
  37. Yücenur, G. N., & Demirel, N. Ç. (2011). A new geometric shape-based genetic clustering algorithm for the multi-depot vehicle routing problem. Expert Systems with Applications, 38(9), 11859–11865.CrossRefGoogle Scholar

Copyright information

© Springer Science+Business Media New York 2017

Authors and Affiliations

  • Baozhen Yao
    • 1
  • Chao Chen
    • 1
    Email author
  • Xiaolin Song
    • 2
  • Xiaoli Yang
    • 2
  1. 1.School of Automotive EngineeringDalian University of TechnologyDalianPeople’s Republic of China
  2. 2.Transportation Management CollegeDalian Maritime UniversityDalianPeople’s Republic of China

Personalised recommendations