A hybrid metaheuristic for the Knapsack Problem with Forfeits.
Giovanni CapobiancoCiriaco D'AmbrosioLuigi PavoneAndrea RaiconiGaetano VitaleFabio SebastianoPublished in: Soft Comput. (2022)
Keyphrases
- knapsack problem
- hybrid metaheuristic
- vehicle routing problem
- metaheuristic
- scatter search
- optimization problems
- combinatorial optimization problems
- optimal solution
- np hard
- dynamic programming
- multi objective
- routing problem
- test problems
- exact algorithms
- nsga ii
- travel time
- greedy algorithm
- variable neighborhood search
- path relinking
- genetic algorithm
- benchmark instances
- initial population
- memetic algorithm
- search space
- linear program
- combinatorial optimization
- differential evolution algorithm
- simulated annealing
- particle swarm optimization
- ant colony optimization
- implicit enumeration
- objective function