The delivery of vehicles to dealers is one of the major tasks in the vehicle production industry. It has relied on transportation companies that use special tractor-trailer trucks called auto-carriers. One of the main problems these companies have to solve is the optimal loading and routing of the auto-carriers, referred to as the Auto-Carrier Transportation (ACT) problem. In this paper we provide an integer programming formulation of the ACT problem and show that the problem is NP-hard in the strong sense. A three-step heuristic procedure strongly based on the IP formulation, which considers loading, vehicle selection, and routing aspects, is proposed. An application to a real case studyof a vehicle transportation company located in northern Italyis given, with an average deviation lower than 3% from an upper bound on the optimal solution value.
|Titolo:||A heuristic algorithm for the Auto-Carrier transportation problem|
|Data di pubblicazione:||2002|
|Digital Object Identifier (DOI):||http://dx.doi.org/10.1287/trsc.18.104.22.1687|
|Appare nelle tipologie:||1.1 Articolo in rivista|