EFFICIENT SOLUTION PROCEDURE TO DEVELOP MAXIMAL COVERING LOCATION PROBLEM UNDER UNCERTAINTY (USING GA AND SIMULATION)

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.

SHAHANAGHI K.; GHEZAVATI V.R.

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

Journal Paper

Paper Information

Journal: International Journal of Industrial Engineering & Production Research Year:2008 | Volume:19 | Issue:4 Page(s): 21-29

Download Full-Text

View:

403

Download:

189

Cites:

Information Journal Paper

Title

EFFICIENT SOLUTION PROCEDURE TO DEVELOP MAXIMAL COVERING LOCATION PROBLEM UNDER UNCERTAINTY (USING GA AND SIMULATION)

Author(s)

SHAHANAGHI K. | GHEZAVATI V.R. | Issue Writer Certificate

Keywords

MAXIMAL COVERING

LOCATION

GENETIC ALGORITHM

SIMULATION

UNCERTAINTY MODELING

Abstract

In this paper, we present the stochastic version of MAXIMAL COVERING LOCATION Problem which optimizes both LOCATION and allocation decisions, concurrently. It’s assumed that traveling time between customers and distribution centers (DCs) is uncertain and described by normal distribution function and if this time is less than coverage time, the customer can be allocated to DC. In classical models, traveling time between customers and facilities is assumed to be in a deterministic way and a customer is assumed to be covered completely if located within the critical coverage of the facility and not covered at all outside of the critical coverage. Indeed, solutions obtained are so sensitive to the determined traveling time. Therefore, we consider covering or not covering for customers in a probabilistic way and not certain which yields more flexibility and practicability for results and model. Considering this assumption, we maximize the total expected demand which is covered. To solve such a stochastic nonlinear model efficiently, SIMULATION and GENETIC ALGORITHM are integrated to produce a hybrid intelligent algorithm. Finally, some numerical examples are presented to illustrate the effectiveness of the proposed algorithm.

Cites

No record.

References

No record.

Cite

APA: Copy

SHAHANAGHI, K., & GHEZAVATI, V.R.. (2008). EFFICIENT SOLUTION PROCEDURE TO DEVELOP MAXIMAL COVERING LOCATION PROBLEM UNDER UNCERTAINTY (USING GA AND SIMULATION). INTERNATIONAL JOURNAL OF INDUSTRIAL ENGINEERING AND PRODUCTION RESEARCH (IJIE) (ENGLISH), 19(4), 21-29. SID. https://sid.ir/paper/549934/en

Vancouver: Copy

SHAHANAGHI K., GHEZAVATI V.R.. EFFICIENT SOLUTION PROCEDURE TO DEVELOP MAXIMAL COVERING LOCATION PROBLEM UNDER UNCERTAINTY (USING GA AND SIMULATION). INTERNATIONAL JOURNAL OF INDUSTRIAL ENGINEERING AND PRODUCTION RESEARCH (IJIE) (ENGLISH)[Internet]. 2008;19(4):21-29. Available from: https://sid.ir/paper/549934/en

IEEE: Copy

K. SHAHANAGHI, and V.R. GHEZAVATI, “EFFICIENT SOLUTION PROCEDURE TO DEVELOP MAXIMAL COVERING LOCATION PROBLEM UNDER UNCERTAINTY (USING GA AND SIMULATION),” INTERNATIONAL JOURNAL OF INDUSTRIAL ENGINEERING AND PRODUCTION RESEARCH (IJIE) (ENGLISH), vol. 19, no. 4, pp. 21–29, 2008, [Online]. Available: https://sid.ir/paper/549934/en

Related Journal Papers

No record.

Related Seminar Papers

No record.

Related Plans

No record.

Recommended Workshops