Abstract
AbstractThis paper proposes a solution scheme for the problem of scheduling deliveries from distribution centers. The solution scheme is developed in two phases. The first phase corresponds to the collection and processing of data, and the second phase includes the design of a customer assignment model based on the data of the first phase. The first phase provides the characteristics of the customers, the number of orders to be dispatched, and the number of visited customers. In the second phase, optimization techniques are used, considering scheduling and assignment problem-solving methodologies. The optimization model provides the correct assignment of customer orders to vehicles, reducing the number of trips and the fleet's size and occupation percentage. The proposed solution scheme is developed with a company operating a distribution center responsible for dispatching vehicles to all retail customers, wholesalers, and distributors in the Province of Concepción, Province of Arauco, and Province of Itata in Chile. The obtained results are prominent and show that the proposed methodology can be extended to companies performing storage, transportation, and distribution tasks with similar characteristics.
Publisher
Springer Science and Business Media LLC
Subject
Management of Technology and Innovation,Computational Theory and Mathematics,Management Science and Operations Research,Statistics, Probability and Uncertainty,Strategy and Management,Modeling and Simulation,Numerical Analysis
Reference46 articles.
1. Bernal J, Escobar JW, Linfati R (2017) A granular tabu search algorithm for a real case study of a vehicle routing problem with a heterogeneous fleet and time windows. J Ind Eng Manag 10(4):646–662
2. Bernal J, Escobar JW, Paz JC, Linfati R, Gatica G (2018) A probabilistic granular tabu search for the distance constrained capacitated vehicle routing problem. Int J Ind Syst Eng 29(4):453–477
3. Bernal J, Escobar JW, Linfati R (2021) A simulated annealing-based approach for a real case study of vehicle routing problem with a heterogeneous fleet and time windows. Int J Shipp Transp Logist 13(1–2):185–204
4. Branke J, Pickardt CW (2011) Evolutionary search for difficult problem instances to support the design of job shop dispatching rules. Eur J Oper Res 212(1):22–32
5. Bunte S, Kliewer N (2009) An overview on vehicle scheduling models. Public Transport 1(4):299–317
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献