Addressing the Vehicle Routing Problem in Large Scale Network via Novel Nature-inspired Algorithm
Publish place: 13th International Industrial Engineering Conference
Publish Year: 1395
نوع سند: مقاله کنفرانسی
زبان: English
View: 585
This Paper With 10 Page And PDF Format Ready To Download
- Certificate
- من نویسنده این مقاله هستم
استخراج به نرم افزارهای پژوهشی:
شناسه ملی سند علمی:
IIEC13_035
تاریخ نمایه سازی: 14 شهریور 1396
Abstract:
Nowadays, nature-inspired plays a key role especially in transportation problems and operation management problems. This study presents the application of a novel nature-inspired algorithm to the basic Vehicle Routing Problem (VRP) in the large scale network, in which customers of known demand are supplied from a single depot. Vehicles are subject to a weight limit and, in some cases, to a limit on the distance travelled. Only one vehicle is allowed to supply each customer. Furthermore, to address the proposed problem, RDA inspired by Red Deer’s mating and presented recently as one of novel metaheurisitc methods is introduced. This issue aims to explore the RDA on the proposed VRP for the first time. In addition, computational results are computed for the RDA which is put forward. Further results are given using an imperialist competitive algorithm and genetic algorithm, showing that this approach is competitive with other strong metahuristics in terms of solution time and quality.
Keywords:
Authors
M Fazli
Department of Industrial Engineering, Shomal University, Amol, Iran
M Hajiaghaei-Keshteli
Department of Industrial Engineering and Management Systems, University of Science and Technology of Mazandaran, Behshahr, Iran
A.M Fathollahi Fard
Department of Industrial Engineering and Management Systems, University of Science and Technology of Mazandaran, Behshahr, Iran