A novel model for sustainable waste collection arc routing problem: Pareto-based algorithms
DOI10.1007/s10479-021-04486-2OpenAlexW4205245275MaRDI QIDQ6115587
Erfan Babaee Tirkolaee, Gerhard-Wilhelm Weber, Katarzyna Szwedzka, Selma Gütmen, Alireza Goli
Publication date: 13 July 2023
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10479-021-04486-2
municipal solid wasteperiodic capacitated arc routing problemmulti-objective simulated annealingTaguchi designmulti-objective invasive weed optimization algorithmsustainable waste collection
Decision theory (91B06) Transportation, logistics and supply chain management (90B06) Inventory, storage, reservoirs (90B05) Environmental economics (natural resource models, harvesting, pollution, etc.) (91B76)
Related Items (3)
Cites Work
- A service network design model for multimodal municipal solid waste transport
- Sustainability-based selection decisions for e-waste recycling operations
- 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
- An exact \(\epsilon\)-constraint method for bi-objective combinatorial optimization problems: Application to the traveling salesman problem with profits
- A stochastic maximum principle for a Markov regime-switching jump-diffusion model with delay and an application to finance
- Solving large-scale time capacitated arc routing problems: from real-time heuristics to metaheuristics
- Performance evaluation of acceptance probability functions for multi-objective SA
- Solvable cases of the \(k\)-person Chinese postman problem
- Strong-order conditions of Runge-Kutta method for stochastic optimal control problems
- A multi-objective invasive weed optimization algorithm for robust aggregate production planning under uncertain seasonal demand
- Application of robust optimization for a product portfolio problem using an invasive weed optimization algorithm
- A time-dependent hierarchical Chinese postman problem
- A compact transformation of arc routing problems into node routing problems
- Multi-objective two-stage grey transportation problem using utility function with goals
- Solving an urban waste collection problem using ants heuristics
- A strategic oscillation simheuristic for the time capacitated arc routing problem with stochastic demands
- Arc routing under uncertainty: introduction and literature review
- Capacitated arc routing problems
- Solving the asymmetric traveling salesman problem with periodic constraints
- Taguchi's Quality Engineering Handbook
- An Effective Heuristic Algorithm for the Traveling-Salesman Problem
- Handbook of metaheuristics
This page was built for publication: A novel model for sustainable waste collection arc routing problem: Pareto-based algorithms