Formulations and branch-and-cut algorithms for the generalized vehicle routing problem

Name: Formulations and branch-and-cut algorithms for the generalized vehicle routing problem
Author: Bektaş, T., Erdoğan, Güneş, Ropke, S.

İsim	Formulations and branch-and-cut algorithms for the generalized vehicle routing problem
Yazar	Bektaş, T., Erdoğan, Güneş, Ropke, S.
Basım Tarihi:	2011-08
Basım Yeri	- Informs
Konu	Generalized vehicle routing, Integer programming, Branch-and-cut
Tür	Süreli Yayın
Dil	İngilizce
Dijital	Evet
Yazma	Hayır
Kütüphane:	Özyeğin Üniversitesi
Demirbaş Numarası	0041-1655
Kayıt Numarası	15e5576c-7868-4ba0-9b3d-cd845564286a
Lokasyon	Industrial Engineering
Tarih	2011-08
Notlar	University of Southampton
Örnek Metin	The generalized vehicle routing problem (GVRP) consists of finding a set of routes for a number of capacitated vehicles on a graph where the vertices are partitioned into clusters with given demands, such that the total cost of travel is minimized and all demands are met. This paper describes and compares four new integer linear programming formulations for the GVRP, two based on multicommodity flow and the other two based on exponential-size sets of inequalities. Branch-and-cut algorithms are proposed for the latter two. Computational results on a large set of instances are presented.
DOI	10.1287/trsc.1100.0352
Cilt	45

Kaynağa git Özyeğin Üniversitesi

Aramaya Dön

Özyeğin Üniversitesi

Kaynağa git

Formulations and branch-and-cut algorithms for the generalized vehicle routing problem

Yazar Bektaş, T., Erdoğan, Güneş, Ropke, S.

Basım Tarihi 2011-08

Basım Yeri - Informs

Konu Generalized vehicle routing, Integer programming, Branch-and-cut

Tür Süreli Yayın

Dil İngilizce

Dijital Evet

Yazma Hayır

Kütüphane Özyeğin Üniversitesi

Demirbaş Numarası 0041-1655

Kayıt Numarası 15e5576c-7868-4ba0-9b3d-cd845564286a

Lokasyon Industrial Engineering

Tarih 2011-08

Notlar University of Southampton

Örnek Metin The generalized vehicle routing problem (GVRP) consists of finding a set of routes for a number of capacitated vehicles on a graph where the vertices are partitioned into clusters with given demands, such that the total cost of travel is minimized and all demands are met. This paper describes and compares four new integer linear programming formulations for the GVRP, two based on multicommodity flow and the other two based on exponential-size sets of inequalities. Branch-and-cut algorithms are proposed for the latter two. Computational results on a large set of instances are presented.

DOI 10.1287/trsc.1100.0352

Cilt 45