يجب تسجيل الدخول أولا
Constructing Initial Solutions For The Multiple Vehicle Pickup And Delivery Problem With Time Windows
| المصدر: | مجلة جامعة الملك سعود - علوم الحاسب والمعلومات |
|---|---|
| الناشر: | جامعة الملك سعود |
| المؤلف الرئيسي: | Hosny, Manar Ibrahim (Author) |
| مؤلفين آخرين: | Mumford, Christine L. (Co-Author) |
| المجلد/العدد: | مج24, ع1 |
| محكمة: | نعم |
| الدولة: |
السعودية |
| التاريخ الميلادي: |
2012
|
| الصفحات: | 59 - 69 |
| DOI: |
10.33948/0584-024-001-007 |
| ISSN: |
1319-1578 |
| رقم MD: | 972054 |
| نوع المحتوى: | بحوث ومقالات |
| اللغة: | الإنجليزية |
| قواعد المعلومات: | science |
| مواضيع: | |
| كلمات المؤلف المفتاحية: |
Combinatorial Optimization | Pickup And Delivery | Vehicle Routing | Heuristics | Meta Heuristics | Construction Algorithms
|
| رابط المحتوى: |
| المستخلص: |
The Multiple Vehicle Pickup and Delivery Problem with Time Windows (MV-PDPTWs) is an important problem in logistics and transportation. However, this problem is characterized by having a large number of constraints that are difficult to deal with in a solution algorithm. Indeed, merely constructing a feasible solution to this hard problem is a challenge in itself. In this research, we compare several construction algorithms that generate initial feasible solutions to the problem. The suggested algorithms all utilize a simple routing heuristic to create individual vehicle routes. The algorithms differ, though, in whether routes are generated sequentially or in parallel. They also have different criteria for selecting requests and the routes in which they will be inserted. Inserting a request in a route is either based on a first acceptance criterion, in which a request is inserted in the first route where a feasible insertion is found, or a best acceptance criterion, in which a request is inserted in the estimated best route for insertion. Experimental results on several benchmark problem instances indicate that the sequential construction heuristic may be the most suitable construction algorithm for this problem, in terms of simplicity of coding, solution quality as well as processing speed. |
|---|---|
| ISSN: |
1319-1578 |
عناصر مشابهة
-
Investigating Heuristic and Meta-Heuristic Algorithms for Solving Pickup and Delivery Problems
بواسطة: Hosny, Manar Ibrahim منشور: (2010) -
Simulation and Implementation of A Fault-Tolerant Router for Grid-Structured Parallel Processing Architectures
بواسطة: Idris, Raed Ibrahim منشور: (2000) -
Solving the Dynamic Pickup and Delivery Problem with Time Windows Using Hybrid Local Search Metaheuristics
بواسطة: العمري، جواد عاصم منشور: (2009) -
Travelling Salesman Problem over Chained-Cubic Tree Using Genetic Algorithm and Ant Colony
بواسطة: الكوفحي، خالد أحمد عبدالعزيز منشور: (2017) -
Parallel Chemical Reaction Optimization for Graph Vertex Cover Problem
بواسطة: عواد، هبة الله خطاب محمود منشور: (2019)
