Routing design for less-than-truckload motor carriers using Ant Colony Optimization

One of the most important challenges that confronts less-than-truckload carriers serving many-to-many distribution networks consists of determining how to consolidate flows of small shipments. The objective is to determine a route for each origin–destination pair that minimizes the cost while still guaranteeing a certain level of service. This research studies different aspects of the problem and provides a metaheuristic algorithm (based on Ant Colony Optimization techniques) capable of solving real-life problems in a reasonable computational time. The viability of the approach has been tested with a real case in Spain and encouraging results have been obtained.