返回
Dynamic Shared-Taxi Dispatch Algorithm with Hybrid-Simulated Annealing
DOI:10.1111/mice.12157.png)
摘要
En 中文
Taxi is certainly the most popular type of on-demand transportation service in urban areas because taxi-dispatching systems offer more and better services in terms of shorter wait times and passenger travel convenience. However, a shortage of taxicabs has always been critical in many urban contexts especially during peak hours, and taxi has great potential to maximize its efficiency by employing the shared-ride concept. There are recent successes in dynamic ride-sharing projects that are expected to bring substantial benefits arising from energy consumption and operation efficiency and thus, it is essential to develop advanced shared-taxi-dispatch algorithms and investigate the collective benefits of dynamic ride-sharing by maximizing occupancy and minimizing travel times in real-time. This article investigates how taxi services can be improved by proposing shared-taxi algorithms and what type of objective functions and constraints could be employed to prevent excessive passenger detours. Hybrid-simulated annealing (HSA) is applied to dynamically assign passenger requests efficiently. A series of simulations are conducted with two different taxi operation strategies. The simulation results reveal that allowing ride-sharing for taxicabs increases productivity over the various demand levels and HSA can be considered as a suitable solution to maximize the system efficiency of dynamic ride-sharing.
Keyword:
VEHICLE-ROUTING PROBLEM
GENETIC ALGORITHMS
TRANSIT SYSTEM
OPTIMIZATION
DESIGN
HEURISTICS
AI总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
C
IF:
9.1
论文数:
2.0K
被引数:
10.0K
机构
引用论文
Simulated annealing metaheuristics for the vehicle routing problem with time windows带时间窗车辆路径问题的模拟退火元启发式算法
A methodology to derive the critical demand density for designing and operating feeder transit services一种推导设计和运营支线运输服务的关键需求密度的方法

