A NEW SOLUTION FOR THE CYCLIC MULTIPLE-PART TYPE THREE-MACHINE ROBOTIC CELL PROBLEM BASED ON THE PARTICLE SWARM META-HEURISTIC

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.

KAMAL ABADI N.; GHOLAMI S.; MIRZAEI A.H.

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

Journal Paper

Paper Information

Journal: Journal of Industrial and Systems Engineering Year:2008 | Volume:1 | Issue:4 Page(s): 304-317

Download Full-Text

View:

320

Download:

Cites:

Information Journal Paper

Title

A NEW SOLUTION FOR THE CYCLIC MULTIPLE-PART TYPE THREE-MACHINE ROBOTIC CELL PROBLEM BASED ON THE PARTICLE SWARM META-HEURISTIC

Author(s)

KAMAL ABADI N. | GHOLAMI S. | MIRZAEI A.H. | Issue Writer Certificate

Keywords

CYCLIC BLOCKING FLOW-SHOP

PARTICLE SWARM OPTIMISATION

ROBOTIC CELL

SCHEDULING

Abstract

In this paper, we develop a new mathematical model for a cyclic multiple-part type three machine ROBOTIC CELL problem. In this ROBOTIC CELL a robot is used for material handling. The objective is finding a part sequence to minimize the cycle time (i.e.; maximize the throughput) with assumption of known robot movement. The developed model is based on Petri nets and provides a new method to calculate cycle times by considering waiting times. It is proved that SCHEDULING problem of a ROBOTIC CELL is unary NP-complete. Achieving an optimal solution for this type of complex, large-sized problem in reasonable computational time by using traditional approaches and optimization tools is extremely difficult. In this paper we implement an algorithm based on the particle swarm optimization (PSO) method for solving the problem. To validate the developed model and solution algorithm, various test problems are examined some of which are of small-size and some other of large-size. The computational results show that the proposed algorithm achieves optimum solutions for small sized problems, while for large-sized problems this algorithm can find suitable solutions in acceptable time.

Cites

No record.

References

No record.

Cite

APA: Copy

KAMAL ABADI, N., GHOLAMI, S., & MIRZAEI, A.H.. (2008). A NEW SOLUTION FOR THE CYCLIC MULTIPLE-PART TYPE THREE-MACHINE ROBOTIC CELL PROBLEM BASED ON THE PARTICLE SWARM META-HEURISTIC. JOURNAL OF INDUSTRIAL AND SYSTEMS ENGINEERING (JISE), 1(4), 304-317. SID. https://sid.ir/paper/307059/en

Vancouver: Copy

KAMAL ABADI N., GHOLAMI S., MIRZAEI A.H.. A NEW SOLUTION FOR THE CYCLIC MULTIPLE-PART TYPE THREE-MACHINE ROBOTIC CELL PROBLEM BASED ON THE PARTICLE SWARM META-HEURISTIC. JOURNAL OF INDUSTRIAL AND SYSTEMS ENGINEERING (JISE)[Internet]. 2008;1(4):304-317. Available from: https://sid.ir/paper/307059/en

IEEE: Copy

N. KAMAL ABADI, S. GHOLAMI, and A.H. MIRZAEI, “A NEW SOLUTION FOR THE CYCLIC MULTIPLE-PART TYPE THREE-MACHINE ROBOTIC CELL PROBLEM BASED ON THE PARTICLE SWARM META-HEURISTIC,” JOURNAL OF INDUSTRIAL AND SYSTEMS ENGINEERING (JISE), vol. 1, no. 4, pp. 304–317, 2008, [Online]. Available: https://sid.ir/paper/307059/en

Related Journal Papers

No record.

Related Seminar Papers

No record.

Related Plans

No record.

Recommended Workshops