In this study, we consider the multi-objective multiple knapsack problem (MMKP) and we adapt our favorable weight based evolutionary algorithm (FWEA) to approximate the efficient frontier of MMKP. The algorithm assigns fitness to solutions based on their relative strengths as well as their non-dominated frontiers. The relative strength is measured based on a weighted Tchebycheff distance from the ideal point where each solution chooses its own weights that minimize its distance from the ideal point. We carry out experiments on test data for MMKP given in the literature and compare the performance of the algorithm with several leading algorithms.
Swipe to navigate through the chapters of this book
Please log in to get access to this content
To get access to this content you need the following product:
- An Evolutionary Algorithm for the Multi-objective Multiple Knapsack Problem
- Springer Berlin Heidelberg
- Sequence number
Neuer Inhalt/© ITandMEDIA