.png){kind=icon}
返回
Cellular Genetic Algorithm for Solving a Routing On-Demand Transit Problem
.png){kind=icon}
PRE
AI
DOI：10.1145/2908812.2908921.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
To provide sustainable and efficient urban logistics and transportation services, urban mobility tools are facing challenges on reducing carbon emission, waiting time for passengers and transit time. The emergence of many new intelligent and electric transportation system offers many new possible solutions to achieve urban sustainability. This paper proposes to treat the Personal Rapid Transit System (PRT) as an efficient sustainable transportation tool for urban areas. This paper proposes to deal with static problem of routing PRT'vehicles to minimize total energy consumption while considering the battery capacity of vehicles. For that purpose, we describe a multiple crossover Cellular Genetic Algorithm combined with a local search. Numerical experiments on 1320 instances show that our hybrid algorithm is efficient in which the average percent deviations relative to the lower bound over 1320 instances is about 1.632%, and the average running time is about 26.3 seconds.
Keyword:
Personal Rapid Transit
Evolutionary Computation
Vehicle Routing Problem
Cellular Genetic Algorithm
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
机构
引用论文
.png){kind=icon}
Magnetic Coupling Mechanism With Omnidirectional Magnetic Shielding for Wireless Power Transfer
PREAI
分享收藏分享收藏分享收藏
查看更多内容