An effective memetic algorithm for the close-enough traveling salesman problem.
Zhenyu LeiJin-Kao HaoPublished in: Appl. Soft Comput. (2024)
Keyphrases
- traveling salesman problem
- memetic algorithm
- crossover operator
- combinatorial optimization
- vehicle routing problem
- benchmark instances
- ant colony optimization
- tabu search
- combinatorial optimization problems
- metaheuristic
- optimization problems
- timetabling problem
- ant colony optimization algorithm
- combinatorial problems
- simulated annealing
- traveling salesman
- computational intelligence
- job shop scheduling problem
- discrete particle swarm optimization
- genetic local search
- branch and bound algorithm
- fitness function
- optimization algorithm
- state space
- discrete optimization problems
- artificial intelligence