Abstract
This paper investigates a real-world distribution problem arising in the vehicle production industry, particularly in a logistics company, in which cars and vans must be loaded on auto-carriers and then delivered to dealerships. A solution to the problem involves the loading and optimal routing, without violating the capacity and time window constraints for each auto-carrier. A two-phase heuristic algorithm was implemented to solve the problem. In the first phase the heuristic builds a route with an optimal insertion procedure, and in the second phase the determination of a feasible loading. The experimental results show that the purposed algorithm can be used to tackle the transportation problem in terms of minimizing total traveling distance, loading/unloading operations and transportation costs, facilitating a decision-making process for the logistics company.
Subject
Computational Mathematics,Computational Theory and Mathematics,Numerical Analysis,Theoretical Computer Science
Reference31 articles.
1. An exact formulation for the multi-period auto-carrier loading and transportation problem in Brazil
2. AMIA-BOLETIN DE PRENSA/HISTORICO/BOLETIN HISTORICO/2005 2018,2018
3. PROYECTO de Norma Oficial Mexicana PROY-NOM-012-SCT-2-2017,2017
4. Introduction to Logistics Systems Planning and Control;Ghiani,2004
5. Solution of a Large-Scale Traveling-Salesman Problem
Cited by
6 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献