A hybrid evolutionary algorithm for the periodic location-routing problem
From MaRDI portal
Publication:531435
DOI10.1016/j.ejor.2010.09.021zbMath1210.90026OpenAlexW2002322048MaRDI QIDQ531435
Publication date: 29 April 2011
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2010.09.021
Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Related Items (15)
A survey of recent research on location-routing problems ⋮ Solving the dynamic capacitated location-routing problem with fuzzy demands by hybrid heuristic algorithm ⋮ A survey of variants and extensions of the location-routing problem ⋮ A variable neighborhood search based matheuristic for a waste cooking oil collection network design problem ⋮ Sequential and parallel large neighborhood search algorithms for the periodic location routing problem ⋮ The latency location-routing problem ⋮ Location arc routing problem with inventory constraints ⋮ A new bi-objective location-routing problem for distribution of perishable products: evolutionary computation approach ⋮ Multiperiod location-routing with decoupled time scales ⋮ Integrating berth allocation decisions in a fleet composition and periodic routing problem of platform supply vessels ⋮ Introduction of an underground waste container system-model and solution approaches ⋮ Many-to-many location-routing with inter-hub transport and multi-commodity pickup-and-delivery ⋮ Forty years of periodic vehicle routing ⋮ A taxonomical analysis, current methods and objectives on location-routing problems ⋮ Using greedy clustering method to solve capacitated location-routing problem with fuzzy demands
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A Branch-and-Cut method for the Capacitated Location-Routing Problem
- Solving the capacitated location-routing problem by a GRASP complemented by a learning process and a path relinking
- A GRASP\(\times \)ELS approach for the capacitated location-routing problem
- The effect of ignoring routes when locating depots
- Models and exact solutions for a class of stochastic location-routing problems
- Combined location-routing problems: A synthesis and future research directions
- Heuristic solutions to multi-depot location-routing problems
- A two-phase tabu search approach to the location routing problem
- Evolutionary algorithms for periodic arc routing problems
- A simple and effective evolutionary algorithm for the vehicle routing problem
- A compact model and tight bounds for a combined location-routing problem
- A variable neighborhood search heuristic for periodic routing problems
- \(\text{MA}\mid\text{PM}\): memetic algorithms with population management
- A scatter search for the periodic capacitated arc routing problem
- The period routing problem
- Solving a Family of Multi-Depot Vehicle Routing and Location-Routing Problems
- A tabu search heuristic for periodic and multi-depot vehicle routing problems
- An improved heuristic for the period vehicle routing problem
- A Metaheuristic for the Periodic Location-Routing Problem
- An Effective Heuristic Algorithm for the Traveling-Salesman Problem
- A multiple-depot, multiple-vehicle, location-routing problem with stochastically processed demands
This page was built for publication: A hybrid evolutionary algorithm for the periodic location-routing problem
