A new efficient genetic algorithm-Taguchi-based approach for multi-period inventory routing problem
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...
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Ayandegan Institute of Higher Education,
2023-12-01
|
| Series: | International Journal of Research in Industrial Engineering |
| Subjects: | |
| Online Access: | https://www.riejournal.com/article_184195_90b682ec7f859711f76fb0cb6ca7559a.pdf |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | 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. |
|---|---|
| ISSN: | 2783-1337 2717-2937 |