Heuristic method for a mixed capacitated arc routing problem: A refuse collection application

DOI10.1016/J.EJOR.2004.01.023zbMATH Open1067.90020OpenAlexW2070926233MaRDI QIDQ1887872FDOQ1887872

Lígia Amado, Maria Cândida Mourão

Publication date: 22 November 2004

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2004.01.023

zbMATH Keywords

HeuristicsRouting

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Traffic problems in operations research (90B20)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Capacitated arc routing problems
• Networks and vehicle routing for municipal waste collection
• Arc Routing Problems, Part II: The Rural Postman Problem
• Arc Routing Problems, Part I: The Chinese Postman Problem
• Lower and upper bounds for the mixed capacitated arc routing problem
• The capacitated arc routing problem with intermediate facilities
• The Rural Postman Problem on mixed graphs with turn penalties
• The fleet size and mix problem for capacitated arc routing
• Routeing winter gritting vehicles
• Lower-bounding and heuristic methods for a refuse collection vehicle routing problem
• Augment-insert algorithms for the capacitated arc routing problem
• Heuristics for the mixed rural postman problem

Cited In (14)

• A multi-level capacitated arc routing problem with intermediate facilities in waste collection
• New large-scale data instances for CARP and new variations of CARP
• Divide-and-conquer large scale capacitated arc routing problems with route cutting off decomposition
• Approximation algorithms for solving the constrained arc routing problem in mixed graphs
• The mixed capacitated arc routing problem with non-overlapping routes
• A districting-based heuristic for the coordinated capacitated arc routing problem
• Lower bounds for the mixed capacitated arc routing problem
• Heuristic methods for the sectoring arc routing problem
• Constructive heuristics for the mixed capacity arc routing problem under time restrictions with intermediate facilities
• A Decade of Capacitated Arc Routing
• Fast upper and lower bounds for a large‐scale real‐world arc routing problem
• Municipal street-sweeping area generation with route optimization
• Metaheuristics with disposal facility positioning for the waste collection VRP with time windows
• Recent results on Arc Routing Problems: An annotated bibliography

Recommendations

• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• An optimization-based heuristic for the multi-objective undirected capacitated arc routing problem 👍 👎
• A hybrid metaheuristic approach for the capacitated arc routing problem 👍 👎
• An improved heuristic for the capacitated arc routing problem 👍 👎
• Lower-bounding and heuristic methods for a refuse collection vehicle routing problem 👍 👎
• A heuristic method for the capacitated arc routing problem with refill points and multiple loads 👍 👎
• Algorithms for Large Directed Capacitated Arc Routing Problem Instances 👍 👎
• Using mixed integer programming for solving the capacitated arc routing problem with vehicle/site dependencies with an application to the routing of residential sanitation collection vehicles 👍 👎

This page was built for publication: Heuristic method for a mixed capacitated arc routing problem: A refuse collection application

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