10 0

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

Title
Routing and refueling plans to minimize travel time in alternative-fuel vehicles
Author
정인재
Keywords
Alternative-fuel vehicle; refueling plan; routing problem; travel time
Issue Date
2018-09
Publisher
TAYLOR & FRANCIS INC
Citation
INTERNATIONAL JOURNAL OF SUSTAINABLE TRANSPORTATION, v. 12, no. 8, page. 583-591
Abstract
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. We 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. We propose optimal algorithms for site-independent problems and the integrated problem of routing and refueling planning with site-independent parameters. We also conduct experiments and sensitivity analyses for the site-dependent integrated problems of routing and refueling.
URI
https://www.tandfonline.com/doi/full/10.1080/15568318.2017.1416505http://repository.hanyang.ac.kr/handle/20.500.11754/120106
ISSN
1556-8318; 1556-8334
DOI
10.1080/15568318.2017.1416505
Appears in Collections:
COLLEGE OF ENGINEERING[S](공과대학) > INDUSTRIAL ENGINEERING(산업공학과) > Articles
Files in This Item:
There are no files associated with this item.
Export
RIS (EndNote)
XLS (Excel)
XML


qrcode

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.

BROWSE