Joint Replenishment Problem with Multisupplier using Hybrid Genetic Algorithm(<Special English Issue>Global Supply Chain Management)
-
- Yoo Myungryun
- Musasi Institute of Technology
-
- Gen Mitsuo
- Waseda University
Bibliographic Information
- Other Title
-
- Joint replenishment problem with multisupplier using hybrid genetic algorithm
Search this article
Description
The joint replenishment problem (JRP) involves determining a replenishment policy that minimizes the total cost of replenishing multiple items from a single supplier. In this paper, we propose a new approach for the JRP where items are procured from multisupplier. In solution algorithms, the Genetic Algorithm (GA) and the Simulated Annealing (SA) are cooperatively used. In this method, the convergence of GA is improved by introducing the probability of SA as the criterion for acceptance of new trial solution. We use genetic algorithm for this problem. The purpose of the proposed algorithm in this paper is to minimize the total relevant costs per unit time. The effectiveness of the proposed algorithm is shown through a simulation study.
Journal
-
- Journal of Japan Industrial Management Association
-
Journal of Japan Industrial Management Association 57 (6), 497-502, 2007
Japan Industrial Management Association
- Tweet
Details 詳細情報について
-
- CRID
- 1390282680482265600
-
- NII Article ID
- 110007521697
-
- NII Book ID
- AN10561806
-
- ISSN
- 21879079
- 13422618
-
- NDL BIB ID
- 8711916
-
- Text Lang
- en
-
- Data Source
-
- JaLC
- NDL
- CiNii Articles
-
- Abstract License Flag
- Disallowed