Sequential and parallel large neighborhood search algorithms for the periodic location routing problem
From MaRDI portal
Publication:319012
DOI10.1016/j.ejor.2014.11.024zbMath1346.90120OpenAlexW1990698345MaRDI QIDQ319012
Publication date: 6 October 2016
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: http://epub.wu.ac.at/5572/1/Hemmelmayr_2015_EJOR_Sequential%2Dand%2Dparallel.pdf
Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59) Discrete location and assignment (90B80)
Related Items (8)
A variable neighborhood search based matheuristic for a waste cooking oil collection network design problem ⋮ The latency location-routing problem ⋮ A fuzzy correlation based heuristic for dual-mode integrated location routing problem ⋮ Parallel computational optimization in operations research: a new integrative framework, literature review and research directions ⋮ Location‐routing problem: a classification of recent research ⋮ Solving the integrated bin allocation and collection routing problem for municipal solid waste: a benders decomposition approach ⋮ Integrating berth allocation decisions in a fleet composition and periodic routing problem of platform supply vessels ⋮ A location-or-routing problem with partial and decaying coverage
Uses Software
Cites Work
- A survey of recent research on location-routing problems
- A two-phase hybrid heuristic algorithm for the capacitated location-routing problem
- An adaptive large neighborhood search heuristic for two-echelon vehicle routing problems arising in city logistics
- Multiperiod location-routing with decoupled time scales
- A hybrid evolutionary algorithm for the periodic location-routing problem
- A Branch-and-Cut method for the Capacitated Location-Routing Problem
- Location-routing: issues, models and methods
- Solving the capacitated location-routing problem by a GRASP complemented by a learning process and a path relinking
- Record breaking optimization results using the ruin and recreate principle
- A new ILP-based refinement heuristic for vehicle routing problems
- A survey of variants and extensions of the location-routing problem
- A taxonomical analysis, current methods and objectives on location-routing problems
- An Exact Method for the Capacitated Location-Routing Problem
- A Parallel Algorithm for the Vehicle Routing Problem
- An Exact Algorithm Based on Cut-and-Column Generation for the Capacitated Location-Routing Problem
- An Exact Algorithm for the Period Routing Problem
- Parallel Metaheuristics Applications
- Parallel Solution Methods for Vehicle Routing Problems
- A Hybrid Genetic Algorithm for Multidepot and Periodic Vehicle Routing Problems
- A Metaheuristic for the Periodic Location-Routing Problem
- Handbook of metaheuristics
This page was built for publication: Sequential and parallel large neighborhood search algorithms for the periodic location routing problem
