A highly effective hybrid evolutionary algorithm for the covering salesman problem-Reference-Cited by-同舟云学术

A highly effective hybrid evolutionary algorithm for the covering salesman problem

Published:2021-07 Issue: Volume:564 Page:144-162
ISSN:0020-0255
Container-title:Information Sciences
language:en
Short-container-title:Information Sciences

Author:

Lu Yongliang,Benlic Una,Wu Qinghua

Publisher

Elsevier BV

Subject

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

Reference31 articles.

1. Approximation algorithms for the geometric covering salesman problem;Arkin;Discrete Applied Mathematics,1994

2. Hybrid metaheuristics in combinatorial optimization: A survey;Blum;Applied Soft Computing,2011

3. F-Race and iterated F-Race: An overview;Birattari,2010

4. A hybrid metaheuristic approach for the capacitated arc routing problem;Chen;European Journal of Operational Research,2016

5. The covering salesman problem;Current;Transportation Science,1989

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

1. A survey on the Traveling Salesman Problem and its variants in a warehousing context;European Journal of Operational Research;2024-04

2. A memetic algorithm with fuzzy-based population control for the joint order batching and picker routing problem;Information Sciences;2024-01

3. An effective hybrid evolutionary algorithm for the set orienteering problem;Information Sciences;2024-01

4. Covering tour problem with varying coverage: Application to marine environmental monitoring;Applied Mathematical Modelling;2023-12

5. Memetic search for the minmax multiple traveling salesman problem with single and multiple depots;European Journal of Operational Research;2023-06