Genetic local search with distance preserving recombination operator for a vehicle routing problem.
Andrzej JaszkiewiczPawel KominekPublished in: Eur. J. Oper. Res. (2003)
Keyphrases
- vehicle routing problem
- genetic local search
- distance preserving
- traveling salesman problem
- original data
- random projections
- combinatorial optimization
- low dimensional
- multi objective
- routing problem
- high dimensional data
- ant colony optimization
- optimization problems
- metaheuristic
- beam search
- graph properties
- particle swarm optimization
- tabu search
- pick up and delivery
- benchmark problems
- evolutionary algorithm
- machine learning
- sparse representation
- knapsack problem
- dimensionality reduction
- np hard
- image retrieval
- objective function
- keywords
- feature selection