.png){kind=icon}
Return
An Adaptive Memetic Algorithm for Solving the Multiple Knapsack Assignment Problem
.png){kind=icon}
PRE
AI
DOI：10.1007/978-3-032-08462-0_13.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
The Multiple Knapsack Assignment Problem (MKAP) is a generalization of the Multiple Knapsack Problem (MKP), in which some additional assignment restrictions must be met. In this paper, we develop an efficient adaptive memetic algorithm to solve MKAP. The adaptive memetic algorithm (AMA) is obtained by integrating a powerful local search (LS) procedure within the framework of a genetic algorithm characterized by a dynamically adjusted mutation rate during the evolution process. Preliminary computational experiments have been performed on existing instances from the literature. The results achieved prove that our developed AMA performs better compared to the classical memetic algorithm (MA) and is highly competitive compared to the state-of-the-art approaches.
Keywords:
Multiple Knapsack Assignment Problem
Adaptive Memetic Algorithm
Genetic Algorithm
Local Search
Combinatorial Optimization
Journal
H
IF:
0
Papers:
28
Citations:
0
Organization
Cited Papers
ShareSaveShareSaveA memetic algorithm approach for solving the multidimensional multi-way number partitioning problem
OAAI
OAAIShareSaveAn improved immigration memetic algorithm for solving the heterogeneous fixed fleet vehicle routing problem.png)
NEUROCOMPUTING
NEUROCOMPUTINGIF6.5
PREAI
ShareSaveShareSaveShareSave
View more