Solving a Bi-Objective Transportation Vehicle Routing Problem for Waste Collection by a New Hybrid Algorithm
Publish Year: 1395
نوع سند: مقاله ژورنالی
زبان: English
View: 143
This Paper With 27 Page And PDF Format Ready To Download
- Certificate
- من نویسنده این مقاله هستم
استخراج به نرم افزارهای پژوهشی:
شناسه ملی سند علمی:
JR_RIEJ-5-1_002
تاریخ نمایه سازی: 28 دی 1400
Abstract:
This paper is an extension of the well-known vehicle routing problem (VRP) consisting of two stages. The first and second stages deal with the vehicle routing and transportation problems, respectively. Waste collection is one of the applications of the considered problem in a real world situation. A new mathematical model for this type of the problem is presented that minimizes the waste collection cost and decreases the risk posed to the environment for hazardous wastes transportation simultaneously. According to the NP-hard nature of the problem, a new multi-objective hybrid cultural and genetic algorithm (MOHCG) is proposed to obtain Pareto solutions. A straightforward representation for coding the given model is proposed to help us in reducing the computational time. To validate the proposed algorithm, a number of test problems are conducted and the obtained results are compared with the results of the well-known multi-objective evolutionary algorithm, namely non-dominated sorting genetic algorithm (NSGA-II), with respect to some comparison metrics. Finally, the conclusion is provided.
Keywords:
Authors
H. Farrokhi-Asl
School of Industrial Engineering, College of Engineering, University of Tehran, Tehran, Iran
R. Tavakkoli-Moghaddam
School of Industrial Engineering, College of Engineering, University of Tehran, Tehran, Iran
مراجع و منابع این Paper:
لیست زیر مراجع و منابع استفاده شده در این Paper را نمایش می دهد. این مراجع به صورت کاملا ماشینی و بر اساس هوش مصنوعی استخراج شده اند و لذا ممکن است دارای اشکالاتی باشند که به مرور زمان دقت استخراج این محتوا افزایش می یابد. مراجعی که مقالات مربوط به آنها در سیویلیکا نمایه شده و پیدا شده اند، به خود Paper لینک شده اند :