Complexity, algorithmic, and computational aspects of a dial-a-ride type problem.

Mourad Baïou,Rafael Colares,Hervé Kerivin

Eur. J. Oper. Res.（2023）

引用 0|浏览1

暂无评分

摘要

•Study of a dial-a-ride system involving autonomous electrical vehicles.•Improved computational complexity results for the Stop Number Problem.•Polyhedral study of the underlying combinatorial problem.•Introduction of valid inequalities and facet-defining inequalities.•An exact branch-and-cut framework to solve the Unit Stop Number Problem.

查看译文

关键词

Combinatorial optimization, Autonomous vehicles, Dial -a -ride, Computational complexity, Polyhedral study

AI 理解论文

溯源树

样例

生成溯源树，研究论文发展脉络

Chat Paper

正在生成论文摘要