Separating valid odd-cycle and odd-set inequalities for the multiple depot vehicle scheduling problem

We consider the multicommodity network flow formulation of the multiple depot vehicle scheduling problem (MDVSP) and investigate several strategies within a branch-and-cut framework for solving the MDVSP. In particular, we compare subalgorithms for separating the cutting planes introduced by Hadjar...

Descripción completa

Guardado en:

Detalles Bibliográficos
Autores principales:	Mounira Groiez, Guy Desaulniers, Ahmed Hadjar, Odile Marcotte
Formato:	article
Lenguaje:	EN
Publicado:	Elsevier 2013
Materias:	Transportation scheduling Multicommodity flow Branch-and-cut algorithm Applied mathematics. Quantitative methods T57-57.97 Electronic computers. Computer science QA75.5-76.95
Acceso en línea:	https://doaj.org/article/681475cce94b4a6ab9301d182c93da08
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

id	oai:doaj.org-article:681475cce94b4a6ab9301d182c93da08
record_format	dspace
spelling	oai:doaj.org-article:681475cce94b4a6ab9301d182c93da082021-12-02T05:00:37ZSeparating valid odd-cycle and odd-set inequalities for the multiple depot vehicle scheduling problem2192-440610.1007/s13675-013-0012-1https://doaj.org/article/681475cce94b4a6ab9301d182c93da082013-11-01T00:00:00Zhttp://www.sciencedirect.com/science/article/pii/S2192440621000228https://doaj.org/toc/2192-4406We consider the multicommodity network flow formulation of the multiple depot vehicle scheduling problem (MDVSP) and investigate several strategies within a branch-and-cut framework for solving the MDVSP. In particular, we compare subalgorithms for separating the cutting planes introduced by Hadjar et al. (Oper Res 54:130–149, 2006). We also evaluate the effectiveness of a new criterion for fixing some variables in the multicommodity flow formulation. Finally, we present computational experiments to illustrate the strengths and weaknesses of the strategies.Mounira GroiezGuy DesaulniersAhmed HadjarOdile MarcotteElsevierarticleTransportation schedulingMulticommodity flowBranch-and-cut algorithmApplied mathematics. Quantitative methodsT57-57.97Electronic computers. Computer scienceQA75.5-76.95ENEURO Journal on Computational Optimization, Vol 1, Iss 3, Pp 283-312 (2013)
institution	DOAJ
collection	DOAJ
language	EN
topic	Transportation scheduling Multicommodity flow Branch-and-cut algorithm Applied mathematics. Quantitative methods T57-57.97 Electronic computers. Computer science QA75.5-76.95
spellingShingle	Transportation scheduling Multicommodity flow Branch-and-cut algorithm Applied mathematics. Quantitative methods T57-57.97 Electronic computers. Computer science QA75.5-76.95 Mounira Groiez Guy Desaulniers Ahmed Hadjar Odile Marcotte Separating valid odd-cycle and odd-set inequalities for the multiple depot vehicle scheduling problem
description	We consider the multicommodity network flow formulation of the multiple depot vehicle scheduling problem (MDVSP) and investigate several strategies within a branch-and-cut framework for solving the MDVSP. In particular, we compare subalgorithms for separating the cutting planes introduced by Hadjar et al. (Oper Res 54:130–149, 2006). We also evaluate the effectiveness of a new criterion for fixing some variables in the multicommodity flow formulation. Finally, we present computational experiments to illustrate the strengths and weaknesses of the strategies.
format	article
author	Mounira Groiez Guy Desaulniers Ahmed Hadjar Odile Marcotte
author_facet	Mounira Groiez Guy Desaulniers Ahmed Hadjar Odile Marcotte
author_sort	Mounira Groiez
title	Separating valid odd-cycle and odd-set inequalities for the multiple depot vehicle scheduling problem
title_short	Separating valid odd-cycle and odd-set inequalities for the multiple depot vehicle scheduling problem
title_full	Separating valid odd-cycle and odd-set inequalities for the multiple depot vehicle scheduling problem
title_fullStr	Separating valid odd-cycle and odd-set inequalities for the multiple depot vehicle scheduling problem
title_full_unstemmed	Separating valid odd-cycle and odd-set inequalities for the multiple depot vehicle scheduling problem
title_sort	separating valid odd-cycle and odd-set inequalities for the multiple depot vehicle scheduling problem
publisher	Elsevier
publishDate	2013
url	https://doaj.org/article/681475cce94b4a6ab9301d182c93da08
work_keys_str_mv	AT mouniragroiez separatingvalidoddcycleandoddsetinequalitiesforthemultipledepotvehicleschedulingproblem AT guydesaulniers separatingvalidoddcycleandoddsetinequalitiesforthemultipledepotvehicleschedulingproblem AT ahmedhadjar separatingvalidoddcycleandoddsetinequalitiesforthemultipledepotvehicleschedulingproblem AT odilemarcotte separatingvalidoddcycleandoddsetinequalitiesforthemultipledepotvehicleschedulingproblem
_version_	1718400832496467968

Separating valid odd-cycle and odd-set inequalities for the multiple depot vehicle scheduling problem

Ejemplares similares