A variable neighborhood search algorithm for cost-balanced travelling salesman problem

DOI10.1007/978-3-030-68520-1_3MaRDI QIDQ5011677zbMATH OpenOpenAlexFDO

Authors Can B. Kalayci

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

zbMATH Keywords

cost-balancedmetaheuristicsnegative edge costtravelling salesman problemvariable neighborhood search

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• A memetic random key algorithm for the balanced travelling salesman problem
• The balanced traveling salesman problem
• A Steiner zone variable neighborhood search heuristic for the close-enough traveling salesman problem
• Variable neighbourhood search algorithms for asymmetric travelling salesman problems
• A general variable neighborhood search for the one-commodity pickup-and-delivery travelling salesman problem

Cites work

• A general variable neighborhood search variants for the travelling salesman problem with draft limits
• A heuristic for the multiple tour maximum collection problem
• A hybrid genetic algorithm for sequence-dependent disassembly line balancing problem
• A New Metaheuristic Bat-Inspired Algorithm
• A perturbation based variable neighborhood search heuristic for solving the vehicle routing problem with simultaneous pickup and delivery with time limit
• A unified matheuristic for solving multi-constrained traveling salesman problems with profits
• An efficient evolutionary algorithm for the orienteering problem
• An iterated local search heuristic for the capacitated prize-collecting travelling salesman problem
• Exact algorithms for the equitable traveling salesman problem
• scientific article; zbMATH DE number 3497315 (Why is no real title available?)
• scientific article; zbMATH DE number 2050711 (Why is no real title available?)
• scientific article; zbMATH DE number 2064416 (Why is no real title available?)
• scientific article; zbMATH DE number 795217 (Why is no real title available?)
• Implementing the Dantzig-Fulkerson-Johnson algorithm for large traveling salesman problems
• Large traveling salesman problems arising from experiments in X-ray crystallography: A preliminary report on computation
• Optimal control of plotting and drilling machines: A case study
• Order-Picking in a Rectangular Warehouse: A Solvable Case of the Traveling Salesman Problem
• Reducibility among combinatorial problems
• Sequential variable neighborhood descent variants: an empirical study on the traveling salesman problem
• Solution of a Large-Scale Traveling-Salesman Problem
• Some New Branching and Bounding Criteria for the Asymmetric Travelling Salesman Problem
• Some Simple Applications of the Travelling Salesman Problem
• The bi-objective traveling purchaser problem with deliveries
• The Covering Tour Problem
• The Product Matrix Traveling Salesman Problem: An Application and Solution Heuristic
• The selective travelling salesman problem
• The traveling salesman problem: An overview of exact and approximate algorithms
• Travelling purchaser problem
• Variable neighborhood search
• Variable neighborhood search: Principles and applications

Cited in

(1)

• A memetic random key algorithm for the balanced travelling salesman problem

This page was built for publication: A variable neighborhood search algorithm for cost-balanced travelling salesman problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5011677)