Two Variants of Bi-objective Vehicle Routing Problem in Home (Health)-Care Fields.
Salma Hadj TaiebTaïcir Moalla LoukilAbderrahman El MhamediYasmina HaniPublished in: APMS (5) (2021)
Keyphrases
- health care
- vehicle routing problem
- bi objective
- routing problem
- home care
- metaheuristic
- ant colony optimization
- knapsack problem
- tabu search
- multi objective
- efficient solutions
- traveling salesman problem
- benchmark problems
- combinatorial optimization problems
- multiple objectives
- particle swarm optimization
- information systems
- network design
- multi objective optimization
- optimization problems
- np hard
- benchmark instances
- travel time
- shortest path problem
- combinatorial optimization
- primary care
- variable neighborhood search
- genetic algorithm
- neighborhood search
- test problems
- optimal solution
- chronic disease
- health services
- databases
- vehicle routing problem with simultaneous
- search strategies
- simulated annealing
- special case
- branch and bound algorithm
- differential evolution
- path relinking
- optimization algorithm
- genetic programming
- linear programming
- cost function
- evolutionary algorithm