Heuristic approaches for the family traveling salesman problem
From MaRDI portal
Publication:6070420
DOI10.1111/ITOR.12771OpenAlexW3003414204MaRDI QIDQ6070420
Publication date: 21 November 2023
Published in: International Transactions in Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1111/itor.12771
Related Items (6)
The family traveling salesman problem with incompatibility constraints ⋮ A metaheuristic for the double traveling salesman problem with partial last‐in‐first‐out loading constraints ⋮ Exponential neighborhood search for consecutive block minimization ⋮ The multi‐depot family traveling salesman problem and clustered variants: Mathematical formulations and branch‐&‐cut based methods ⋮ The capacitated family traveling salesperson problem ⋮ The family capacitated vehicle routing problem
Cites Work
- A survey on optimization metaheuristics
- Solving the equality generalized traveling salesman problem using the Lin-Kernighan-Helsgaun algorithm
- Solving the family traveling salesman problem
- A branch and bound algorithm for the traveling purchaser problem
- GLNS: an effective large neighborhood search heuristic for the generalized traveling salesman problem
- Heuristics for the traveling purchaser problem
- The Generalized Covering Salesman Problem
- A new approach to the maximum-flow problem
- TSPLIB—A Traveling Salesman Problem Library
- Randomized heuristics for the family traveling salesperson problem
- A metaheuristic approach to fisheries survey route planning
- Metaheuristics based on decision hierarchies for the traveling purchaser problem
- Solution of a Large-Scale Traveling-Salesman Problem
- The Traveling Salesman Problem: A Survey
- An ILS heuristic for the ship scheduling problem: application in the oil industry
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Heuristic approaches for the family traveling salesman problem
