Heuristic method for a mixed capacitated arc routing problem: A refuse collection application
type: Item
instance of: scholarly article
title: Heuristic method for a mixed capacitated arc routing problem: A refuse collection application
zbMATH Open document ID: 1067.90020
author: Maria Cândida Mourão
author: Lígia Amado
published in: European Journal of Operational Research
publication date: 2004-11-22T00:00:00Z
Mathematics Subject Classification ID: 90B20
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 2117495
zbMATH Keywords: Routing
zbMATH Keywords: Heuristics
MaRDI profile type: Publication
full work available at URL: j.ejor.2004.01.023
OpenAlex ID: W2070926233
cites work: Q5687196
cites work: Lower and upper bounds for the mixed capacitated arc routing problem
cites work: Networks and vehicle routing for municipal waste collection
cites work: Q5323400
cites work: Heuristics for the mixed rural postman problem
cites work: The Rural Postman Problem on mixed graphs with turn penalties
cites work: Q4510100
cites work: Routeing winter gritting vehicles
cites work: Arc Routing Problems, Part I: The Chinese Postman Problem
cites work: Arc Routing Problems, Part II: The Rural Postman Problem
cites work: The capacitated arc routing problem with intermediate facilities
cites work: Capacitated arc routing problems
cites work: Lower-bounding and heuristic methods for a refuse collection vehicle routing problem
cites work: Augment-insert algorithms for the capacitated arc routing problem
cites work: The fleet size and mix problem for capacitated arc routing
DOI: 10.1016/J.EJOR.2004.01.023
Recommended article: Lower-bounding and heuristic methods for a refuse collection vehicle routing problem
Recommended article: A heuristic method for the capacitated arc routing problem with refill points and multiple loads
Recommended article: Q5323400
Recommended article: Q5271454
Recommended article: An improved heuristic for the capacitated arc routing problem
Recommended article: An optimization-based heuristic for the multi-objective undirected capacitated arc routing problem
Recommended article: Algorithms for Large Directed Capacitated Arc Routing Problem Instances
Recommended article: 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
Recommended article: A hybrid metaheuristic approach for the capacitated arc routing problem
description: scientific article; zbMATH DE number 2117495