Multi-objective metaheuristics for discrete optimization problems: A review of the state-of-the-art
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 …
objective discrete optimization problems (MODOPs). The relevant literature source and their …
[PDF][PDF] Memetic algorithms
The term 'Memetic Algorithms'[74](MAs) was introduced in the late 80s to denote a family of
metaheuristics that have as central theme the hybridization of different algorithmic …
metaheuristics that have as central theme the hybridization of different algorithmic …
A bi-objective home healthcare routing and scheduling problem considering patients' satisfaction in a fuzzy environment
Home care services are an alternative answer to hospitalization, and play an important role
in reducing the healthcare costs for governments and healthcare practitioners. To find a …
in reducing the healthcare costs for governments and healthcare practitioners. To find a …
[HTML][HTML] Literature review: Multi-criteria decision-making method application for sustainable deep-sea mining transport plans
W Ma, Y Du, X Liu, Y Shen - Ecological Indicators, 2022 - Elsevier
Deep-sea mining (DSM) is an emerging interdisciplinary and cross-domain research topic.
So far, there is no an effective, viable approach to evaluate the comprehensive performance …
So far, there is no an effective, viable approach to evaluate the comprehensive performance …
Evolutionary multimodal multiobjective optimization for traveling salesman problems
Multimodal multiobjective optimization problems (MMOPs) are commonly seen in real-world
applications. Many evolutionary algorithms have been proposed to solve continuous …
applications. Many evolutionary algorithms have been proposed to solve continuous …
A discrete shuffled frog-lea** algorithm based on heuristic information for traveling salesman problem
Y Huang, XN Shen, X You - Applied Soft Computing, 2021 - Elsevier
A discrete shuffled frog-lea** algorithm based on heuristic information is proposed and
the traveling salesman problem is used as a test problem. First, a new individual generation …
the traveling salesman problem is used as a test problem. First, a new individual generation …
A discrete invasive weed optimization algorithm for solving traveling salesman problem
Y Zhou, Q Luo, H Chen, A He, J Wu - Neurocomputing, 2015 - Elsevier
Abstract The Traveling Salesman Problem (TSP) is one of the typical NP-hard problems.
Efficient algorithms for the TSP have been the focus on academic circles at all times. This …
Efficient algorithms for the TSP have been the focus on academic circles at all times. This …
Discrete sine-cosine algorithm (DSCA) with local search for solving traveling salesman problem
MA Tawhid, P Savsani - Arabian Journal for Science and Engineering, 2019 - Springer
One of the new population-based optimization algorithms, named sine-cosine algorithm
(SCA), is introduced to solve continuous optimization problems. SCA utilizes the sine and …
(SCA), is introduced to solve continuous optimization problems. SCA utilizes the sine and …
A new geometric shape-based genetic clustering algorithm for the multi-depot vehicle routing problem
GN Yücenur, NÇ Demirel - Expert Systems with Applications, 2011 - Elsevier
In this paper, a new type of geometric shape based genetic clustering algorithm is proposed.
A genetic algorithm based on this clustering technique is developed for the solution process …
A genetic algorithm based on this clustering technique is developed for the solution process …
The multiobjective traveling salesman problem: A survey and a new approach
T Lust, J Teghem - Advances in Multi-Objective Nature Inspired …, 2010 - Springer
The traveling salesman problem (TSP) is a challenging problem in combinatorial
optimization. In this paper we consider the multiobjective TSP for which the aim is to obtain …
optimization. In this paper we consider the multiobjective TSP for which the aim is to obtain …