An iterated local search for solving a location-routing problem
From MaRDI portal
Recommendations
- An efficient implementation of local search algorithms for constrained routing problems
- A Location Based Heuristic for General Routing Problems
- An iterated local search algorithm for a place scheduling problem
- Nested Heuristic Methods for the Location-Routeing Problem
- A fast multi-neighborhood iterated local search algorithm for vehicle routing problems
- Embedded local search approaches for routing optimization
- scientific article; zbMATH DE number 2050711
- An iterated local search algorithm for the vehicle routing problem with backhauls
- A new local search for continuous location problems
Cites work
Cited in
(10)- Local search with annealing-like restarts to solve the VRPTW
- A survey of the standard location-routing problem
- Iterated local search and column generation to solve arc-routing as a permutation set-covering problem
- A column generation approach for location-routing problems with pickup and delivery
- A bi-level model and memetic algorithm for arc interdiction location-routing problem
- Genetic algorithms in supply chain management: a critical analysis of the literature
- A survey of recent research on location-routing problems
- Variable neighborhood search for location routing
- Improving resource location with locally precomputed partial random walks
- Efficient metaheuristics for the home (health)-care routing and scheduling problem with time windows and synchronized visits
This page was built for publication: An iterated local search for solving a location-routing problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2861505)