Finding and exploring promising search space for The 0–1 Multidimensional Knapsack Problem

The 0–1, Multidimensional Knapsack Problem (MKP) is a classical NP-hard combinatorial optimization problem with many engineering applications. In this paper, we propose a novel algorithm combining evolutionary computation with the exact algorithm to solve the 0–1 MKP. It maintains a set of solutions...

Celý popis

Podrobná bibliografia

Vydané v:	Applied soft computing Ročník 164; s. 111934
Hlavní autori:	Xu, Jitao, Li, Hongbo, Yin, Minghao
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Elsevier B.V 01.10.2024
Predmet:	0–1 Multidimensional Knapsack Problem Evolutionary computation Exact algorithm Heuristic Large Neighborhood Search 0–1 Multidimensional Knapsack Problem Exact algorithm Large Neighborhood Search Evolutionary computation Heuristic
ISSN:	1568-4946
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!