A new efficient genetic algorithm-Taguchi-based approach for multi-period inventory routing problem
Publish Year: 1402
نوع سند: مقاله ژورنالی
زبان: English
View: 29
This Paper With 17 Page And PDF Format Ready To Download
- Certificate
- من نویسنده این مقاله هستم
استخراج به نرم افزارهای پژوهشی:
شناسه ملی سند علمی:
JR_RIEJ-12-4_005
تاریخ نمایه سازی: 19 اسفند 1402
Abstract:
The inventory routing problem arises from the combination of the vehicle routing problem and the vendor-managed inventory problem. In this paper, we present a mathematical model and a novel genetic algorithm for solving the multi-period inventory routing problem. The objective is to supply products to scattered customers within a given time horizon while managing customer inventories to avoid shortages and minimize total inventory and transportation costs. To represent solutions for this problem, we introduce a new chromosomal structure. This structure offers simplicity in encoding and decoding solutions, maintains feasibility after crossover and mutation operations, addresses both routing and inventory management in a single step, and consolidates information about each solution method comprehensively. The algorithm parameters, including crossover and mutation rates, population size, number of iterations, and selection pressure, are fine-tuned using the Taguchi method. To assess algorithm efficiency, we utilize standard instances from the literature. Our results demonstrate that the proposed algorithm performs favorably compared to previous approaches.
Keywords:
Authors
Amin Farahbakhsh
Department of Industrial Engineering, Faculty of Engineering, Bu-Ali Sina University, Hamedan, Iran.
Amir Saman Kheirkhah
Department of Industrial Engineering, Faculty of Engineering, Bu-Ali Sina University, Hamedan, Iran.
مراجع و منابع این Paper:
لیست زیر مراجع و منابع استفاده شده در این Paper را نمایش می دهد. این مراجع به صورت کاملا ماشینی و بر اساس هوش مصنوعی استخراج شده اند و لذا ممکن است دارای اشکالاتی باشند که به مرور زمان دقت استخراج این محتوا افزایش می یابد. مراجعی که مقالات مربوط به آنها در سیویلیکا نمایه شده و پیدا شده اند، به خود Paper لینک شده اند :