کد مقاله کد نشریه سال انتشار مقاله انگلیسی نسخه تمام متن
4958963 1445459 2018 13 صفحه PDF دانلود رایگان
عنوان انگلیسی مقاله ISI
Optimisation of transportation service network using κ-node large neighbourhood search
ترجمه فارسی عنوان
بهینه سازی شبکه خدمات حمل و نقل با استفاده از جستجوی محله بزرگ گره k
موضوعات مرتبط
مهندسی و علوم پایه مهندسی کامپیوتر علوم کامپیوتر (عمومی)
چکیده انگلیسی


- Service network optimisation plays a key role in sustainable transportation.
- A novel κ-node neighbourhood function is proposed that can handle constraints more efficiently.
- The proposed neighbourhood has better reachability than all previous neighbourhood functions.
- A hybrid large neighbourhood search algorithm based on κ-node neighbourhood produces very competitive results.
- The proposed κ-node neighbourhood function can be used for different SNDP variants.

The Service Network Design Problem (SNDP) is generally considered as a fundamental problem in transportation logistics and involves the determination of an efficient transportation network and corresponding schedules. The problem is extremely challenging due to the complexity of the constraints and the scale of real-world applications. Therefore, efficient solution methods for this problem are one of the most important research issues in this field. However, current research has mainly focused on various sophisticated high-level search strategies in the form of different local search metaheuristics and their hybrids. Little attention has been paid to novel neighbourhood structures which also play a crucial role in the performance of the algorithm. In this research, we propose a new efficient neighbourhood structure that uses the SNDP constraints to its advantage and more importantly appears to have better reachability than the current ones. The effectiveness of this new neighbourhood is evaluated in a basic Tabu Search (TS) metaheuristic and a basic Guided Local Search (GLS) method. Experimental results based on a set of well-known benchmark instances show that the new neighbourhood performs better than the previous arc-flipping neighbourhood. The performance of the TS metaheuristic based on the proposed neighbourhood is further enhanced through fast neighbourhood search heuristics and hybridisation with other approaches.

ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Computers & Operations Research - Volume 89, January 2018, Pages 193-205
نویسندگان
, , , ,