A Comparative Study of Different Variants of a Memetic Algorithm for ATSP.
Krzysztof SzwarcUrszula BoryczkaPublished in: ICCCI (2) (2017)
Keyphrases
- memetic algorithm
- traveling salesman problem
- combinatorial optimization
- tabu search
- crossover operator
- job shop scheduling problem
- assembly line balancing
- branch and bound algorithm
- branch and bound
- evolutionary computation
- timetabling problem
- genetic algorithm
- vehicle routing problem
- benchmark instances
- comparative study
- simulated annealing
- combinatorial optimization problems
- artificial intelligence
- ant colony optimization
- genetic programming
- computational intelligence
- optimal solution
- decision making
- machine learning