Two memetic algorithms for heterogeneous fleet vehicle routing problems.
Christian PrinsPublished in: Eng. Appl. Artif. Intell. (2009)
Keyphrases
- memetic algorithm
- vehicle routing problem
- tabu search
- metaheuristic
- vehicle routing problem with time windows
- benchmark problems
- assembly line balancing
- routing problem
- test instances
- benchmark instances
- traveling salesman problem
- timetabling problem
- combinatorial optimization
- waste collection
- job shop scheduling problem
- np hard
- multi depot
- ant colony optimization
- simulated annealing
- search strategies
- knapsack problem
- mathematical programming
- scheduling problem
- greedy randomized adaptive search procedure
- artificial neural networks
- search procedure
- variable neighborhood search
- search algorithm
- branch and bound algorithm
- artificial intelligence
- information retrieval
- machine learning