Lower and upper bounds for the mixed capacitated arc routing problem

DOI10.1016/j.cor.2005.02.009zbMath1094.90035OpenAlexW2078408696MaRDI QIDQ2496039

Enrique Benavent, Philippe Lacomme, Christian Prins, José-Manuel Belenguer

Publication date: 30 June 2006

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2005.02.009

zbMATH Keywords

lower boundheuristiccutting planememetic algorithmmixed graphcapacitated arc routing problemwaste collection

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Graph theory (including graph drawing) in computer science (68R10) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Related Items

New large-scale data instances for CARP and new variations of CARP, Heuristic method for a mixed capacitated arc routing problem: A refuse collection application, A survey of variants and extensions of the location-routing problem, Visual attractiveness in routing problems: a review, An efficiency-based path-scanning heuristic for the capacitated arc routing problem, An extension of the relaxation algorithm for solving a special case of capacitated arc routing problems, Two-phase branch-and-cut for the mixed capacitated general routing problem, The mixed capacitated arc routing problem with non-overlapping routes, Local search heuristics for sectoring routing in a household waste collection context, GRASP with evolutionary path-relinking for the capacitated arc routing problem, Location-arc routing problem: heuristic approaches and test instances, Constructive heuristics for the mixed capacity arc routing problem under time restrictions with intermediate facilities, Modeling and solving the mixed capacitated general routing problem, Vehicle routing problem with uniform private fleet and common carrier: a node subset heuristic, On matchings, T‐joins, and arc routing in road networks, On approximate data reduction for the Rural Postman Problem: Theory and experiments, Solving vehicle routing problems with intermediate stops using VRPSolver models, Fast upper and lower bounds for a large‐scale real‐world arc routing problem, The capacitated general windy routing problem with turn penalties, An Open-Source Desktop Application for Generating Arc-Routing Benchmark Instances, Efficient local search strategies for the mixed capacitated arc routing problems under time restrictions with intermediate facilities, The periodic rural postman problem with irregular services on mixed graphs, Crossover iterated local search for SDCARP, A Decade of Capacitated Arc Routing, A variable neighborhood search for the capacitated arc routing problem with intermediate facilities, Combinatorial optimization and green logistics, Solving an urban waste collection problem using ants heuristics, Splitting procedures for the mixed capacitated arc routing problem under time restrictions with intermediate facilities, An optimization-based heuristic for the multi-objective undirected capacitated arc routing problem, A memetic algorithm for the team orienteering problem, Solving the mobile mapping van problem: a hybrid metaheuristic for capacitated arc routing with soft time windows, Combinatorial optimization and green logistics, A guided local search procedure for the multi-compartment capacitated arc routing problem, The open capacitated arc routing problem, Recent results on Arc Routing Problems: An annotated bibliography, An improved heuristic for the capacitated arc routing problem, A novel model for arc territory design: promoting Eulerian districts, Lower bounds for the mixed capacitated arc routing problem, Heuristic methods for the sectoring arc routing problem, Profitable mixed capacitated arc routing and related problems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Competitive memetic algorithms for arc routing problems
• The fleet size and mix problem for capacitated arc routing
• The mixed general routing polyhedron
• A cutting plane algorithm for the capacitated arc routing problem
• A guided local search heuristic for the capacitated arc routing problem
• Capacitated arc routing problems
• Odd Minimum Cut-Sets and b-Matchings
• The Capacitated Arc Routing Problem: Lower bounds
• A Tabu Search Heuristic for the Capacitated arc Routing Problem
• An optimal algorithm for the mixed Chinese postman problem
• The Directed Rural Postman Problem with Turn Penalties