Author:
Pan Guo,Li Kenli,Ouyang Aijia,Li Keqin
Publisher
Springer Science and Business Media LLC
Subject
Geometry and Topology,Theoretical Computer Science,Software
Reference43 articles.
1. Albayrak M, Allahverdi N (2011) Development a new mutation operator to solve the traveling salesman problem by aid of genetic algorithms. Expert Syst Appl 38(3):1313–1320
2. Alkaya AF, Duman E (2013) Application of sequence-dependent traveling salesman problem in printed circuit board assembly. IEEE Trans Compon Packag Manuf Technol 3(6):1063–1076
3. An HC, Kleinberg R, Shmoys DB (2012) Improving christofides’ algorithm for the st path TSP. In: Proceedings of the 44th symposium on theory of computing, pp 875–886
4. Badillo AR, Ruiz JJ, Cotta C, Fernández-Leiva AJ (2013) On user-centric memetic algorithms. Soft Comput 17(2):285–300
5. Beheshti Z, Shamsuddin SM, Yuhaniz SS (2013) Binary Accelerated Particle Swarm Algorithm (BAPSA) for discrete optimization problems. J Global Optim 57(2):549–573
Cited by
46 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献