A novel imperialist competitive algorithm for generalized traveling salesman problems-Reference-Cited by-同舟云学术

A novel imperialist competitive algorithm for generalized traveling salesman problems

Published:2015-01 Issue: Volume:26 Page:546-555
ISSN:1568-4946
Container-title:Applied Soft Computing
language:en
Short-container-title:Applied Soft Computing

Author:

Ardalan Zaniar,Karimi Sajad,Poursabzi Omid,Naderi B.

Publisher

Elsevier BV

Subject

Software

Reference46 articles.

1. Some applications of the generalized travelling salesman problem;Laporte;J. Oper. Res. Soc.,1996

2. The record balancing problem – a dynamic programming solution of a generalized traveling salesman problem;Henry-Labordere;Revue Francaise D Informatique De Recherche Operationnelle,1969

3. The generalized traveling salesman problem;Noon,1988

4. Process planning for rotational parts using the generalized traveling salesman problem;Ben-Arieh;Int. J. Prod. Res.,2003

5. Mathematical model of scheduling clients through welfare agencies;Saskena;J. Can. Oper. Res. Soc.,1970

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

1. Heuristic and Metaheuristic Algorithms for the Traveling Salesman Problem;Encyclopedia of Optimization;2024

2. A comprehensive survey on the generalized traveling salesman problem;European Journal of Operational Research;2023-07

3. RVFLN-CDFPA: a random vector functional link neural network optimized using a chaotic differential flower pollination algorithm for day ahead Net Asset Value prediction;Evolving Systems;2023-04-20

4. Inspection path planning of free-form surfaces based on improved cuckoo search algorithm;Measurement and Control;2023-02-27

5. A Genetic Algorithm-Based Approach to Solve a New Time-Limited Travelling Salesman Problem;International Journal of Distributed Systems and Technologies;2023-02-03