Solving the Periodic Edge Routing Problem in the Municipal Waste Collection
From MaRDI portal
Publication:5348803
DOI10.1142/S0217595917400152zbMath1375.90073OpenAlexW2663612361MaRDI QIDQ5348803
Publication date: 21 August 2017
Published in: Asia-Pacific Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s0217595917400152
Approximation methods and heuristics in mathematical programming (90C59) Deterministic network models in operations research (90B10) Environmental economics (natural resource models, harvesting, pollution, etc.) (91B76)
Related Items (1)
Cites Work
- Unnamed Item
- A branch-and-cut algorithm for the undirected rural postman problem
- Selective and periodic inventory routing problem for waste vegetable oil collection
- Evolutionary algorithms for periodic arc routing problems
- A heuristic for the periodic rural postman problem
- A new heuristic for the period traveling salesman problem
- A scatter search for the periodic capacitated arc routing problem
- ROUTING ALGORITHMS UNDER MUTUAL INTERFERENCE CONSTRAINTS
- Forty years of periodic vehicle routing
- The period routing problem
- A Heuristic for the Periodic Vehicle Routing Problem
- Networks and vehicle routing for municipal waste collection
- Solving the asymmetric traveling salesman problem with periodic constraints
- Arc Routing Problems, Part II: The Rural Postman Problem
This page was built for publication: Solving the Periodic Edge Routing Problem in the Municipal Waste Collection