Optimization of Vehicle Routes for a Third Party Logistics Provider
No Thumbnail Available
Files
Date
2005-04-06
Authors
Journal Title
Series/Report No.
Journal ISSN
Volume Title
Publisher
Abstract
This work addresses the problem of minimizing the number of vehicles required to service a weekly delivery schedule for a transportation company. The characteristics of this specific problem require each delivery to originate from the network's primary depot. Therefore, the overall mileage travelled by the entire fleet is the same for all feasible solutions. The routes generated are constrained by a maximum allowable weekly mileage and the fleet is homogenous and located at the primary depot.
Improvements to an algorithm developed in previous research are introduced in this work. These improvements are highlighted by the implementation of four separate selection criteria which are used to determine the best job to add to a route during route construction. Additionally, costs are optimized by evaluating backhaul carrying capabilities of the solution routes generated. 1000 test problems are generated for each of six job size scenarios. The new algorithm developed by this work shows improvement over previous algorithms in both computation time and overall performance.
Description
Keywords
VRP, vehicle routing, bin packing
Citation
Degree
MS
Discipline
Industrial Engineering
