Lower-bounding and heuristic methods for a refuse collection vehicle routing problem

DOI10.1016/S0377-2217(99)00045-4zbMath0953.90008MaRDI QIDQ1969871

Maria Cândida Mourão, Maria Teresa Almeida

Publication date: 19 July 2000

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

zbMATH Keywords

heuristicslower boundsrouting

Mathematics Subject Classification ID

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

Related Items (14)

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 ⋮ GRASP with evolutionary path-relinking for the capacitated arc routing problem ⋮ Constructive heuristics for the mixed capacity arc routing problem under time restrictions with intermediate facilities ⋮ Metaheuristics with disposal facility positioning for the waste collection VRP with time windows ⋮ Fast upper and lower bounds for a large‐scale real‐world arc routing problem ⋮ A Decade of Capacitated Arc Routing ⋮ Combinatorial optimization and green logistics ⋮ A hybrid multi-objective evolutionary algorithm for solving truck and trailer vehicle routing problems ⋮ Combinatorial optimization and green logistics ⋮ Waste collection vehicle routing problem with time windows ⋮ Recent results on Arc Routing Problems: An annotated bibliography ⋮ A stochastic inventory routing problem for infectious medical waste collection ⋮ Lower bounds for the mixed capacitated arc routing problem

Cites Work

• Unnamed Item
• Capacitated arc routing problems
• Networks and vehicle routing for municipal waste collection
• Arc Routing Problems, Part I: The Chinese Postman Problem
• Arc Routing Problems, Part II: The Rural Postman Problem

This page was built for publication: Lower-bounding and heuristic methods for a refuse collection vehicle routing problem