Hybrid immune algorithm based on greedy algorithm and delete-cross operator for solving TSP
- 25 November 2014
- journal article
- Published by Springer Science and Business Media LLC in Soft Computing
- Vol. 20 (2), 555-566
- https://doi.org/10.1007/s00500-014-1522-3
Abstract
No abstract availableKeywords
This publication has 39 references indexed in Scilit:
- Pareto-based multi-colony multi-objective ant colony optimization algorithms: an island model proposalSoft Computing, 2013
- On user-centric memetic algorithmsSoft Computing, 2012
- Memetic Algorithm based on Improved Inver–over operator and Lin–Kernighan local search for the Euclidean traveling salesman problemComputers & Mathematics with Applications, 2011
- Honey bees mating optimization algorithm for the Euclidean traveling salesman problemInformation Sciences, 2011
- Development a new mutation operator to solve the Traveling Salesman Problem by aid of Genetic AlgorithmsExpert Systems with Applications, 2011
- Lin–Kernighan heuristic adaptations for the generalized traveling salesman problemEuropean Journal of Operational Research, 2011
- Artificial immune system in dynamic environments solving time-varying non-linear constrained multi-objective problemsSoft Computing, 2010
- Particle swarm optimization-based algorithms for TSP and generalized TSPInformation Processing Letters, 2007
- Learning and optimization using the clonal selection principleIEEE Transactions on Evolutionary Computation, 2002
- Shape optimization of electromagnetic devices using immune algorithmIEEE Transactions on Magnetics, 1997