SOLVING MULTI-OBJECTIVE LOCATION-ALLOCATION PROBLEMS USING SIMULATED ANNEALING

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.

TAGHAVIFARD MOHAMMAD TAGHI; SHAHSAVARI ARIAN

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

Journal Paper

Paper Information

Journal: INTERNATIONAL JOURNAL OF INDUSTRIAL ENGINEERING AND PRODUCTION MANAGEMENT (IJIE) (INTERNATIONAL JOURNAL OF ENGINEERING SCIENCE) (PERSIAN) Year:2009 | Volume:19 | Issue:4 Page(s): 93-105

Download Full-Text

Persian Verion

View:

1,673

Download:

Cites:

Information Journal Paper

Title

SOLVING MULTI-OBJECTIVE LOCATION-ALLOCATION PROBLEMS USING SIMULATED ANNEALING

Author(s)

TAGHAVIFARD MOHAMMAD TAGHI | SHAHSAVARI ARIAN | Issue Writer Certificate

Keywords

Not Registered.

Abstract

In this paper, multi-objective set covering problems (MOSCP) as one of the location-allocation models are being considered. Here, the objective is to minimize the cost of locating facilities and at the same time to maximize demand satisfaction in a defined structure so that each customer or zone is being covered by at least one facility. Since the problem falls into NP-hard category from the complexity point of view, it cannot be solved in a reasonable computational time period by an exact algorithm. For this reason, a Simulated Annealing (SA) algorithm is proposed to solve MOSCP. The algorithm is a meta-heuristic approach coupled with a neighborhood search technique.The validity and quality of the proposed method is tested by solving benchmark problems and the results obtained were quite satisfactory.

Cites

References

No record.

Cite

APA: Copy

TAGHAVIFARD, MOHAMMAD TAGHI, & SHAHSAVARI, ARIAN. (2009). SOLVING MULTI-OBJECTIVE LOCATION-ALLOCATION PROBLEMS USING SIMULATED ANNEALING. INTERNATIONAL JOURNAL OF INDUSTRIAL ENGINEERING AND PRODUCTION MANAGEMENT (IJIE) (INTERNATIONAL JOURNAL OF ENGINEERING SCIENCE) (PERSIAN), 19(4), 93-105. SID. https://sid.ir/paper/65910/en

Vancouver: Copy

TAGHAVIFARD MOHAMMAD TAGHI, SHAHSAVARI ARIAN. SOLVING MULTI-OBJECTIVE LOCATION-ALLOCATION PROBLEMS USING SIMULATED ANNEALING. INTERNATIONAL JOURNAL OF INDUSTRIAL ENGINEERING AND PRODUCTION MANAGEMENT (IJIE) (INTERNATIONAL JOURNAL OF ENGINEERING SCIENCE) (PERSIAN)[Internet]. 2009;19(4):93-105. Available from: https://sid.ir/paper/65910/en

IEEE: Copy

MOHAMMAD TAGHI TAGHAVIFARD, and ARIAN SHAHSAVARI, “SOLVING MULTI-OBJECTIVE LOCATION-ALLOCATION PROBLEMS USING SIMULATED ANNEALING,” INTERNATIONAL JOURNAL OF INDUSTRIAL ENGINEERING AND PRODUCTION MANAGEMENT (IJIE) (INTERNATIONAL JOURNAL OF ENGINEERING SCIENCE) (PERSIAN), vol. 19, no. 4, pp. 93–105, 2009, [Online]. Available: https://sid.ir/paper/65910/en

Related Journal Papers