SOLVING A NEW MATHEMATICAL MODEL FOR SCHEDULING IN DISTRIBUTION NETWORKS BY MULTI-OBJECTIVE PARTICLE SWARM OPTIMIZATION

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.

ARAB RAHMAT; TAVAKKOLI MOGHADDAM REZA; FORGHANI MOHSEN

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

Journal Paper

Paper Information

Journal: PRODUCTION AND OPERATIONS MANAGEMENT Year:2014 | Volume:4 | Issue:2 (7) Page(s): 95-112

Download Full-Text

Persian Verion

View:

1,022

Download:

Cites:

Information Journal Paper

Title

SOLVING A NEW MATHEMATICAL MODEL FOR SCHEDULING IN DISTRIBUTION NETWORKS BY MULTI-OBJECTIVE PARTICLE SWARM OPTIMIZATION

Author(s)

ARAB RAHMAT | TAVAKKOLI MOGHADDAM REZA | FORGHANI MOHSEN | Issue Writer Certificate

Keywords

SUPPLY CHAIN MANAGEMENTQ2

DISTRIBUTION NETWORKQ2

MULTIQ1

OBJECTIVE OPTIMIZATIONQ2

PARTICLE SWARM ALGORITHMQ2

Abstract

In this paper a novel, bi-objective mixed-integer mathematical programming has been proposed for a DISTRIBUTION NETWORK problem. One objective function minimizes the total purchasing, transportation and holding costs and the another objective minimizes the total amount of delayed or before time deliveries MULTIplied by respective durations, named "JIT distribution". Supplying the customer demand, holding and delivering products at warehouse are the most important constraints considered in this model. This model has been designed for a three-echelon DISTRIBUTION NETWORK consisting MULTIple suppliers, wholesalers and retailers to distribute MULTIple products with a deterministic amount of demand through either direct or indirect channels in a planning horizon. Since real-sized problems of the resulting bi-objective mixed-integer linear programming (MILP) cannot be solved with exact methods, a MULTI objective PARTICLE SWARM ALGORITHM (MOPSO) is designed of which, quality in small-sized problems is compared with the solutions obtained by the LINGO software. The computational results show that the proposed MOPSO algorithm finds good solutions in shorter times than LINGO and has acceptable running times in large-scale problems.

Cites

No record.

References

No record.

Cite

APA: Copy

ARAB, RAHMAT, TAVAKKOLI MOGHADDAM, REZA, & FORGHANI, MOHSEN. (2014). SOLVING A NEW MATHEMATICAL MODEL FOR SCHEDULING IN DISTRIBUTION NETWORKS BY MULTI-OBJECTIVE PARTICLE SWARM OPTIMIZATION. PRODUCTION AND OPERATIONS MANAGEMENT, 4(2 (7)), 95-112. SID. https://sid.ir/paper/217553/en

Vancouver: Copy

ARAB RAHMAT, TAVAKKOLI MOGHADDAM REZA, FORGHANI MOHSEN. SOLVING A NEW MATHEMATICAL MODEL FOR SCHEDULING IN DISTRIBUTION NETWORKS BY MULTI-OBJECTIVE PARTICLE SWARM OPTIMIZATION. PRODUCTION AND OPERATIONS MANAGEMENT[Internet]. 2014;4(2 (7)):95-112. Available from: https://sid.ir/paper/217553/en

IEEE: Copy

RAHMAT ARAB, REZA TAVAKKOLI MOGHADDAM, and MOHSEN FORGHANI, “SOLVING A NEW MATHEMATICAL MODEL FOR SCHEDULING IN DISTRIBUTION NETWORKS BY MULTI-OBJECTIVE PARTICLE SWARM OPTIMIZATION,” PRODUCTION AND OPERATIONS MANAGEMENT, vol. 4, no. 2 (7), pp. 95–112, 2014, [Online]. Available: https://sid.ir/paper/217553/en

Related Journal Papers