A hyper-heuristic based artificial bee colony algorithm for \(k\)-interconnected multi-depot multi-traveling salesman problem

DOI10.1016/j.ins.2018.06.027zbMath1440.90063OpenAlexW2808396632WikidataQ129656722 ScholiaQ129656722MaRDI QIDQ2198264

Alok Singh, Venkatesh Pandiri

Publication date: 9 September 2020

Published in: Information Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ins.2018.06.027

zbMATH Keywords

artificial bee colony algorithmhyper-heuristicsmultiple traveling salesman problem\(k\)-interconnected multi-depot multi-traveling salesman problem

Mathematics Subject Classification ID

Evolutionary algorithms, genetic algorithms (computational aspects) (68W50) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Related Items

Two multi-start heuristics for the \(k\)-traveling salesman problem ⋮ Solving the traveling repairman problem with profits: a novel variable neighborhood search approach

Uses Software

• ABC

Cites Work

• A new crossover approach for solving the multiple travelling salesmen problem using genetic algorithms
• A survey on optimization metaheuristics
• A Branch-and-Cut method for the Capacitated Location-Routing Problem
• A survey on metaheuristics for stochastic combinatorial optimization
• A Lagrangian-based algorithm for a multiple depot, multiple traveling salesmen problem
• Genetic algorithms for the traveling salesman problem
• Improved artificial bee colony algorithm for global optimization
• A powerful and efficient algorithm for numerical function optimization: artificial bee colony (ABC) algorithm
• A new approach to solving the multiple traveling salesperson problem using genetic algorithms
• An approximation algorithm for a symmetric generalized multiple depot, multiple travelling salesman problem
• A survey of variants and extensions of the location-routing problem
• Least squares quantization in PCM