The multi-vehicle traveling purchaser problem with pairwise incompatibility constraints and unitary demands: A branch-and-price approach

•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 b...

Celý popis

Podrobná bibliografia

Vydané v:	European journal of operational research Ročník 248; číslo 1; s. 59 - 71
Hlavní autori:	Gendreau, Michel, Manerba, Daniele, Mansini, Renata
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Amsterdam Elsevier B.V 01.01.2016 Elsevier Sequoia S.A
Predmet:	Branch & bound algorithms Branch-and-price Column generation Multi-vehicle Pairwise incompatibility constraints Route choice Shortest path algorithms Studies Transportation problem (Operations research) Traveling purchaser problem Pairwise incompatibility constraints Column generation Traveling purchaser problem Branch-and-price Multi-vehicle
ISSN:	0377-2217, 1872-6860
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!