PARTICLE SWARM OPTIMIZATION FOR A BI-OBJECTIVE WEB-BASED CONVERGENT PRODUCT NETWORKS

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.

HASSANZADEH R.; MAHDAVI I.; MAHDAVI AMIRI N.

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

Journal Paper

Paper Information

Journal: JOURNAL OF INDUSTRIAL ENGINEERING AND MANAGEMENT STUDIES (JIEMS) Year:2015 | Volume:2 | Issue:1 Page(s): 41-60

Download Full-Text

View:

268

Download:

Cites:

Information Journal Paper

Title

PARTICLE SWARM OPTIMIZATION FOR A BI-OBJECTIVE WEB-BASED CONVERGENT PRODUCT NETWORKS

Author(s)

HASSANZADEH R. | MAHDAVI I. | MAHDAVI AMIRI N. | Issue Writer Certificate

Keywords

CONVERGENT PRODUCT

WEB

BASED (DIGITAL) NETWORK

OBJECTIVE PROGRAMMING

STEINER TREE

PARTICLE SWARM OPTIMIZATION (PSO)

Abstract

Here, a collection of base functions and sub-functions configure the nodes of a WEB-based (digital) network representing functionalities. Each arc in the network is to be assigned as the link between two nodes. The aim is to find an optimal tree of functionalities in the network adding value to the product in the WEB environment. First, a purification process is performed in the product network to assign the links among bases and sub-functions. Then, numerical values as benefits and costs are determined for arcs and nodes, respectively. To handle the BI-objective STEINER TREE, a particle swarm optimization algorithm is adapted to find the optimal tree determining the value adding sub-functions to bases in a CONVERGENT PRODUCT. An example is worked out to illustrate the applicability of the proposed approach.

Multimedia

No record.

Cites

No record.

References

No record.

Cite

APA: Copy

HASSANZADEH, R., MAHDAVI, I., & MAHDAVI AMIRI, N.. (2015). PARTICLE SWARM OPTIMIZATION FOR A BI-OBJECTIVE WEB-BASED CONVERGENT PRODUCT NETWORKS. JOURNAL OF INDUSTRIAL ENGINEERING AND MANAGEMENT STUDIES (JIEMS), 2(1), 41-60. SID. https://sid.ir/paper/345038/en

Vancouver: Copy

HASSANZADEH R., MAHDAVI I., MAHDAVI AMIRI N.. PARTICLE SWARM OPTIMIZATION FOR A BI-OBJECTIVE WEB-BASED CONVERGENT PRODUCT NETWORKS. JOURNAL OF INDUSTRIAL ENGINEERING AND MANAGEMENT STUDIES (JIEMS)[Internet]. 2015;2(1):41-60. Available from: https://sid.ir/paper/345038/en

IEEE: Copy

R. HASSANZADEH, I. MAHDAVI, and N. MAHDAVI AMIRI, “PARTICLE SWARM OPTIMIZATION FOR A BI-OBJECTIVE WEB-BASED CONVERGENT PRODUCT NETWORKS,” JOURNAL OF INDUSTRIAL ENGINEERING AND MANAGEMENT STUDIES (JIEMS), vol. 2, no. 1, pp. 41–60, 2015, [Online]. Available: https://sid.ir/paper/345038/en

Related Journal Papers

No record.

Related Seminar Papers

No record.

Related Plans

No record.

Recommended Workshops