Divide-and-conquer large scale capacitated arc routing problems with route cutting off decomposition

DOI10.1016/j.ins.2020.11.011zbMath1484.90132arXiv1912.12667OpenAlexW2998698683MaRDI QIDQ2123554

Yi Mei, Buzhong Zhang, Keqin Jiang, Yuzhou Zhang

Publication date: 14 April 2022

Published in: Information Sciences (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1912.12667

zbMATH Keywords

large-scale optimizationdivide-and-conquercapacitated arc routing problemroute cutting off

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35)

Related Items (1)

A multi-stage evolutionary algorithm for multi-objective optimization with complex constraints

Cites Work

• Unnamed Item
• A note on two problems in connexion with graphs
• Improved bounds for large scale capacitated arc routing problem
• Competitive memetic algorithms for arc routing problems
• Large scale evolutionary optimization using cooperative coevolution
• A deterministic tabu search algorithm for the capacitated arc routing problem
• A variable neighborhood search for the capacitated arc routing problem with intermediate facilities
• The fleet size and mix problem for capacitated arc routing
• A cutting plane algorithm for the capacitated arc routing problem
• A guided local search heuristic for the capacitated arc routing problem
• Heuristic method for a mixed capacitated arc routing problem: A refuse collection application
• Improved lower bounds and exact algorithm for the capacitated arc routing problem
• Solving capacitated arc routing problems using a transformation to the CVRP
• Exact methods based on node-routing formulations for undirected arc-routing problems
• POPMUSIC for a real-world large-scale vehicle routing problem with time windows
• Capacitated arc routing problems
• The Capacitated Arc Routing Problem: Lower bounds
• Arc Routing Problems, Part II: The Rural Postman Problem
• Cut-First Branch-and-Price-Second for the Capacitated Arc-Routing Problem
• Node, Edge, Arc Routing and Turn Penalties: Multiple Problems—One Neighborhood Extension
• New large-scale data instances for CARP and new variations of CARP

This page was built for publication: Divide-and-conquer large scale capacitated arc routing problems with route cutting off decomposition