Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userHybrid Tabu Search And Guided Local Search And Existence 2-Opt Local Search To Contribute In Solving The Vehicle Routing Problem With Time Windows
تهجين البحث المحلي الموجه مع البحث المحظور ووجود البحث المحلي 2- Opt للمساهمة في حل مسألة توجيه المركبة مع نوافذ زمنية
1403
0 0
0
(
0
)
Added by
Tishreen University ورقة بحثية
Publication date
2017
fields
Mathematics
and research's language is
العربية
Created by
Shamra Editor
Ask ChatGPT about the research
ندرس في هذا البحث إمكانية المساهمة في حل مسألة توجيه المركبة مع نوافذ زمنية Vehicle Routing Problem with Time Windows (VRPTW) التي هي واحدة من مشاكل الأمثلية من النوع NP-Hard. نقدم خوارزمية هجينة تعتمد على مبدأ التكامل بين خوارزمية البحث المحلي الموجه و خوارزمية البحث المحظور و وجود البحث المحلي 2- Opt ، و المستند على خوارزمية التوفير المرتبطة بتابع هدف معين لتوفير الكثير من المدخرات ، و كما سنقارن الحل الناتج عن هذا النهج الهجين و المطور مع نتائج تجارب قياسية لخوارزميات هجينة لاختبار فعالية هذه الخوارزمية المقدمة و تأثيرها على نوعية الحل من حيث سرعة التقارب و القدرة على إيجاد حلول أفضل .
In this research, we are studying the possibility of contribution in solving the Vehicle Routing Problem with Time Windows(VRPTW),that is one of the optimization problems of the NP-hard type. Moreover, Hybrid algorithm (HA) provided that integrates between Tabu Search Algorithm and Guided Local Search algorithm And existence 2- Opt Local Search, based on the savings algorithm in terms of continued of a particular objective to provide a lot of savings. As we will compare the presented approach with standard tests to demonstrate the efficiency, and their impact on the quality of the solution in terms of speed of convergence and the ability to find better solutions.
References used
SOLOMON, M.M. ,"Algorithms for the vehicle routing and scheduling problems with time window constrains", Operational Research,Vol.35,No.2, 1987,PP. 250-265
DANTZIG, G.B., RAMSER, J. H., "The Truck Dispatching Problem". Management Science, Vol. 6, No. 1,1959. pp. 79-89
BRÄYSY.O ; GENDREAU, M., "Vehicle routing problem with time windows", part ii: Metaheuristics. Transportation Science, 39(1):pp.119–139, 2005
rate research
Read More
In this research, we are studying the possibility of
contribution in solving the Vehicle Routing Problem With Time
Windows(VRPWTW), that is one of the optimization problems of
the NP-hard type. This problem has attracted a lot of attention now
be
cause of its real life applications. However, there is still no
algorithm that provides us with the perfect solution to this problem
because of the complexity of polynomial time. This means that the
time of the solution to the VRPWTW is growing steadily with the
increase in the number of nodes .All the used algorithms have just
given solutions that are close to the optimal one.
In this research, we are studying the possibility of contribution in solving the Vehicle Routing Problem With Time Windows(VRPWTW), that is one of the optimization problems of the NP-hard type. This problem has attracted a lot of attention at the pre
sent time because of its real life applications. However, there is still no algorithm that provides us with the perfect solution to this problem because of the complexity of polynomial time. This means that the time of the solution to the Vehicle VRPWTW is growing steadily with the increase in the number of nodes .All the used algorithms have given solutions that are close to the optimal one . We'll introduce two algorithms , the first is Improved Ant Colony System algorithm (IACS) that is capable of searching multiple search areas simultaneously in the solution space is good in diversification ,and the second Simulated Annealing algorithm (SA) is a local search technique that has been successfully applied to many NP-hard problems. Moreover, we will present the In this research Hybrid algorithm (HA) Hybrid Algorithm provided (IACS-SA) that integrate between improved ant algorithm and Simulated Annealing algorithm . We will known standard tests are given to demonstrate the applicability and efficiency of the presented approach and comparisons with other available results are presented.
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.
n this research, we are studying the possibility of contribution in solving the Vehicle Routing Problem (VRP), which is one of the optimization problems that, because of its Real Life applications, has attracted a lot of attention at the present tim
e. 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 .
In this research, we will present the Hybrid Algorithm (HA) in two phases .In the first phase the Sweep Algorithm (SW) is applied, and in the second one the Ant Colony Algorithm and the local search 3-opt are applied. we will then compare the quality of the solution resulted from this hybrid approach with the results of well-known standard tests to determine the effectiveness of the presented approach .
We offer in this approach the integration of search engines with filtering techniques, through the
dynamic relationship of hybridization between collaborative filtering and content based filtering in
order to solve the past limitations and improve
precision and recall of retrieved documents. The
approach uses Domain ontology model in the representation of user profile to reduce errors and
confusion resulting from consideration for user profile as a single entity, as well as taking advantage from
user activity for adaptation of user profile to reflect the state of user.
suggested questions
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
