Routing and refueling plans to minimize travel time in alternative-fuel vehicles

A driver who drives an alternative-fuel vehicle (AFV) from an origin point to a destination point needs to consider how to get there (i.e., the routing problem), when to stop, and how and when to refuel (i.e., the refueling plan). In this study, models and algorithms are proposed that optimize a one-way-trip path such that the total travel time from the origin to the destination is minimized. The travel time consists of the setup time, the refueling time and the driving time. The setup time includes waiting for the AFV to be served at a refueling station and the preparation time of charging the machine. The authors categorized the problems into two types: (1) the refueling plan problem when the routing decision is given and (2) an integrated problem of routing and refueling. Another axis of categorization is when (1) setup time and refueling times are site-independent and (2) parameters are site-dependent. The authors propose optimal algorithms for site-independent problems and the integrated problem of routing and refueling planning with site-independent parameters. The authors also conduct experiments and sensitivity analyses for the site-dependent integrated problems of routing and refueling.


  • English

Media Info

Subject/Index Terms

Filing Info

  • Accession Number: 01677791
  • Record Type: Publication
  • Files: TRIS
  • Created Date: Aug 15 2018 9:34AM