Optimizing the service area and trip selection of an electric automated taxi system used for the last mile of train trips

Xiao Liang, Gonçalo Homem de Almeida Correia and Bart van Arem

Transportation Research Part E: Logistics and Transportation Review, 2016, vol. 93, issue C, 115-129

Abstract: We propose two integer programming models for optimizing an automated taxi (AT) system for last mile of train trips. Model S1: trip reservations are accepted or rejected by the operator according to the profit maximization; model S2: any reservation on a selected zone by the model must be satisfied. Models were applied to a case-study. Results indicate that fleet size influences the profitability of the taxi system: a fleet of 40 ATs is optimal in S1 and 60 ATs in S2. Having electric ATs constrains the system for small fleets because ATs will not have time for charging.

Keywords: Electric automated vehicles; Taxis; Last mile; Integer programming (search for similar items in EconPapers)
Date: 2016
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (32)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S1366554516300552
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:transe:v:93:y:2016:i:c:p:115-129

Ordering information: This journal article can be ordered from
http://www.elsevier.com/wps/find/journaldescription.cws_home/600244/bibliographic
http://www.elsevier. ... 600244/bibliographic

DOI: 10.1016/j.tre.2016.05.006

Access Statistics for this article

Transportation Research Part E: Logistics and Transportation Review is currently edited by W. Talley

More articles in Transportation Research Part E: Logistics and Transportation Review from Elsevier
Bibliographic data for series maintained by Catherine Liu ().