Fresh seafood delivery routing problem using an improved ant colony optimization
- 260 Downloads
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.
KeywordsFresh seafood Delivery routing problem Multi-depot Ant colony optimization Energy cost
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.
- 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
- 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
- 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
- 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
- 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
- Gambardella, L., Taillard, E., & Dorigo, M. (1997). Ant colonies for the QAP. Technical Report 97-4. Lugano: IDSIA.Google Scholar
- 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
- 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