Integration of routing into a resource-constrained project scheduling problem

The resource-constrained project scheduling problem (RCPSP), one of the most challenging combinatorial optimization scheduling problems, has been the focus of a great deal of research, resulting in numerous publications in the last decade. Previous publications focused on the RCPSP, including severa...

Descripción completa

Guardado en:

Detalles Bibliográficos
Autores principales:	Philippe Lacomme, Aziz Moukrim, Alain Quilliot, Marina Vinot
Formato:	article
Lenguaje:	EN
Publicado:	Elsevier 2019
Materias:	90B35 Applied mathematics. Quantitative methods T57-57.97 Electronic computers. Computer science QA75.5-76.95
Acceso en línea:	https://doaj.org/article/4f7c2502d6934a16993f5d84187e3beb
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

id	oai:doaj.org-article:4f7c2502d6934a16993f5d84187e3beb
record_format	dspace
spelling	oai:doaj.org-article:4f7c2502d6934a16993f5d84187e3beb2021-12-02T05:01:14ZIntegration of routing into a resource-constrained project scheduling problem2192-440610.1007/s13675-018-0104-zhttps://doaj.org/article/4f7c2502d6934a16993f5d84187e3beb2019-12-01T00:00:00Zhttp://www.sciencedirect.com/science/article/pii/S2192440621001234https://doaj.org/toc/2192-4406The resource-constrained project scheduling problem (RCPSP), one of the most challenging combinatorial optimization scheduling problems, has been the focus of a great deal of research, resulting in numerous publications in the last decade. Previous publications focused on the RCPSP, including several extensions with different objectives to be minimized and constraints to be checked. The present work investigates the integration of the routing, i.e., the transport of the resources between activities into the RCPSP, and provides a new resolution scheme. The two subproblems are solved using an integrated approach that draws on both a disjunctive graph model and an explicit modeling of the routing. The resolution scheme takes advantage of an indirect representation of the solution to define both the schedule of activities and the routing of vehicles. The routing solution is modeled by a set of trips that define the loaded transport operations of vehicles that are induced by the flow in the graph. The numerical experiments prove that the models and the methods introduced in this paper are promising for solving the RCPSP with routing.Philippe LacommeAziz MoukrimAlain QuilliotMarina VinotElsevierarticle90B35Applied mathematics. Quantitative methodsT57-57.97Electronic computers. Computer scienceQA75.5-76.95ENEURO Journal on Computational Optimization, Vol 7, Iss 4, Pp 421-464 (2019)
institution	DOAJ
collection	DOAJ
language	EN
topic	90B35 Applied mathematics. Quantitative methods T57-57.97 Electronic computers. Computer science QA75.5-76.95
spellingShingle	90B35 Applied mathematics. Quantitative methods T57-57.97 Electronic computers. Computer science QA75.5-76.95 Philippe Lacomme Aziz Moukrim Alain Quilliot Marina Vinot Integration of routing into a resource-constrained project scheduling problem
description	The resource-constrained project scheduling problem (RCPSP), one of the most challenging combinatorial optimization scheduling problems, has been the focus of a great deal of research, resulting in numerous publications in the last decade. Previous publications focused on the RCPSP, including several extensions with different objectives to be minimized and constraints to be checked. The present work investigates the integration of the routing, i.e., the transport of the resources between activities into the RCPSP, and provides a new resolution scheme. The two subproblems are solved using an integrated approach that draws on both a disjunctive graph model and an explicit modeling of the routing. The resolution scheme takes advantage of an indirect representation of the solution to define both the schedule of activities and the routing of vehicles. The routing solution is modeled by a set of trips that define the loaded transport operations of vehicles that are induced by the flow in the graph. The numerical experiments prove that the models and the methods introduced in this paper are promising for solving the RCPSP with routing.
format	article
author	Philippe Lacomme Aziz Moukrim Alain Quilliot Marina Vinot
author_facet	Philippe Lacomme Aziz Moukrim Alain Quilliot Marina Vinot
author_sort	Philippe Lacomme
title	Integration of routing into a resource-constrained project scheduling problem
title_short	Integration of routing into a resource-constrained project scheduling problem
title_full	Integration of routing into a resource-constrained project scheduling problem
title_fullStr	Integration of routing into a resource-constrained project scheduling problem
title_full_unstemmed	Integration of routing into a resource-constrained project scheduling problem
title_sort	integration of routing into a resource-constrained project scheduling problem
publisher	Elsevier
publishDate	2019
url	https://doaj.org/article/4f7c2502d6934a16993f5d84187e3beb
work_keys_str_mv	AT philippelacomme integrationofroutingintoaresourceconstrainedprojectschedulingproblem AT azizmoukrim integrationofroutingintoaresourceconstrainedprojectschedulingproblem AT alainquilliot integrationofroutingintoaresourceconstrainedprojectschedulingproblem AT marinavinot integrationofroutingintoaresourceconstrainedprojectschedulingproblem
_version_	1718400827400388608

Integration of routing into a resource-constrained project scheduling problem

Ejemplares similares