Multi-directional local search for a bi-objective dial-a-ride problem in patient transportation.
Yves MolenbruchKris BraekersAn CarisGreet Vanden BerghePublished in: Comput. Oper. Res. (2017)
Keyphrases
- bi objective
- multi directional
- efficient solutions
- multi objective
- set covering problem
- multi objective optimization
- network design
- ant colony optimization
- optical coherence tomography
- optimal solution
- multiple objectives
- search space
- coding method
- genetic algorithm
- shortest path problem
- search algorithm
- clinical trials
- knapsack problem
- tabu search
- combinatorial optimization
- medical data
- simulated annealing
- heuristic methods
- shortest path
- neighborhood search
- neural network
- traveling salesman problem
- bit rate
- dynamic programming
- variable neighborhood search
- global optimization
- objective function