Two multi-start heuristics for the \(k\)-traveling salesman problem

DOI10.1007/s12597-020-00463-8OpenAlexW3041283433MaRDI QIDQ2656560

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

zbMATH Keywords

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

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Related Items (1)

A fishing route optimization decision support system: the case of the tuna purse seiner

Uses Software

• Hyperheuristics

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Two level general variable neighborhood search for attractive traveling salesman problem
• Variable neighbourhood search: methods and applications
• Variable neighborhood search
• A general variable neighborhood search variants for the travelling salesman problem with draft limits
• A general variable neighborhood search for the one-commodity pickup-and-delivery travelling salesman problem
• A hyper-heuristic based artificial bee colony algorithm for \(k\)-interconnected multi-depot multi-traveling salesman problem
• Saving an epsilon
• The prize collecting traveling salesman problem
• Approximation Algorithms for Orienteering and Discounted-Reward TSP
• An efficient General Variable Neighborhood Search for large Travelling Salesman Problem with Time Windows

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