A NEW MODEL FOR LOCATION-ALLOCATION PROBLEM WITHIN QUEUING FRAMEWORK

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.

PASANDIDEH SEYED HAMID REZA; CHAMBARI AMIRHOSSAIN

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

Journal Paper

Paper Information

Journal: JOURNAL OF OPTIMIZATION IN INDUSTRIAL ENGINEERING (JOURNAL OF INDUSTRIAL ENGINEERING) Year:2010 | Volume:4 | Issue:NO. 6 Page(s): 53-61

Download Full-Text

View:

388

Download:

118

Cites:

Information Journal Paper

Title

A NEW MODEL FOR LOCATION-ALLOCATION PROBLEM WITHIN QUEUING FRAMEWORK

Author(s)

PASANDIDEH SEYED HAMID REZA | CHAMBARI AMIRHOSSAIN | Issue Writer Certificate

Keywords

QUEUEING

LOCATION

BI-OBJECTIVE

NSGA-II

NRGA

Abstract

This paper proposes a BI-OBJECTIVE model for the facility LOCATION problem under a congestion system. The idea of the model is motivated by applications of locating servers in bank automated teller machines (ATMS), communication networks, and so on. This model can be specifically considered for situations in which fixed service facilities are congested by stochastic demand within QUEUEING framework. We formulate this model with two perspectives simultaneously: (i) customers and (ii) service provider. The objectives of the model are to minimize (i) the total expected travelling and waiting time and (ii) the average facility idle-time. This model represents a mixed-integer nonlinear programming problem which belongs to the class of NP-hard problems. In addition, to solve the model, two metaheuristic algorithms including non-dominated sorting genetic algorithms (NSGA-II) and non-dominated ranking genetic algorithms (NRGA) are proposed. Besides, to evaluate the performance of the two algorithms some numerical examples are produced and analyzed with some metrics to determine which algorithm works better.

Cites

A SIMULATED ANNEALING ALGORITHM WITHIN THE VARIABLE NEIGHBOURHOOD SEARCH FRAMEWORK TO SOLVE THE CAPACITATED FACILITY LOCATION-ALLOCATION PROBLEM

References

Cite

APA: Copy

PASANDIDEH, SEYED HAMID REZA, & CHAMBARI, AMIRHOSSAIN. (2010). A NEW MODEL FOR LOCATION-ALLOCATION PROBLEM WITHIN QUEUING FRAMEWORK. JOURNAL OF OPTIMIZATION IN INDUSTRIAL ENGINEERING (JOURNAL OF INDUSTRIAL ENGINEERING), 4(NO. 6), 53-61. SID. https://sid.ir/paper/605691/en

Vancouver: Copy

PASANDIDEH SEYED HAMID REZA, CHAMBARI AMIRHOSSAIN. A NEW MODEL FOR LOCATION-ALLOCATION PROBLEM WITHIN QUEUING FRAMEWORK. JOURNAL OF OPTIMIZATION IN INDUSTRIAL ENGINEERING (JOURNAL OF INDUSTRIAL ENGINEERING)[Internet]. 2010;4(NO. 6):53-61. Available from: https://sid.ir/paper/605691/en

IEEE: Copy

SEYED HAMID REZA PASANDIDEH, and AMIRHOSSAIN CHAMBARI, “A NEW MODEL FOR LOCATION-ALLOCATION PROBLEM WITHIN QUEUING FRAMEWORK,” JOURNAL OF OPTIMIZATION IN INDUSTRIAL ENGINEERING (JOURNAL OF INDUSTRIAL ENGINEERING), vol. 4, no. NO. 6, pp. 53–61, 2010, [Online]. Available: https://sid.ir/paper/605691/en

Related Journal Papers

No record.

Related Seminar Papers

No record.

Related Plans

No record.

Recommended Workshops