GENETIC AND IMPROVED SHUFFLED FROG LEAPING ALGORITHMS FOR A 2-STAGE MODEL OF A HUB COVERING LOCATION NETWORK

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.

MOHAMMADI M.; TAVAKKOLI MOGHADDAM R.; GHODRATNAMA A.; ROSTAMI H.

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

Journal Paper

Paper Information

Journal: International Journal of Industrial Engineering & Production Research Year:2011 | Volume:22 | Issue:3 Page(s): 171-179

Download Full-Text

View:

370

Download:

161

Cites:

Information Journal Paper

Title

GENETIC AND IMPROVED SHUFFLED FROG LEAPING ALGORITHMS FOR A 2-STAGE MODEL OF A HUB COVERING LOCATION NETWORK

Author(s)

MOHAMMADI M. | TAVAKKOLI MOGHADDAM R. | GHODRATNAMA A. | ROSTAMI H. | Issue Writer Certificate

Keywords

HUB COVERING LOCATION PROBLEM

NETWORK DESIGN

SINGLE MACHINE SCHEDULING

GENETIC ALGORITHM

SHUFFLED FROG LEAPING ALGORITHM

Abstract

Hub location problems (HLP) are synthetic optimization problems that appears in telecommunication and transportation networks where nodes send and receive commodities (i.e., data transmissions, passengers transportation, express packages, postal deliveries, etc.) through special facilities or transshipment points called hubs. In this paper, we consider a central mine and a number of hubs (e.g., factories) connected to a number of nodes (e.g., shops or customers) in a network. First, the hub network is designed, then, a raw materials transportation from a central mine to the hubs (i.e., factories) is scheduled. In this case, we consider only one transportation system regarded as SINGLE MACHINE SCHEDULING. Furthermore, we use this hub network to solve the scheduling model. In this paper, we consider the capacitated single allocation HUB COVERING LOCATION PROBLEM (CSAHCLP) and then present the mixed-integer programming (MIP) model. Due to the computational complexity of the resulted models, we also propose two improved meta-heuristic algorithms, namely a GENETIC ALGORITHM and a SHUFFLED FROG LEAPING ALGORITHM in order to find a near-optimal solution of the given problem. The performance of the solutions found by the foregoing proposed algorithms is compared with exact solutions of the mathematical programming model.

Multimedia

No record.

Cites

No record.

References

No record.

Cite

APA: Copy

MOHAMMADI, M., TAVAKKOLI MOGHADDAM, R., GHODRATNAMA, A., & ROSTAMI, H.. (2011). GENETIC AND IMPROVED SHUFFLED FROG LEAPING ALGORITHMS FOR A 2-STAGE MODEL OF A HUB COVERING LOCATION NETWORK. INTERNATIONAL JOURNAL OF INDUSTRIAL ENGINEERING AND PRODUCTION RESEARCH (IJIE) (ENGLISH), 22(3), 171-179. SID. https://sid.ir/paper/573892/en

Vancouver: Copy

MOHAMMADI M., TAVAKKOLI MOGHADDAM R., GHODRATNAMA A., ROSTAMI H.. GENETIC AND IMPROVED SHUFFLED FROG LEAPING ALGORITHMS FOR A 2-STAGE MODEL OF A HUB COVERING LOCATION NETWORK. INTERNATIONAL JOURNAL OF INDUSTRIAL ENGINEERING AND PRODUCTION RESEARCH (IJIE) (ENGLISH)[Internet]. 2011;22(3):171-179. Available from: https://sid.ir/paper/573892/en

IEEE: Copy

M. MOHAMMADI, R. TAVAKKOLI MOGHADDAM, A. GHODRATNAMA, and H. ROSTAMI, “GENETIC AND IMPROVED SHUFFLED FROG LEAPING ALGORITHMS FOR A 2-STAGE MODEL OF A HUB COVERING LOCATION NETWORK,” INTERNATIONAL JOURNAL OF INDUSTRIAL ENGINEERING AND PRODUCTION RESEARCH (IJIE) (ENGLISH), vol. 22, no. 3, pp. 171–179, 2011, [Online]. Available: https://sid.ir/paper/573892/en

Related Journal Papers

No record.

Related Seminar Papers

No record.

Related Plans

No record.

Recommended Workshops