The min-max close-enough arc routing problem

Autor:	Ángel Corberán, Miguel Reula, Isaac Plana, José M. Sanchis, Nicola Bianchessi
Rok vydání:	2022
Předmět:	Set (abstract data type) Balance (metaphysics) Mathematical optimization Information Systems and Management Traverse General Computer Science Computer science Modeling and Simulation Management Science and Operations Research Arc routing Industrial and Manufacturing Engineering
Zdroj:	European Journal of Operational Research. 300:837-851
ISSN:	0377-2217
DOI:	10.1016/j.ejor.2021.10.047
Popis:	Here we introduce the Min-Max Close-Enough Arc Routing Problem, where a fleet of vehicles must serve a set of customers while trying to balance the length of the routes. The vehicles do not need to visit the customers, since they can serve them from a distance by traversing arcs that are “close enough” to the customers. We present two formulations of the problem and propose a branch-and-cut and a branch-and-price algorithm based on the respective formulations. A heuristic algorithm used to provide good upper bounds to the exact procedures is also presented. Extensive computational experiments to compare the performance of the algorithms are carried out.
Databáze:	OpenAIRE
Externí odkaz:	https://explore.openaire.eu/search/publication?articleId=doi_________::21eee4f10596ffd09e2ab385b61a5dd2 https://doi.org/10.1016/j.ejor.2021.10.047 Zobrazit plný text záznamu Full Text from ScienceDirect