A parameterized lower bounding method for the open capacitated arc routing problem

DOI10.1016/J.EJCO.2023.100080MaRDI QIDQ6491347zbMATH OpenFDO

Authors Rafael Kendy Arakaki, Fábio Luiz Usberti

Publication date 24 April 2024

Published in EURO Journal on Computational Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.EJCO.2023.100080

zbMATH Keywords

capacitated arc routing problemcapacity inequalitiesdual boundsgeneral routing problemlower boundinglower boundsmulti-vehicle arc routing problemnetwork flow formulationparameterizationrelaxed formulation

Mathematics Subject Classification ID

Mathematical programming (90Cxx)

Recommendations

• The open capacitated arc routing problem
• Improved lower bounds and exact algorithm for the capacitated arc routing problem
• The Capacitated Arc Routing Problem: Lower bounds
• Hybrid genetic algorithm for the open capacitated arc routing problem
• Lower and upper bounds for the mixed capacitated arc routing problem

Cites work

• A cutting plane algorithm for the capacitated arc routing problem
• A deterministic tabu search algorithm for the capacitated arc routing problem
• An efficiency-based path-scanning heuristic for the capacitated arc routing problem
• An improved heuristic for the capacitated arc routing problem
• Arc Routing
• Capacitated arc routing problems
• Exact approaches for the cutting path determination problem
• GRASP with evolutionary path-relinking for the capacitated arc routing problem
• Heuristics for a dynamic rural postman problem
• scientific article; zbMATH DE number 2134188 (Why is no real title available?)
• scientific article; zbMATH DE number 1312984 (Why is no real title available?)
• Hybrid genetic algorithm for the open capacitated arc routing problem
• Improved bounds for large scale capacitated arc routing problem
• Lower and upper bounds for location-arc routing problems with vehicle capacity constraints
• Lower bounds for the mixed capacitated arc routing problem
• Modeling and solving the mixed capacitated general routing problem
• Multi-Terminal Network Flows
• Odd Minimum Cut-Sets and b-Matchings
• Profitable mixed capacitated arc routing and related problems
• The arc partitioning problem
• The capacitated arc routing problem: combinatorial lower bounds
• The capacitated arc routing problem: heuristics
• The mixed capacitated arc routing problem with non-overlapping routes
• The open capacitated arc routing problem

This page was built for publication: A parameterized lower bounding method for the open capacitated arc routing problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6491347)