Sequential and parallel large neighborhood search algorithms for the periodic location routing problem
DOI10.1016/J.EJOR.2014.11.024zbMATH Open1346.90120OpenAlexW1990698345MaRDI QIDQ319012FDOQ319012
Authors: V. C. Hemmelmayr 
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
Recommendations
- A metaheuristic for the periodic location-routing problem
- A hybrid evolutionary algorithm for the periodic location-routing problem
- An adaptive large neighborhood search for the periodic vehicle routing problem
- A variable neighborhood search heuristic for periodic routing problems
- An adaptive large neighborhood search heuristic for the pollution-routing problem
Approximation methods and heuristics in mathematical programming (90C59) Transportation, logistics and supply chain management (90B06) Discrete location and assignment (90B80)
Cites Work
- A new ILP-based refinement heuristic for vehicle routing problems
- An exact method for the capacitated location-routing problem
- A Branch-and-Cut method for the Capacitated Location-Routing Problem
- Location-routing: issues, models and methods
- A survey of recent research on location-routing problems
- Handbook of metaheuristics
- Record breaking optimization results using the ruin and recreate principle
- An exact algorithm for the period routing problem
- 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 Genetic Algorithm for Multidepot and Periodic Vehicle Routing Problems
- A hybrid evolutionary algorithm for the periodic location-routing problem
- Solving the capacitated location-routing problem by a GRASP complemented by a learning process and a path relinking
- A survey of variants and extensions of the location-routing problem
- A taxonomical analysis, current methods and objectives on location-routing problems
- A parallel algorithm for the vehicle routing problem
- An exact algorithm based on cut-and-column generation for the capacitated location-routing problem
- Parallel Metaheuristics Applications
- Parallel solution methods for vehicle routing problems
- A metaheuristic for the periodic location-routing problem
Cited In (13)
- Locating charging stations and routing drones for efficient automated stocktaking
- Solving the integrated bin allocation and collection routing problem for municipal solid waste: a benders decomposition approach
- An adaptive large neighborhood search algorithm for a selective and periodic inventory routing problem
- A hybrid evolutionary algorithm for the periodic location-routing problem
- A variable neighborhood search based matheuristic for a waste cooking oil collection network design problem
- The latency location-routing problem
- Location‐routing problem: a classification of recent research
- A fuzzy correlation based heuristic for dual-mode integrated location routing problem
- An adaptive large neighborhood search for the periodic vehicle routing problem
- A location-or-routing problem with partial and decaying coverage
- A metaheuristic for the periodic location-routing problem
- Parallel computational optimization in operations research: a new integrative framework, literature review and research directions
- Integrating berth allocation decisions in a fleet composition and periodic routing problem of platform supply vessels
Uses Software
This page was built for publication: Sequential and parallel large neighborhood search algorithms for the periodic location routing problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q319012)
