This paper discussed one multi trip vehicle routing problem based on fuel consumption reduction. A GA-BFD heuristic algorithm was developed to find the solution. The numerical example showed that the optimal vehicle routing schedule would change when a vehicle would be used for multi trips with a driving distance limit. The new vehicle routing schedule would increase fuel consumption. However, if we take account of the vehicle's lease cost, the total cost might decrease.
Multi-Trip Vehicle Routing Problem Based on Fuel Consumption Reduction
International Conference of Logistics Engineering and Management (ICLEM) 2010 ; 2010 ; Chengdu, China
ICLEM 2010 ; 2640-2646
2010-09-09
Conference paper
Electronic Resource
English
The Multi-Trip Vehicle Routing Problem with Time Windows and Release Dates
Online Contents | 2016
|The Multi-Trip Vehicle Routing Problem with Time Windows and Release Dates
Online Contents | 2016
|