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.
Publisher
Hong Bang International University
Reference11 articles.
1. [1] Jünger, M., Reinelt, G., & Rinaldi, G. “The traveling salesman problem”, Handbooks in operations research and management science, 7, 225-330, 1995.
2.
[2] David L. Applegate, Robert E. Bixby, Vasek Chvátal & William J. Cook, “The Traveling Salesman Problem”, 2007.
3.
[3] Gilbert Laporte, “The Vehicle Routing Problem: An overview of exact and approximate algorithms”, 1991.
4. [4] Haifei Zhang, Hongwei Ge, Jinlong Yang, “Review of Vehicle Routing Problems: Models, Classifcation and Solving Algorithms”, 2021.
5. [5] Baker, B. M., & Ayechew, M., “A genetic algorithm for the vehicle routing problem”, Computers & Operations Research, 30(5), 787-800, 2003.