A multi-population algorithm for multi-objective knapsack problem-Reference-Cited by-同舟云学术

A multi-population algorithm for multi-objective knapsack problem

Published:2018-09 Issue: Volume:70 Page:814-825
ISSN:1568-4946
Container-title:Applied Soft Computing
language:en
Short-container-title:Applied Soft Computing

Author:

Ben Mansour Imen,Basseur Matthieu,Saubion Frédéric

Publisher

Elsevier BV

Subject

Software

Reference38 articles.

1. Guided Pareto local search and its application to the 0/1 multi-objective knapsack problems;Alsheddy;Metaheuristic International Conference (MIC),2009

2. Indicator-based multiobjective local search;Basseur,2007

3. The efficiency of indicator-based local search for multi-objective combinatorial optimisation problems;Basseur;J. Heuristics,2012

4. Design of multi-objective evolutionary algorithms: application to the flow-shop scheduling problem;Basseur,2002

5. Adaptive mechanisms for multi-objective evolutionary algorithms;Basseur,2003

Cited by 23 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. A novel multimodal multi-objective differential evolution algorithm based on nearest neighbor-repulsion strategy;Information Sciences;2024-08

2. A New Approach to Detecting and Preventing Populations Stagnation Through Dynamic Changes in Multi-Population-Based Algorithms;Journal of Artificial Intelligence and Soft Computing Research;2023-10-01

3. Artificial Bee Colony Algorithm with Pareto-Based Approach for Multi-Objective Three-Dimensional Single Container Loading Problems;Applied Sciences;2023-05-29

4. An Effective Hybrid Ant Colony Optimization for the Knapsack Problem Using Multi-Directional Search;SN Computer Science;2023-01-13

5. On Multiobjective Knapsack Problems with Multiple Decision Makers;2022 IEEE Symposium Series on Computational Intelligence (SSCI);2022-12-04