Developing two heuristic algorithms with metaheuristic algorithms to improve solutions of optimization problems with soft and hard constraints: An application to nurse rostering problems.
Ping-Shun ChenZhi-Yang ZengPublished in: Appl. Soft Comput. (2020)
Keyphrases
- optimization problems
- metaheuristic algorithms
- metaheuristic
- benchmark problems
- combinatorial optimization
- hard constraints
- variable neighborhood search
- constraint violations
- ant colony optimization
- tabu search
- test problems
- evolutionary algorithm
- combinatorial optimization problems
- combinatorial problems
- simulated annealing
- solution quality
- benchmark instances
- heuristic methods
- exact algorithms
- traveling salesman problem
- optimal solution
- cost function
- soft constraints
- knapsack problem
- test instances
- path relinking
- genetic programming
- genetic algorithm
- vehicle routing problem
- evolutionary computation
- efficient solutions
- branch and bound algorithm
- differential evolution
- computational efficiency
- np complete
- graph cuts
- special case