An overview of metaheuristics: accurate and efficient methods for optimisation
S Nesmachnow - International Journal of Metaheuristics, 2014 - inderscienceonline.com
This article presents an overview of metaheuristics as high-level soft computing strategies
for solving optimisation problems. A general view of the field is presented, and a review of …
for solving optimisation problems. A general view of the field is presented, and a review of …
Mendelian evolutionary theory optimization algorithm
This study presented a new multi-species binary coded algorithm, Mendelian evolutionary
theory optimization (METO), inspired by the plant genetics. This framework mainly consists …
theory optimization (METO), inspired by the plant genetics. This framework mainly consists …
[PDF][PDF] A novel memetic genetic algorithm for solving traveling salesman problem based on multi-parent crossover technique
A Roy, A Manna, S Maity - Decision Making: Applications in …, 2019 - researchgate.net
Original scientific paper Abstract: In the present study, a Novel Memetic Genetic Algorithm
(NMGA) is developed to solve the Traveling Salesman Problem (TSP). The proposed NMGA …
(NMGA) is developed to solve the Traveling Salesman Problem (TSP). The proposed NMGA …
Heuristics for the strong generalized minimum label spanning tree problem
In this work we introduce and study the strong generalized minimum label spanning tree
(GMLST), a novel optimization problem defined on edge‐labeled graphs. Given a label set …
(GMLST), a novel optimization problem defined on edge‐labeled graphs. Given a label set …
The k-labeled spanning forest problem
In the k-labeled Spanning Forest Problem (kLSF), given a graph G with a label (color)
assigned to each edge, and an integer positive value k max we look for the minimum …
assigned to each edge, and an integer positive value k max we look for the minimum …
Effective three-phase evolutionary algorithm to handle the large-scale colorful traveling salesman problem
H Ismkhan - Expert Systems with Applications, 2017 - Elsevier
This paper proposes a novel evolutionary algorithm to handle the colorful traveling
salesman problem. The proposed evolutionary algorithm is a three-phase algorithm and …
salesman problem. The proposed evolutionary algorithm is a three-phase algorithm and …
A modified genetic algorithm-based approach to solve constrained solid TSP with time window using interval valued parameter
C Changdar, GS Mahapatra… - International Journal of …, 2016 - inderscienceonline.com
In this paper, we have presented a solid travelling salesman problem (STSP) with
introduction of time-window and constraints. In STSP, a traveller can avail different …
introduction of time-window and constraints. In STSP, a traveller can avail different …
The rainbow cycle cover problem
We model and solve the Rainbow Cycle Cover Problem (RCCP). Given a connected and
undirected graph and a coloring function that assigns a color to each edge of from the finite …
undirected graph and a coloring function that assigns a color to each edge of from the finite …
A modified ant colony optimisation based approach to solve sub-tour constant travelling salesman problem
C Changdar, GS Mahapatra… - International Journal of …, 2017 - inderscienceonline.com
This paper presents an advanced ant colony optimisation approach to solve sub-tour
constant travelling salesman problem (SCTSP) with time limit in fuzzy environment. In …
constant travelling salesman problem (SCTSP) with time limit in fuzzy environment. In …
Comparison of metaheuristics for the k‐labeled spanning forest problem
In this paper, we study the k‐labeled spanning forest (kLSF) problem in which an undirected
graph whose edges are labeled and an integer‐positive value are given; the aim is to find a …
graph whose edges are labeled and an integer‐positive value are given; the aim is to find a …