Hybrid heuristic for multi-carrier transportation plans

Landa-Silva, Dario and Wang, Yijun and Donovan, Paul and Kendall, Graham (2011) Hybrid heuristic for multi-carrier transportation plans. In: 9th Metaheuristics International Conference (MIC 2011), July 2011, Udine, Italy.

PDF - Requires a PDF viewer such as GSview, Xpdf or Adobe Acrobat Reader
Download (169kB) | Preview


This paper describes a hybrid heuristic approach to construct transportation plans for a singlecustomer multi-carrier scenario that arises at 3T Logistics Ltd, a UK company that provides outsourced transportation planning and management services. The problem consists on planning the delivery, using a set of carrier companies, of a set of shipments from a warehouse to different consignees across the UK. The problem tackled resembles a vehicle routing problem with time windows but there are several differences in our scenario. The hybrid heuristic algorithm described here combines a clustering algorithm, constructive and local search heuristics, and exact assignment based on integer programming. This approach is being currently evaluated at the company and results so far indicate the suitability of the algorithm to produce practical transportation plans at reduced cost compared to current practice.

Item Type: Conference or Workshop Item (Paper)
Keywords: Transport planning, heuristics metaheuristics, hybrid metaheuristics, vehicle routing
Schools/Departments: University of Nottingham, UK > Faculty of Science > School of Computer Science
Depositing User: Landa-Silva, Dario
Date Deposited: 04 Apr 2016 10:04
Last Modified: 02 Jul 2018 09:04
URI: http://eprints.nottingham.ac.uk/id/eprint/32604

Actions (Archive Staff Only)

Edit View Edit View