Developing an evolutionary algorithm for the Vehicle Routing Problem in Large Scale Network
Publish Year: 1395
نوع سند: مقاله کنفرانسی
زبان: English
View: 430
This Paper With 13 Page And PDF Format Ready To Download
- Certificate
- من نویسنده این مقاله هستم
استخراج به نرم افزارهای پژوهشی:
شناسه ملی سند علمی:
TTC16_220
تاریخ نمایه سازی: 29 فروردین 1397
Abstract:
This paper presents an application of a novel nature-inspired algorithm to the basic Vehicle Routing Problem (VRP) in a large scale network, 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. In order to address the proposed problem, a new meta-heuristics inspired by Red Deer’s mating is presented (RDA). This issue aims to explore the RDA on the proposed VRP for the first time. To check the performance of meta-heuristic, an exact solution solver, Branch and Bound (B&B), is utilized by LINGO software. Further results are given using an Imperialist Competitive Algorithm (ICA) and Genetic Algorithm (GA), showing that RDA is competitive with other strong meta-heuristics in terms of solution time and quality of results.
Keywords:
Authors
Ali Hessami
Board Director, Payacopa Engineeers, Tehran, Iran
Amir-Mohammad Fathollahi-Fard
Department of Industrial Engineering and Management Systems, University of Science and Technology of Mazandaran, Behshahr, Iran - Laboratory of Optimization Algorithm Center (OAC), Behshahr, Iran
Mostafa Hajiaghaei-Keshteli
Department of Industrial Engineering and Management Systems, University of Science and Technology of Mazandaran, Behshahr, Iran - Laboratory of Optimization Algorithm Center (OAC), Behshahr, Iran