Multi-Trip Vehicle Routing Problem Based on Fuel Consumption Reduction

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 the authors take account of the vehicle's lease cost, the total cost might decrease.


  • English

Media Info

  • Media Type: Web
  • Features: References;
  • Pagination: pp 2640-2646
  • Monograph Title: ICLEM 2010: Logistics For Sustained Economic Development: Infrastructure, Information, Integration

Subject/Index Terms

Filing Info

  • Accession Number: 01525533
  • Record Type: Publication
  • ISBN: 9780784411391
  • Files: TRIS, ASCE
  • Created Date: May 28 2014 3:21PM