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.

• Record URL:
  https://doi.org/10.1061/41139(387)369
• Availability:
  • Find a library where document is available. Order URL: http://worldcat.org/isbn/9780784411391
• Supplemental Notes:
  • © 2010 American Society of Civil Engineers.
• Corporate Authors:

  American Society of Civil Engineers

  1801 Alexander Bell Drive
  Reston, VA  United States  20191-4400
• Authors:
  • Peng, Yong
  • Peng, Jing
  • Li, Hongbo
• Conference:
  • International Conference of Logistics Engineering and Management (ICLEM) 2010
  • Location: Chengdu , China
  • Date: 2010-10-8 to 2010-10-10
• Publication Date: 2010-9

Language

• 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

• TRT Terms: Distance; Fuel conservation; Fuel consumption; Logistics; Routing; Vehicles
• Subject Areas: Energy; Freight Transportation; Planning and Forecasting; Vehicles and Equipment; I72: Traffic and Transport Planning;

Filing Info

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