Divide-and-conquer initialization and mutation operators for the large-scale mixed Capacitated Arc Routing Problem
Authors:
- Diogo F. OliveiraDODiogo F. Oliveira
- Miguel S.E. MartinsMiguel S.E. Martins
- João M.C. SousaJSJoão M.C. Sousa
- Susana M. VieiraSusana M. Vieira
- José Rui FigueiraJFJosé Rui Figueira
Open Access
- 27 September 2024
- journal article
- research article
- Published by Elsevier in European Journal of Operational Research
- Vol. 321 (2) , 383-396
Abstract
No abstract availableKeywords
Funding Information
- Foundation for Science and Technology
This publication has 33 references indexed in Scilit:
- Arc routing problems: A review of the past, present, and futureNetworks, 2020
- An updated annotated bibliography on arc routing problemsNetworks, 2017
- Multi-treatment capacitated arc routing of construction machinery in Taiwan's smooth road projectAutomation in Construction, 2012
- The case for strategic oscillationAnnals of Operations Research, 2009
- A variable neighborhood search for the capacitated arc routing problem with intermediate facilitiesJournal of Heuristics, 2007
- Lower and upper bounds for the mixed capacitated arc routing problemComputers & Operations Research, 2006
- Exact methods based on node‐routing formulations for undirected arc‐routing problemsNetworks, 2005
- Routeing winter gritting vehiclesDiscrete Applied Mathematics, 1994
- The fleet size and mix problem for capacitated arc routingEuropean Journal of Operational Research, 1985
- Capacitated arc routing problemsNetworks, 1981