A Metaheuristic for the Periodic Location-Routing Problem
From MaRDI portal
Publication:5391896
DOI10.1007/978-3-540-77903-2_25zbMath1209.90050MaRDI QIDQ5391896
Publication date: 7 April 2011
Published in: Operations Research Proceedings (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-77903-2_25
90B06: Transportation, logistics and supply chain management
90C59: Approximation methods and heuristics in mathematical programming
90B80: Discrete location and assignment
Related Items
Multiperiod location-routing with decoupled time scales, A hybrid evolutionary algorithm for the periodic location-routing problem
Cites Work
- Unnamed Item
- Solving the capacitated location-routing problem by a GRASP complemented by a learning process and a path relinking
- Using clustering analysis in a capacitated location-routing problem
- The effect of ignoring routes when locating depots
- Heuristic solutions to multi-depot location-routing problems
- The period routing problem
- An improved heuristic for the period vehicle routing problem