Publication Date:
2019
Description:
〈p〉Publication date: September 2019〈/p〉
〈p〉〈b〉Source:〈/b〉 Transportation Research Part E: Logistics and Transportation Review, Volume 129〈/p〉
〈p〉Author(s): Raphael Kramer, Jean-François Cordeau, Manuel Iori〈/p〉
〈div xml:lang="en"〉
〈h5〉Abstract〈/h5〉
〈div〉〈p〉We present and solve a rich vehicle routing problem based on a practical distribution problem faced by a third-party logistics provider, whose aim is to deliver pharmaceutical products to healthcare facilities in Tuscany. The problem is characterized by having multiple depots, a heterogeneous fleet of vehicles, flexible time windows, periodic demands, incompatibilities between vehicles and customers, a maximum duration for the routes, and a maximum number of customers per route. A multi-start iterated local search algorithm making use of several neighborhoods is proposed to solve the problem. The algorithm has been tested on a large number of instances and obtained good results, both on the real case study and on a number of artificially generated instances.〈/p〉〈/div〉
〈/div〉
Print ISSN:
1366-5545
Electronic ISSN:
1878-5794
Topics:
Architecture, Civil Engineering, Surveying
,
Geography
,
Economics