We study a real-world distribution problem arising in the automotive field, in which cars and other vehicles have to be loaded on auto-carriers and then delivered to dealers. The solution of the problem involves both the computation of the routing of the autocarriers along the road network and the determination of a feasible loading for each auto-carrier. We solve the problem by means of a heuristic algorithm that makes use of simple greedy and local search strategies for the routing part, and more complex mathematical modeling and branch-and-bound techniques for the loading part. Preliminary computational results show that good savings on the total routing distance can be obtained within small computational efforts.
A Matheuristic Algorithm for Auto-Carrier Transportation / Dell'Amico, Mauro; Falavigna, Simone; Iori, Manuel. - STAMPA. - (2011), pp. 81-84. (Intervento presentato al convegno VII ALIO–EURO – Workshop on Applied Combinatorial Optimization tenutosi a Porto (Portogallo) nel 4-6 Maggio 2011).