Two multi-start heuristics for the k-traveling salesman problem

DOI10.1007/S12597-020-00463-8OpenAlexW3041283433MaRDI QIDQ2656560FDOQ2656560

Authors: Venkatesh Pandiri, Alok Singh 

Publication date: 11 March 2021

Published in: Opsearch (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s12597-020-00463-8

Recommendations

• A hyper-heuristic based artificial bee colony algorithm for \(k\)-interconnected multi-depot multi-traveling salesman problem
• Solving the \(k\)-best traveling salesman problem
• A tour extending hyper-heuristic algorithm for the traveling salesman problem
• An analysis of the extended Christofides heuristic for the \(k\)-depot TSP
• An effective iterated two-stage heuristic algorithm for the multiple traveling salesmen problem

zbMATH Keywords

heuristictraveling salesman problemhyper-heuristicgeneral variable neighborhood search\(k\)-traveling salesman problem

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Cites Work

• The prize collecting traveling salesman problem
• Variable neighborhood search
• Variable neighbourhood search: methods and applications
• Title not available (Why is that?)
• Saving an epsilon: a 2-approximation for the \(k\)-MST problem in graphs
• Title not available (Why is that?)
• A general variable neighborhood search for the one-commodity pickup-and-delivery travelling salesman problem
• An efficient general variable neighborhood search for large travelling salesman problem with time windows
• Two level general variable neighborhood search for attractive traveling salesman problem
• Approximation Algorithms for Orienteering and Discounted-Reward TSP
• Title not available (Why is that?)
• A general variable neighborhood search variants for the travelling salesman problem with draft limits
• A hyper-heuristic based artificial bee colony algorithm for \(k\)-interconnected multi-depot multi-traveling salesman problem

Cited In (2)

• A fishing route optimization decision support system: the case of the tuna purse seiner
• Seeking global edges for traveling salesman problem in multi-start search

Uses Software

• Hyperheuristics

This page was built for publication: Two multi-start heuristics for the \(k\)-traveling salesman problem

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