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...

Full description

Bibliographic Details

Published in:	Applied soft computing Vol. 164; p. 111934
Main Authors:	Xu, Jitao, Li, Hongbo, Yin, Minghao
Format:	Journal Article
Language:	English
Published:	Elsevier B.V 01.10.2024
Subjects:	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
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!