Mathematical modelling and heuristic approaches to the location-routing problem of a cost-effective integrated solid waste management
DOI10.1007/s10479-018-2912-1zbMath1434.90012OpenAlexW2807072073WikidataQ129733238 ScholiaQ129733238MaRDI QIDQ1730644
Publication date: 6 March 2019
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10479-018-2912-1
simulated annealingmixed-integer linear programminglocation-routing problemvariable neighbourhood searchmunicipal solid wasteintegrated solid waste management
Mixed integer programming (90C11) Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59) Discrete location and assignment (90B80) Mathematical modeling or simulation for problems pertaining to operations research and mathematical programming (90-10)
Related Items (5)
Uses Software
Cites Work
- Variable neighborhood search for location routing
- A new model for the hazardous waste location-routing problem
- Locating landfills--optimization vs. reality
- Variable neighbourhood search: methods and applications
- Variable neighborhood search
- A multi-objective mathematical model for the industrial hazardous waste location-routing problem
- Multi-objective metaheuristics for a location-routing problem with multiple use of vehicles on real data and simulated data
- A multicriteria facility location model for municipal solid waste management in North Greece
- A SA-VNS approach for the High School Timetabling Problem
- Heuristic Methods for Location-Allocation Problems
- KI 2005: Advances in Artificial Intelligence
- Combinatorial optimization and green logistics
This page was built for publication: Mathematical modelling and heuristic approaches to the location-routing problem of a cost-effective integrated solid waste management