Abstract

This paper presents a real-world auto-carrier loading and routing problem encountered by an automotive logistics company in China. The problem requires determining a set of routes for auto-carriers to transport vehicles from warehouses to dealers subject to several loading and routing constraints. Four objectives are considered, including the maximization of the number of loaded urgent vehicles and the number of loaded vehicles, and the minimization of the number of visits to dealers and travel distance. To solve such a multi-objective problem, we develop a two-stage iterated local search heuristic with the lexicographic optimization principle. Expressly, we assume that all vehicles are stored in one warehouse and solve the resulting problem as the first stage. Then the best-found solution is improved by considering the multiple warehouse constraints in the second stage. The effectiveness of the proposed heuristic is validated by comparing it with a commercial solver and the company’s approach. Moreover, computational results provide managerial insights for decision-makers when considering the objectives and their priorities in different scenarios.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call