Multi-directional local search for a bi-objective dial-a-ride problem in patient transportation
详细信息 查看全文
- 作者：Yves Molenbrucha ; b ; yves.molenbruch@uhasselt.be" class="auth_mail" title="E-mail the corresponding author ; Kris Braekersa ; b ; An Carisa ; Greet Vanden Berghec
- 关键词：Dial-a-ride problem ; Patient transportation ; Combination restrictions ; Bi-objective optimization ; Multi-directional local search ; Scheduling procedure
- 刊名：Computers and Operations Research
- 出版年：2017
- 出版时间：January 2017
- 年：2017
- 卷：77
- 期：Complete
- 页码：58-71
- 全文大小：698 K
文摘
- •
The DARP is extended with combination restrictions and their cost impact is analyzed.
- •
A successful implementation of an MDLS strategy to a bi-objective DARP is presented.
- •
A new scheduling heuristic minimizes total user ride time in a fast and efficient way.
- •
A candidate list principle improves computation times while performing local search.