A branch-and-cut algorithm for a realistic dial-a-ride problem
详细信息 查看全文
- 作者：Mengyang Liub ; mengyliu2-c@my.cityu.edu.hk" class="auth_mail" title="E-mail the corresponding author ; Zhixing Luoa ; luozx@nju.edu.cn" class="auth_mail" title="E-mail the corresponding author ; Andrew Limc ; a ; b ; 1 ; lim.andrew@cityu.edu.hk" class="auth_mail" title="E-mail the corresponding author
- 关键词：Dial-a-ride problem ; Manpower planning ; Branch-and-cut ; Healthcare transportation
- 刊名：Transportation Research Part B: Methodological
- 出版年：2015
- 出版时间：November 2015
- 年：2015
- 卷：81
- 期：part_P1
- 页码：267-288
- 全文大小：564 K
文摘
- •
Introduced a more realistic variant of the dial-a-ride problem.
- •
Formulated the problem into two models.
- •
Proposed eight families of valid inequalities to strengthen the models.
- •
Devised a branch-and-cut algorithm to solve the problem.
- •
The branch-and-cut algorithm optimally solved instances with up to 22 requests.