ارسل ملاحظاتك

ارسل ملاحظاتك لنا







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
رابط المحتوى:
صورة الغلاف QR قانون
حفظ في:
LEADER 02465nam a22002417a 4500
001 1715088
024 |3 10.33948/0584-024-001-007 
041 |a eng 
044 |b السعودية 
100 |9 34215  |a Hosny, Manar Ibrahim  |e Author 
245 |a Constructing Initial Solutions For The Multiple Vehicle Pickup And Delivery Problem With Time Windows 
260 |b جامعة الملك سعود  |c 2012 
300 |a 59 - 69 
336 |a بحوث ومقالات  |b Article 
520 |b 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. 
653 |a برامج الحاسوب  |a الخوارزميات  |a الخوارزمية المتوازية 
692 |b Combinatorial Optimization  |b Pickup And Delivery  |b Vehicle Routing  |b Heuristics  |b Meta Heuristics  |b Construction Algorithms 
700 |a Mumford, Christine L.  |e Co-Author  |9 523890 
773 |c 007  |e Journal of King Saud University (Computer and Information Sciences)  |f Maǧalaẗ ǧamʼaẗ al-malīk Saud : ùlm al-ḥasib wa al-maʼlumat  |l 001  |m مج24, ع1  |o 0584  |s مجلة جامعة الملك سعود - علوم الحاسب والمعلومات  |v 024  |x 1319-1578 
856 |u 0584-024-001-007.pdf 
930 |d y  |p y 
995 |a science 
999 |c 972054  |d 972054 

عناصر مشابهة