Effective metaheuristics for the latency location routing problem
From MaRDI portal
Publication:6080614
DOI10.1111/itor.13294OpenAlexW4360946233MaRDI QIDQ6080614
Paolo Toth, Daniele Vigo, Carlos Rey, Unnamed Author
Publication date: 4 October 2023
Published in: International Transactions in Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1111/itor.13294
Related Items
Cites Work
- Unnamed Item
- Optimization by Simulated Annealing
- A survey of recent research on location-routing problems
- The latency location-routing problem
- A survey on two-echelon routing problems
- A two-phase hybrid heuristic algorithm for the capacitated location-routing problem
- Location-routing: issues, models and methods
- An effective memetic algorithm for the cumulative capacitated vehicle routing problem
- The effect of ignoring routes when locating depots
- An effective implementation of the Lin-Kernighan traveling salesman heuristic
- A two-phase tabu search approach to the location routing problem
- A survey of the standard location-routing problem
- The green location-routing problem
- The multi-depot \(k\)-traveling repairman problem
- New formulations and solution approaches for the latency location routing problem
- Multi-neighborhood simulated annealing for the sports timetabling competition ITC2021
- A survey of variants and extensions of the location-routing problem
- Two-stage multi-neighborhood simulated annealing for uncapacitated examination timetabling
- A hybrid ant colony optimization-variable neighborhood descent approach for the cumulative capacitated vehicle routing problem
- A taxonomical analysis, current methods and objectives on location-routing problems
- An Effective Heuristic Algorithm for the Traveling-Salesman Problem
