Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userNew Hybrid Evolutionary Algorithm for the Multi-Objective Traveling Salesman Problem (moTSP)
تطوير خوارزمية هجينة لحل مسألة البائع المتجول المتعددة الأهداف
3102
5 135
0
(
0
)
Created by
Shamra Editor
Ask ChatGPT about the research
يعد إيجاد الحلول الأمثلية لمسألة البائع المتجول أمرًا مطلوباً في كثير من الأبحاث و التطبيقات العملية على اعتبار وجود مجموعة من الأهداف في وقت واحد. نقدم في هذا البحث خوارزمية هجينة لحل مسألة البائع من خلال دمج خوارزمية مستعمرة النمل مع الخوارزمية الجينية.
In the Multi-objective Traveling Salesman Problem (moTSP) simultaneous optimization of more than one objective functions is required. This paper proposes hybrid algorithm to solve the multiobjectives Traveling Salesman problem through the integration of the ant colony optimization algorithm with the Genetic algorithm.
References used
Changdar-C., Mahapatra-G.S., Pal-R.K, 2014. An efficient genetic algorithm for multi-objective solid travelling salesman problem under fuzziness, Swarm and Evolutionary Computation. Pages 15, 27-37
Li-W.,2014. A parallel search system for dynamic multi-objective traveling salesman problem. Journal of Mathematics and System Science. Pages 4, 295-314
Wang-S., 2016. Multi-objective path finding in stochastic networks using a biogeography-based optimization method. Simulations of Urban Transportation Systems
rate research
Read More
Multi-objective evolutionary algorithms are used in a wide range
of fields to solve the issues of optimization, which require several
conflicting objectives to be considered together. Basic evolutionary
algorithm algorithms have several drawbacks,
such as lack of a
good criterion for termination, and lack of evidence of good
convergence. A multi-objective hybrid evolutionary algorithm is
often used to overcome these defects.
optimization
الأمثلة
الأمثلة متعددة الأهداف
الخوارزميات التطورية
الخوارزميات التطورية المتعددة الأهداف
الخوارزميات التطورية عديدة الأهداف
(Multi-Objective Optimization (MO
Evolutionary Algorithms
(Multi-Objective Evolutionary Algorithms (MOEAs
(Many-Objective Evolutionary Algorithms (MaOEAs
المزيد..
In this research we are studying the possibility of contributing in
solving the problem of the Traveling Salesman Problem, which is
a problem of the type NP-hard . And there is still no algorithm
provides us with the Optimal solution to this problem . All the
algorithms used to give solutions which are close to the optimal
one .
In this research, we are studying the possibility of contribution
in solving the multi-objective vehicle Routing problem with time
windows , that is one of the optimization problems of the NP-hard
type , This problem has attracted a lot of attenti
on now because of
its real life applications.
Moreover, We will also introduced an algorithm called hybrid
algorithm (HA) which depends on integrates between Multiple
objective ant colony optimisation (MOACO) and tabu search (TS)
algorithm based on the Pareto optimization , and compare the
presented approach is the developer with standard tests to
demonstrate the applicability and efficiency.
We study in this paper the possibility of contribution in solving the vehicle routing problem (VRP) by using the improved ant colony system ( IACS) , which is one of the optimization problems that, because of its Real Life applications, has attracted
a lot of attention at the present time. It is a problem of the NP-hard type. However, because of the complication of polynomial time there is still no algorithm providing us with the optimal solution of this problem. All the used algorithms give solutions that are close to the optimal one .
We present the improved ant colony system algorithm that, based on ant colony system algorithm, possesses a new state transition rule, a new pheromone updating rule and diverse local search approaches .
The experimental results of the proposed ( IACS) algorithm compared with the results of well-known standard tests show that our IACS yields better solutions than the other ant algorithms in the literature and is competitive with other meta-heuristic approaches in terms of quality(run time and number of good solutions ).
The majority of recent digital signature algorithms depend, in their
structure, on complicated mathematical concepts that require a long
time and a significant computational effort to be executed. As a
trial to reduce these problems, some researchers have proposed
digital signature algorithms which depend on simple arithmetic
functions and operations that are executed quickly, but that was at
the expense of the security of algorithms.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
