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

DOI10.1007/s11750-019-00505-5zbMath1418.90038OpenAlexW2922110489WikidataQ128256819 ScholiaQ128256819MaRDI QIDQ2001870

Jose Carlos Molina, Ignacio Eguia, Jesus Racero

Publication date: 11 July 2019

Published in: Top (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11750-019-00505-5

zbMATH Keywords

pollutant emissionsvariable neighborhood tabu searchCOPERT model equationswaste collection vehicle routing problem

Mathematics Subject Classification ID

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

Related Items

An efficient variable neighborhood search with tabu shaking for a class of multi-depot vehicle routing problems ⋮ A column generation approach for an emission-oriented vehicle routing problem on a multigraph

Cites Work

• Unnamed Item
• A review of recent research on green road freight transportation
• A matheuristic approach for the pollution-routing problem
• A speed and departure time optimization algorithm for the pollution-routing problem
• A hybrid evolutionary algorithm for heterogeneous fleet vehicle routing problems with time windows
• Metaheuristics with disposal facility positioning for the waste collection VRP with time windows
• Recyclable waste collection planning -- a case study
• A tabu search algorithm for the heterogeneous fixed fleet vehicle routing problem
• A record-to-record travel algorithm for solving the heterogeneous fleet vehicle routing problem
• A reactive variable neighborhood tabu search for the heterogeneous fleet vehicle routing problem with time windows
• Variable neighbourhood search: methods and applications
• Industrial aspects and literature survey: fleet composition and routing
• Variable neighborhood search
• Variable neighborhood tabu search and its application to the median cycle problem.
• The periodic vehicle routing problem with intermediate facilities
• Development of a fuel consumption optimization model for the capacitated vehicle routing problem
• A two-phase algorithm for the partial accessibility constrained vehicle routing problem
• A hybrid algorithm for the heterogeneous fleet vehicle routing problem
• An adaptive large neighborhood search heuristic for the pollution-routing problem
• The bi-objective pollution-routing problem
• Solving an urban waste collection problem using ants heuristics
• Waste collection vehicle routing problem with time windows
• A Generalized Insertion Heuristic for the Traveling Salesman Problem with Time Windows
• Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
• The fleet size and mix vehicle routing problem with time windows
• Energy Minimizing Vehicle Routing Problem
• Capacitated arc routing problems
• The Vehicle Routing Problem with Time Windows: Minimizing Route Duration
• A Tabu Search Heuristic for the Vehicle Routing Problem with Soft Time Windows
• A heuristic column generation method for the heterogeneous fleet VRP
• A greedy look-ahead heuristic for the vehicle routing problem with time windows
• Vehicle routing and scheduling with time-varying data: A case study
• A Method for Solving Traveling-Salesman Problems
• Combinatorial optimization and green logistics

This page was built for publication: Reducing pollutant emissions in a waste collection vehicle routing problem using a variable neighborhood tabu search algorithm: a case study