A Metaheuristic for the Periodic Location-Routing Problem

DOI10.1007/978-3-540-77903-2_25zbMath1209.90050OpenAlexW1536244764MaRDI QIDQ5391896

Caroline Prodhon

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

zbMATH Keywords

heuristicperiodic location-routing problem

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59) Discrete location and assignment (90B80)

Related Items (6)

A survey of variants and extensions of the location-routing problem ⋮ Sequential and parallel large neighborhood search algorithms for the periodic location routing problem ⋮ A waste collection problem with service type option ⋮ Location‐routing problem: a classification of recent research ⋮ Multiperiod location-routing with decoupled time scales ⋮ A hybrid evolutionary algorithm for the periodic location-routing problem

Cites Work

• 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
• A tabu search heuristic for periodic and multi-depot vehicle routing problems
• An improved heuristic for the period vehicle routing problem

This page was built for publication: A Metaheuristic for the Periodic Location-Routing Problem