A transformation technique for the clustered generalized traveling salesman problem with applications to logistics
From MaRDI portal
Publication:2183848
DOI10.1016/j.ejor.2020.01.053zbMath1441.90131OpenAlexW3003532379MaRDI QIDQ2183848
Mehdi Foumani, Kate A. Smith-Miles, Pouya Baniasadi, Vladimir V. Ežov
Publication date: 27 May 2020
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2020.01.053
Programming involving graphs or networks (90C35) Transportation, logistics and supply chain management (90B06) Combinatorial optimization (90C27)
Related Items
Multi-shuttle crane scheduling in automated storage and retrieval systems, Approximation algorithms for the min-max clustered \(k\)-traveling salesmen problems, Formulations for the clustered traveling salesman problem with \(d\)-relaxed priority rule, Heuristics for a cash-collection routing problem with a cluster-first route-second approach, A variable neighborhood search for the last-mile delivery problem during major infectious disease outbreak, Collaborative vehicle-drone distribution network optimization for perishable products in the epidemic situation
Uses Software
Cites Work
- Unnamed Item
- The hybrid electric vehicle-traveling salesman problem
- A survey on single crane scheduling in automated storage/retrieval systems
- Efficient local search algorithms for known and new neighborhoods for the generalized traveling salesman problem
- Solving the equality generalized traveling salesman problem using the Lin-Kernighan-Helsgaun algorithm
- An exact algorithm for the clustered travelling salesman problem
- Lin-Kernighan heuristic adaptations for the generalized traveling salesman problem
- An adapted heuristic approach for a clustered traveling salesman problem with loading constraints
- Solving the family traveling salesman problem
- Deterministic ``snakes and ladders heuristic for the Hamiltonian cycle problem
- A random-key genetic algorithm for the generalized traveling salesman problem
- A memetic algorithm for the generalized traveling salesman problem
- A memetic algorithm with a large neighborhood crossover operator for the generalized traveling salesman problem
- Using a TSP heuristic for routing order pickers in warehouses
- Transformations of generalized ATSP into ATSP.
- An effective implementation of the Lin-Kernighan traveling salesman heuristic
- GLNS: an effective large neighborhood search heuristic for the generalized traveling salesman problem
- Metaheuristics for the tabu clustered traveling salesman problem
- A multi-depot two-echelon vehicle routing problem with delivery options arising in the last mile distribution
- Parts-to-picker based order processing in a rack-moving mobile robots environment
- A note on approximation algorithms of the clustered traveling salesman problem
- Chained Lin-Kernighan for Large Traveling Salesman Problems
- Integrated Production and Outbound Distribution Scheduling: Review and Extensions
- Two-level genetic algorithm for clustered traveling salesman problem with application in large-scale TSPs
- TSPLIB—A Traveling Salesman Problem Library
- Some Applications of the Generalized Travelling Salesman Problem
- A Branch-and-Cut Algorithm for the Symmetric Generalized Traveling Salesman Problem
- A Polylogarithmic Approximation Algorithm for the Group Steiner Tree Problem
- A construction for directed in-out subgraphs of optimal size
- Some applications of the clustered travelling salesman problem
- Computational Evaluation Of A Transformation Procedure For The Symmetric Generalized Traveling Salesman Problem
