The multi-vehicle traveling purchaser problem with pairwise incompatibility constraints and unitary demands: A branch-and-price approach
详细信息 查看全文
- 作者：Michel Gendreaua ; michel.gendreau@cirrelt.ca" class="auth_mail" title="E-mail the corresponding author ; Daniele Manerbab ; daniele.manerba@unibs.it" class="auth_mail" title="E-mail the corresponding author ; Renata Mansinib ; renata.mansini@unibs.it" class="auth_mail" title="E-mail the corresponding author
- 关键词：Traveling purchaser problem ; Multi-vehicle ; Pairwise incompatibility constraints ; Column generation ; Branch-and-price
- 刊名：European Journal of Operational Research
- 出版年：2016
- 出版时间：1 January 2016
- 年：2016
- 卷：248
- 期：1
- 页码：59-71
- 全文大小：660 K
文摘
- •
We study the unitary demand case of the multi-vehicle TPP with incompatibilities among products.
- •
We propose a new set-covering formulation and a branch-and-price approach.
- •
We present a hybrid procedure combining two exact methods for solving the pricing problem.
- •
Our method outperforms an existing branch-and-cut both in solution quality and CPU time.
- •
Our method shows good performance even when the number of vehicles and PICs grows.