A NEW ALGORITHM FOR SOLVING THE INVENTORY ROUTING PROBLEM WITH DIRECT SHIPMENT

Q: How can I download an article?

To download an article from SID, first log in to the site, search for the article title, and click on the 'Download Article' option.

Q: How can I download an ISI article?

To download an ISI article on SID, enter the keyword or article title in the search bar, view the relevant results, click on the desired article, and select the 'Download Article' option.

Q: How can I access the SID database?

To access the SID database, visit SID.ir, create an account, and log in to access scientific resources.

Q: Is downloading articles from SID free?

Some articles on SID are available for free, while others require payment. Details are specified on the article's page.

MIRZAEI ALI HOSSEIN; NAKHAI KAMALABADI ISA; ZEGORDI SEYED HESSAMEDDIN

مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

Download Full-Text

Persian Verion

View:

1,568

Download:

Cites:

Information Journal Paper

Title

A NEW ALGORITHM FOR SOLVING THE INVENTORY ROUTING PROBLEM WITH DIRECT SHIPMENT

Author(s)

MIRZAEI ALI HOSSEIN | NAKHAI KAMALABADI ISA | ZEGORDI SEYED HESSAMEDDIN | Issue Writer Certificate

Keywords

SUPPLY CHAINQ2

INVENTORY ROUTING PROBLEMQ2

DIRECT SHIPPING STRATEGYQ2

PARTICLE SWARM OPTIMIZATIONQ2

PRODUCTION-DISTRIBUTION PLANNINGQ2

Abstract

In this paper a multi-commodity multi-period INVENTORY ROUTING PROBLEM in a two-echelon SUPPLY CHAIN consisting of a manufacturer and a set of retailers has been studied. In addition to inventory management and distribution planning, production planning has also been considered in the above problem. The objective is to minimize total system cost that consists of production setup, inventory holding and distribution costs. The commodities are delivered to the retailers by an identical fleet of limited capacity vehicles through direct shipment strategy. Also it is assumed that production and storage capacity is limited and stockout is not allowed. Since similar problems without distribution planning are known as NP-hard, this is also an NP-hard problem. Therefore, in this paper, a new improved PARTICLE SWARM OPTIMIZATION algorithm has been developed consisting of two distinguished phases for problem solving. First, the values of binary variables are determined using the proposed algorithm and then, the continuous variables are calculated by solving a linear programming model. Performance of the proposed algorithm has been compared with genetic and original PARTICLE SWARM OPTIMIZATION algorithms using various samples of random problems. The findings imply significant performance of the proposed algorithm.

Cites

No record.

References

No record.

Cite

APA: Copy

MIRZAEI, ALI HOSSEIN, NAKHAI KAMALABADI, ISA, & ZEGORDI, SEYED HESSAMEDDIN. (2011). A NEW ALGORITHM FOR SOLVING THE INVENTORY ROUTING PROBLEM WITH DIRECT SHIPMENT. PRODUCTION AND OPERATIONS MANAGEMENT, 2(1 (2)), 1-28. SID. https://sid.ir/paper/404381/en

Vancouver: Copy

MIRZAEI ALI HOSSEIN, NAKHAI KAMALABADI ISA, ZEGORDI SEYED HESSAMEDDIN. A NEW ALGORITHM FOR SOLVING THE INVENTORY ROUTING PROBLEM WITH DIRECT SHIPMENT. PRODUCTION AND OPERATIONS MANAGEMENT[Internet]. 2011;2(1 (2)):1-28. Available from: https://sid.ir/paper/404381/en

IEEE: Copy

ALI HOSSEIN MIRZAEI, ISA NAKHAI KAMALABADI, and SEYED HESSAMEDDIN ZEGORDI, “A NEW ALGORITHM FOR SOLVING THE INVENTORY ROUTING PROBLEM WITH DIRECT SHIPMENT,” PRODUCTION AND OPERATIONS MANAGEMENT, vol. 2, no. 1 (2), pp. 1–28, 2011, [Online]. Available: https://sid.ir/paper/404381/en

Related Journal Papers