Beam-ACO Based on Stochastic Sampling for Makespan Optimization Concerning the TSP with Time Windows.
Manuel López-IbáñezChristian BlumDhananjay R. ThiruvadyAndreas T. ErnstBernd MeyerPublished in: EvoCOP (2009)
Keyphrases
- stochastic sampling
- ant colony optimization
- traveling salesman problem
- aco algorithms
- vehicle routing
- optimization problems
- combinatorial optimization
- simulated annealing
- scheduling problem
- aco algorithm
- computationally inexpensive
- np hard
- vehicle routing problem
- metaheuristic
- importance sampling
- optimal solution
- combinatorial optimization problems
- evolutionary algorithm
- upper bound
- partial solutions
- lower bound
- objective function
- branch and bound
- genetic algorithm