A bi-objective home care routing and scheduling problem considering patient preference and soft temporal dependency constraints.
Nastaran Oladzad-AbbasabadyReza Tavakkoli-MoghaddamMehrdad MohammadiBehdin Vahedi NouriPublished in: Eng. Appl. Artif. Intell. (2023)
Keyphrases
- home care
- bi objective
- scheduling problem
- patient data
- efficient solutions
- multi objective
- routing problem
- health care
- layered architecture
- clinical data
- np hard
- multi objective optimization
- pervasive computing
- knapsack problem
- network design
- multiple objectives
- ad hoc networks
- tabu search
- ant colony optimization
- genetic algorithm
- particle swarm optimization
- simulated annealing
- lower bound
- information systems