Application of simulated annealing in logistics vehicle allocation system: A case study from Vietnamese FMCG company

Lê Đức Đạo Lê Đức Đạo; Đào Quang Chính Đào Quang Chính

doi:10.59294/HIUJS.VOL.5.2023.546

Từ khóa:

định tuyến xe có sức chứa có ràng buộc về thời gian - CVRPTW, giao hàng, thuật toán Mô phỏng luyện kim - SA Algorithm, FMCG, phương pháp số nguyên hỗn hợp

Tóm tắt

Fast-moving consumer goods (FMCG) are products that sell quickly with a reasonable price. The FMCG business segment is characterized by efficient distribution systems to manage a vast array of products with varying shelf lives and consumer demand patterns. For any FMCG and consumer durables company, optimizing the market converge may be a very profitable and productive activity. Sales managers of FMCG products can enhance their overall sales by allocating their field resources such as deliver staff to reach the greatest number of customers. Through the process of analysing related documents and object characteristics in FMCG companies, paper aim to build vehicle routing with time window (CVRTW) model to optimize the delivering process, thus satisfying customer demand. To ensure the quality of the results, the model will be solved using the simulated annealing algorithm (SA-algorithm). The overall results support the decision maker the delivery allocation strategy, ensuring the delivery time and client contentment.

Abstract

Fast-moving consumer goods (FMCG) are products that sell quickly with a reasonable price. The FMCG business segment is characterized by efficient distribution systems to manage a vast array of products with varying shelf lives and consumer demand patterns. For any FMCG and consumer durables company, optimizing the market converge may be a very profitable and productive activity. Sales managers of FMCG products can enhance their overall sales by allocating their field resources such as deliver staff to reach the greatest number of customers. Through the process of analysing related documents and object characteristics in FMCG companies, paper aim to build vehicle routing with time window (CVRTW) model to optimize the delivering process, thus satisfying customer demand. To ensure the quality of the results, the model will be solved using the simulated annealing algorithm (SA-algorithm). The overall results support the decision maker the delivery allocation strategy, ensuring the delivery time and client contentment.

Tài liệu tham khảo

[1] Jünger, M., Reinelt, G., & Rinaldi, G. “The traveling salesman problem”, Handbooks in operations research and management science, 7, 225-330, 1995.

DOI: https://doi.org/10.1016/S0927-0507(05)80121-5

[2] David L. Applegate, Robert E. Bixby, Vasek Chvátal & William J. Cook, “The Traveling Salesman Problem”, 2007.

[3] Gilbert Laporte, “The Vehicle Routing Problem: An overview of exact and approximate algorithms”, 1991.

[4] Haifei Zhang, Hongwei Ge, Jinlong Yang, “Review of Vehicle Routing Problems: Models, Classifcation and Solving Algorithms”, 2021.

DOI: https://doi.org/10.1007/s11831-021-09574-x

[5] Baker, B. M., & Ayechew, M., “A genetic algorithm for the vehicle routing problem”, Computers & Operations Research, 30(5), 787-800, 2003.

DOI: https://doi.org/10.1016/S0305-0548(02)00051-5

[6] Kaku, I., Xiao, Y., & Xia, G., “The deterministic annealing algorithms for vehicle routing problems”, International Journal of Smart Engineering System Design, 5(4), 327-339, 2003.

DOI: https://doi.org/10.1080/10255810390224080

[7] Bührmann, J. H., & Bruwer, F., “K-medoid petal-shaped clustering for the capacitated vehicle routing problem”, South African Journal of Industrial Engineering, 32(3), 33-41, 2021.

DOI: https://doi.org/10.7166/32-3-2610

[8] Aggarwal, D., & Kumar, V., “Mixed integer programming for vehicle routing problem with time windows”, International Journal of Intelligent Systems Technologies and Applications, 18(1-2), 4-19, 2019.

DOI: https://doi.org/10.1504/IJISTA.2019.097744

[9] Granada-Echeverri, M., Toro, E., & Santa, J., “A mixed integer linear programming formulation for the vehicle routing problem with backhauls”, International Journal of Industrial Engineering Computations, 10(2), 295-308, 2019.

DOI: https://doi.org/10.5267/j.ijiec.2018.6.003

[10] Drexl, M., and Schneider, M., A survey of the standard location-routing problem. Working Paper LPIS-03/2014, Logistics Planning and Information Systems, TU Darmstadt, 2014

[11] Vidal, T., Crainic, T.G., Gendreau, M., and Prins, C., “Implicit depot assignments and rotations in vehicle routing heuristics”, European Journal of Operational Research, 237, 2014.

DOI: https://doi.org/10.1016/j.ejor.2013.12.044