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

DOI10.1016/J.INS.2018.06.027MaRDI QIDQ2198264zbMATH OpenOpenAlexWikidataFDO

Authors Venkatesh Pandiri, Alok Singh

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

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

Recommendations

• A multi-depot travelling salesman problem and its iterative and integrated approaches
• A hybrid ant colony optimization for dynamic multidepot vehicle routing problem
• A hybrid metaheuristic algorithm for the multi-depot covering tour vehicle routing problem
• An artificial bee colony algorithm for the 0-1 multidimensional Knapsack problem

Cites work

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

Cited in

(2)

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

Describes a project that uses

Uses Software

• ABC

This page was built for publication: A hyper-heuristic based artificial bee colony algorithm for \(k\)-interconnected multi-depot multi-traveling salesman problem

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