نظام مستعمرة النمل المحسن والهجين للمساهمة في حل مسألة توجيه المركبة مع نوافذ زمنية

Authors

  • محمد حسن
  • لينا مقديسيان
  • وسيم بلال

Abstract

ندرس في هذا البحث إمكانية المساهمة في حل مسألة توجيه المركبة مع نوافذ زمنية ، و هي واحدة من مشاكل الأمثلية من النوع NP-hard حيث أخذت كثير من اهتمام الباحثين في الوقت الحاضر بسبب تطبيقاتها ذات الطابع اليومي ، إذ لا توجد حتى الآن خوارزمية تقدم الحل الأمثل لهذه المشكلة بسبب تعقيد زمن كثيرة الحدود وهذا يعني أن زمن الحل لمسألة توجيه المركبة مع نوافذ زمنية ينمو باطراد مع زيادة عدد العقد ، و كل الخوارزميات المستخدمة تعطي حلولاً تقريبية . سنعرض في بحثنا خوارزمية نظام مستعمرة النمل المحسن القادرة على استكشاف مناطق بحث متنوعة في فضاء الحل ، وخوارزمية محاكاة التعدين ، و هي تقنية بحث محلي يتم تطبيقها بنجاح في العديد من مسائل NP-hard . نقدم أيضاً خوارزمية تدعى بالهجينة تعتمد على مبدأ الدمج بين خوارزمية نظام النمل المحسن وخوارزمية محاكاة التعدين ، و مقارنة الحل الناتج عن هذا النهج الهجين مع نتائج تجارب قياسية لاختبار فعالية النهج المقدم . 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 present 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.

Downloads

Published

2017-03-05

How to Cite

1.
حسن م, مقديسيان ل, بلال و. نظام مستعمرة النمل المحسن والهجين للمساهمة في حل مسألة توجيه المركبة مع نوافذ زمنية. TUJ-BA [Internet]. 2017Mar.5 [cited 2024Dec.29];38(3). Available from: https://journal.tishreen.edu.sy/index.php/bassnc/article/view/2549

Issue

Vol. 38 No. 3 (2016): العلوم الأساسية

Section

Articles

License

Creative Commons License

This work is licensed under a Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International License.

The authors retain the copyright and grant the right to publish in the magazine for the first time with the transfer of the commercial right to the Tishreen University Journal -Basic Sciences Series  

 Under a CC BY- NC-SA 04 license that allows others to share the work with of the work's authorship and initial publication in this journal. Authors can use a copy of their articles in their scientific activity, and on their scientific websites, provided that the place of publication is indicted in Tishreen University Journal -Basic Sciences Series .  The Readers have the right to send, print and subscribe to the initial version of the article, and the title of Tishreen University Journal -Basic Sciences Series   Publisher

 

journal uses a CC BY-NC-SA license which mean

You are free to:

  • Adapt — remix, transform, and build upon the material
  •  
  • The licensor cannot revoke these freedoms as long as you follow the license terms.

 

  • Attribution — You must give appropriate credit, provide a link to the license, and indicate if changes were made. You may do so in any reasonable manner, but not in any way that suggests the licensor endorses you or your use.
  • NonCommercial — You may not use the material for commercial purposes.
  • ShareAlike — If you remix, transform, or build upon the material, you must distribute your contributions under the same license as the original.
  • No additional restrictions — You may not apply legal terms or technological measures that legally restrict others from doing anything the license permits.

Most read articles by the same author(s)