A hyper-heuristic based artificial bee colony algorithm for k-Interconnected multi-depot multi-traveling salesman problem-Reference-Cited by-同舟云学术

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

Published:2018-10 Issue: Volume:463-464 Page:261-281
ISSN:0020-0255
Container-title:Information Sciences
language:en
Short-container-title:Information Sciences

Author:

Pandiri Venkatesh,Singh Alok

Publisher

Elsevier BV

Subject

Artificial Intelligence,Information Systems and Management,Computer Science Applications,Theoretical Computer Science,Control and Systems Engineering,Software

Reference50 articles.

1. A modified artificial bee colony algorithm for real-parameter optimization;Akay;Inf. Sci.,2012

2. Evolutionary algorithm for the k-interconnected multi-depot multi-traveling salesmen problem;Andrade,2013

3. A hybrid artificial bee colony algorithm for the cooperative maximum covering location problem;Banda;Int. J. Mach. Learn. Cybern.,2017

4. An artificial bee colony (ABC) algorithm for numeric function optimization;Basturk,2006

5. A branch-and-cut method for the capacitated location-routing problem;Belenguer;Comput. Op. Res.,2011

Cited by 45 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. An ALNS metaheuristic for the family multiple traveling salesman problem;Computers & Operations Research;2024-09

2. Solution of the family traveling salesman problem using a hyper-heuristic approach;Engineering Applications of Artificial Intelligence;2024-07

3. A review of reinforcement learning based hyper-heuristics;PeerJ Computer Science;2024-06-28

4. Choice Function-Based Hyper-Heuristics for Causal Discovery under Linear Structural Equation Models;Biomimetics;2024-06-10

5. A Hierarchical Framework for Solving the Constrained Multiple Depot Traveling Salesman Problem;IEEE Robotics and Automation Letters;2024-06