SERVICE CENTERS LOCATION PROBLEM CONSIDERING SERVICE DIVERSITY 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.

PARTOVI F.; SEIFBARGHY M.

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

Journal Paper

Paper Information

Journal: Scientia Iranica Year:2015 | Volume:22 | Issue:3 (TRANSACTIONS E: INDUSTRIAL ENGINEERING) Page(s): 1103-1116

Download Full-Text

View:

402

Download:

361

Cites:

Information Journal Paper

Title

SERVICE CENTERS LOCATION PROBLEM CONSIDERING SERVICE DIVERSITY WITHIN QUEUING FRAMEWORK

Author(s)

PARTOVI F. | SEIFBARGHY M. | Issue Writer Certificate

Keywords

LOCATION

QUEUING SYSTEMS

SERVICE DIVERSITY

PARTICLE SWARM OPTIMIZATION

VARIABLE NEIGHBORHOOD SEARCH

Abstract

In this paper, a new model is developed considering diversity of service in service centers LOCATION problem. It is assumed that different services can be provided at each service center. The model has three objective functions including: minimizing the sum of customers travel time and waiting time in service centers, balancing service loads among the given centers, and minimizing the total establishment costs of service centers and assignment costs of servers. Different number of servers can be assigned to each service center. Regarding the alLOCATION of customers to the service centers, each customer patronizes with respect to the distance to the center, the attractiveness of each service center's site for the customer and the number of located servers at the service center. Since the proposed model is of nonlinear integer programming type and is of high complexity in solving, two meta-heuristic based heuristics using PARTICLE SWARM OPTIMIZATION (PSO) and VARIABLE NEIGHBORHOOD SEARCH (VNS) are proposed in order to solve the problem. Different sizes of numerical examples are designed and solved in order to compare the efficiency of the heuristics.

Cites

No record.

References

No record.

Cite

APA: Copy

PARTOVI, F., & SEIFBARGHY, M.. (2015). SERVICE CENTERS LOCATION PROBLEM CONSIDERING SERVICE DIVERSITY WITHIN QUEUING FRAMEWORK. SCIENTIA IRANICA, 22(3 (TRANSACTIONS E: INDUSTRIAL ENGINEERING)), 1103-1116. SID. https://sid.ir/paper/290326/en

Vancouver: Copy

PARTOVI F., SEIFBARGHY M.. SERVICE CENTERS LOCATION PROBLEM CONSIDERING SERVICE DIVERSITY WITHIN QUEUING FRAMEWORK. SCIENTIA IRANICA[Internet]. 2015;22(3 (TRANSACTIONS E: INDUSTRIAL ENGINEERING)):1103-1116. Available from: https://sid.ir/paper/290326/en

IEEE: Copy

F. PARTOVI, and M. SEIFBARGHY, “SERVICE CENTERS LOCATION PROBLEM CONSIDERING SERVICE DIVERSITY WITHIN QUEUING FRAMEWORK,” SCIENTIA IRANICA, vol. 22, no. 3 (TRANSACTIONS E: INDUSTRIAL ENGINEERING), pp. 1103–1116, 2015, [Online]. Available: https://sid.ir/paper/290326/en

Related Journal Papers

No record.

Related Seminar Papers

No record.

Related Plans

No record.

Recommended Workshops