Modeling and Solving the Knapsack Problem with a Multi-Objective Equilibrium Optimizer Algorithm Based on Weighted Congestion Distance

Modeling and Solving the Knapsack Problem with a Multi-Objective Equilibrium Optimizer Algorithm Based on Weighted Congestion Distance

The knapsack problem is a typical bi-objective combinatorial optimization issue, wherein maximizing the value of the packed items is achieved concurrently with minimizing the weight of the load. Due to the conflicting objectives of the knapsack problem and the typical discrete property of the items...

Full description

Saved in:
Bibliographic Details
Main Authors: Ziqian Wang, Xin Huang, Yan Zhang, Danju Lv, Wei Li, Zhicheng Zhu, Jian’e Dong
Format: Article
Language:English
Published: MDPI AG 2024-11-01
Series:Mathematics
Subjects:
MOEO_WCD
knapsack problem
multi-objective optimization
weighted crowding distance
Online Access:https://www.mdpi.com/2227-7390/12/22/3538
Tags: Add Tag
No Tags, Be the first to tag this record!

Internet

https://www.mdpi.com/2227-7390/12/22/3538

Similar Items