[HTML][HTML] A comprehensive survey on the generalized traveling salesman problem
The generalized traveling salesman problem (GTSP) is an extension of the classical
traveling salesman problem (TSP) and it is among the most researched combinatorial …
traveling salesman problem (TSP) and it is among the most researched combinatorial …
Differential Evolution: A review of more than two decades of research
Since its inception in 1995, Differential Evolution (DE) has emerged as one of the most
frequently used algorithms for solving complex optimization problems. Its flexibility and …
frequently used algorithms for solving complex optimization problems. Its flexibility and …
Improved multi-operator differential evolution algorithm for solving unconstrained problems
KM Sallam, SM Elsayed… - 2020 IEEE congress …, 2020 - ieeexplore.ieee.org
In recent years, several multi-method and multi-operator-based algorithms have been
proposed for solving optimization problems. Generally, their performance is better than other …
proposed for solving optimization problems. Generally, their performance is better than other …
Ensemble strategies for population-based optimization algorithms–A survey
In population-based optimization algorithms (POAs), given an optimization problem, the
quality of the solutions depends heavily on the selection of algorithms, strategies and …
quality of the solutions depends heavily on the selection of algorithms, strategies and …
Backtracking search optimization algorithm for numerical optimization problems
P Civicioglu - Applied Mathematics and computation, 2013 - Elsevier
This paper introduces the Backtracking Search Optimization Algorithm (BSA), a new
evolutionary algorithm (EA) for solving real-valued numerical optimization problems. EAs …
evolutionary algorithm (EA) for solving real-valued numerical optimization problems. EAs …
Differential evolution: A survey of the state-of-the-art
S Das, PN Suganthan - IEEE transactions on evolutionary …, 2010 - ieeexplore.ieee.org
Differential evolution (DE) is arguably one of the most powerful stochastic real-parameter
optimization algorithms in current use. DE operates through similar computational steps as …
optimization algorithms in current use. DE operates through similar computational steps as …
Multi-strategy ensemble artificial bee colony algorithm
Artificial bee colony (ABC) is a recently proposed optimization technique which has shown
to be competitive to other population-based stochastic algorithms. However, ABC is good at …
to be competitive to other population-based stochastic algorithms. However, ABC is good at …
An improved ant colony optimization algorithm to the periodic vehicle routing problem with time window and service choice
Y Wang, L Wang, G Chen, Z Cai, Y Zhou… - Swarm and Evolutionary …, 2020 - Elsevier
This article addresses a Periodic Vehicle Routing Problem with Time Window and Service
Choice problem. This problem is basically a combination of existing Periodic Vehicle …
Choice problem. This problem is basically a combination of existing Periodic Vehicle …
Discrete symbiotic organisms search algorithm for travelling salesman problem
AES Ezugwu, AO Adewumi - Expert Systems with Applications, 2017 - Elsevier
Abstract A Discrete Symbiotic Organisms Search (DSOS) algorithm for finding a near optimal
solution for the Travelling Salesman Problem (TSP) is proposed. The SOS is a metaheuristic …
solution for the Travelling Salesman Problem (TSP) is proposed. The SOS is a metaheuristic …
Constrained multi-objective optimization algorithm with an ensemble of constraint handling methods
BY Qu, PN Suganthan - Engineering Optimization, 2011 - Taylor & Francis
Different constraint handling techniques have been used with multi-objective evolutionary
algorithms (MOEA) to solve constrained multi-objective optimization problems. It is …
algorithms (MOEA) to solve constrained multi-objective optimization problems. It is …