Multi-objective metaheuristics for discrete optimization problems: A review of the state-of-the-art

Q Liu, X Li, H Liu, Z Guo - Applied Soft Computing, 2020 - Elsevier
This paper presents a state-of-the-art review on multi-objective metaheuristics for multi-
objective discrete optimization problems (MODOPs). The relevant literature source and their …

[HTML][HTML] A multi-objective approach for energy-efficient and reliable dynamic VM consolidation in cloud data centers

MH Sayadnavard, AT Haghighat… - Engineering science and …, 2022 - Elsevier
The rapid growth of cloud computing in the last decade has led to an increasing concern
about the energy requirement of cloud data centers. Dynamic virtual machine (VM) …

Recommendation system for software refactoring using innovization and interactive dynamic optimization

MW Mkaouer, M Kessentini, S Bechikh, K Deb… - Proceedings of the 29th …, 2014 - dl.acm.org
We propose a novel recommendation tool for software refactoring that dynamically adapts
and suggests refactorings to developers interactively based on their feedback and …

Multiobjective multiple neighborhood search algorithms for multiobjective fleet size and mix location-routing problem with time windows

J Wang, L Yuan, Z Zhang, S Gao… - IEEE Transactions on …, 2019 - ieeexplore.ieee.org
This paper introduces a multiobjective fleet size and mix location-routing problem with time
windows and designs a set of real-world benchmark instances. Then, two versions of …

A multi-population algorithm for multi-objective knapsack problem

IB Mansour, M Basseur, F Saubion - Applied Soft Computing, 2018 - Elsevier
Local search algorithms constitute a growing area of interest to approximate the Pareto sets
of multi-objective combinatorial problem instances. In this study, we focus on the multi …

A multiple reference point-based evolutionary algorithm for dynamic multi-objective optimization with undetectable changes

R Azzouz, S Bechikh, LB Said - 2014 IEEE congress on …, 2014 - ieeexplore.ieee.org
Dynamic multi-objective optimization problems involve the simultaneous optimization of
several competing objectives where the objective functions and/or constraints may change …

A bi-objective stochastic order planning problem in make-to-order multi-site textile manufacturing

Z Zhang, C Guo, Q Wei, Z Guo, L Gao - Computers & Industrial Engineering, 2021 - Elsevier
This study addresses a multi-site stochastic order planning problem with real-world features
existing in make-to-order textile manufacturing supply chains widely. A mathematical model …

An effective hybrid ant colony optimization for the knapsack problem using multi-directional search

I BenMansour - SN Computer Science, 2023 - Springer
Finding a good compromise between intensification and diversification mechanisms is very
challenging task when solving multi-objective optimization problems (MOPs). In this paper …

R2-IBMOLS applied to a practical case of the multiobjective knapsack problem

B Chabane, M Basseur, JK Hao - Expert Systems with Applications, 2017 - Elsevier
The social and medico-social sector is experiencing a fast evolution due to the continuing
growth of older population. Yet, social and medico-social structures suffer from a real lack of …

Multiobjective vehicle routing problem with fixed delivery and optional collections

LP Assis, AL Maravilha, A Vivas, F Campelo… - Optimization letters, 2013 - Springer
We present an adaption on the formulation for the vehicle routing problem with fixed delivery
and optional collections, in which the simultaneous minimization of route costs and of …