Metaheuristics with disposal facility positioning for the waste collection VRP with time windows

DOI10.1007/S11590-012-0549-6zbMath1280.90007OpenAlexW2171881249MaRDI QIDQ375982

A. M. Benjamin, John E. Beasley

Publication date: 1 November 2013

Published in: Optimization Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11590-012-0549-6

zbMATH Keywords

metaheuristicsvehicle routingwaste collection

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59)

Related Items (1)

Reducing pollutant emissions in a waste collection vehicle routing problem using a variable neighborhood tabu search algorithm: a case study

Cites Work

• A note on two problems in connexion with graphs
• Recyclable waste collection planning -- a case study
• Vehicle routing concepts in the closed-loop container network of ARN -- a case study
• Heuristic methods for the sectoring arc routing problem
• Vehicle routing-scheduling for waste collection in Hanoi
• The periodic vehicle routing problem with intermediate facilities
• Heuristic method for a mixed capacitated arc routing problem: A refuse collection application
• Lower-bounding and heuristic methods for a refuse collection vehicle routing problem
• A web-based decision support system for waste lube oils collection and recycling
• The multiple disposal facilities and multiple inventory locations rollon-rolloff vehicle routing problem
• Waste collection vehicle routing problem with time windows
• The Rollon–Rolloff Vehicle Routing Problem
• On a periodic vehicle routing problem
• Optimal sequencing of skip collections and deliveries
• The application of a vehicle routing model to a waste-collection problem: two case studies
• Vehicle routing in the 1-skip collection problem

This page was built for publication: Metaheuristics with disposal facility positioning for the waste collection VRP with time windows