Optimization of Vehicle Routes for a Third Party Logistics Provider

VRP;vehicle routing;bin packing

Riego, Dustin Bowers ; Dr. Russell E. King, Committee Chair,Dr. Jeff Joines, Committee Member,Dr. Thom J. Hodgson, Committee Member,Riego, Dustin Bowers ; Dr. Russell E. King ; Committee Chair ; Dr. Jeff Joines ; Committee Member ; Dr. Thom J. Hodgson ; Committee Member

University:North Carolina State University

关键词: VRP;    vehicle routing;    bin packing;   

Others  :  https://repository.lib.ncsu.edu/bitstream/handle/1840.16/2752/etd.pdf?sequence=1&isAllowed=y

美国|英语

来源: null

【 摘 要 】

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.