Solving the biobjective selective pickup and delivery problem with memetic algorithm.
Xin-Lan LiaoChuan-Kang TingPublished in: CIPLS (2013)
Keyphrases
- memetic algorithm
- bi objective
- timetabling problem
- combinatorial optimization
- tabu search
- efficient solutions
- minimum cost flow
- multi objective
- evolutionary computation
- genetic algorithm
- set covering problem
- simulated annealing
- job shop scheduling problem
- vehicle routing problem
- shortest path problem
- crossover operator
- benchmark instances
- multi objective optimization
- network design
- ant colony optimization
- multiple objectives
- knapsack problem
- computational intelligence
- branch and bound
- artificial intelligence