A Variable Neighborhood Search Algorithm for Cost-Balanced Travelling Salesman Problem
From MaRDI portal
Publication:5011677
DOI10.1007/978-3-030-68520-1_3zbMath1476.90276OpenAlexW3132345617MaRDI QIDQ5011677
Can B. Kalayci, Unnamed Author
Publication date: 27 August 2021
Published in: Advances in Intelligent Systems and Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-030-68520-1_3
metaheuristicstravelling salesman problemvariable neighborhood searchcost-balancednegative edge cost
Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A hybrid genetic algorithm for sequence-dependent disassembly line balancing problem
- The selective travelling salesman problem
- Large traveling salesman problems arising from experiments in X-ray crystallography: A preliminary report on computation
- Travelling purchaser problem
- The traveling salesman problem: An overview of exact and approximate algorithms
- A heuristic for the multiple tour maximum collection problem
- Variable neighborhood search
- Implementing the Dantzig-Fulkerson-Johnson algorithm for large traveling salesman problems
- The bi-objective traveling purchaser problem with deliveries
- An efficient evolutionary algorithm for the orienteering problem
- A general variable neighborhood search variants for the travelling salesman problem with draft limits
- A unified matheuristic for solving multi-constrained traveling salesman problems with profits
- Exact algorithms for the equitable traveling salesman problem
- A perturbation based variable neighborhood search heuristic for solving the vehicle routing problem with simultaneous pickup and delivery with time limit
- A New Metaheuristic Bat-Inspired Algorithm
- Order-Picking in a Rectangular Warehouse: A Solvable Case of the Traveling Salesman Problem
- The Product Matrix Traveling Salesman Problem: An Application and Solution Heuristic
- Some New Branching and Bounding Criteria for the Asymmetric Travelling Salesman Problem
- Some Simple Applications of the Travelling Salesman Problem
- The Covering Tour Problem
- Reducibility among Combinatorial Problems
- Optimal control of plotting and drilling machines: A case study
- Sequential variable neighborhood descent variants: an empirical study on the traveling salesman problem
- Solution of a Large-Scale Traveling-Salesman Problem
- An iterated local search heuristic for the capacitated prize-collecting travelling salesman problem
- Variable neighborhood search: Principles and applications
This page was built for publication: A Variable Neighborhood Search Algorithm for Cost-Balanced Travelling Salesman Problem