Optimizing the Multi-Level Location-Assignment Problem in Queue Networks Using a Multi-Objective Optimization Approach

Using hubs in distribution networks is an efficient approach. In this paper, a model for the location-allocation problem is designed within the framework of the queuing network in which services have several levels, and customers must go through these levels to complete the service. The purpose of t...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Foundations of computing and decision sciences Ročník 47; číslo 2; s. 177 - 192
Hlavní autoři: Syah, Rahmad, Elveny, Marischa, Soerjati, Enni, Guerrero, John William Grimaldo, Jowad, Rawya Read, Suksatan, Wanich, Aravindhan, Surendar, Voronkova, Olga Yuryevna, Mavaluru, Dinesh
Médium: Journal Article
Jazyk:angličtina
Vydáno: Poznan Sciendo 01.06.2022
De Gruyter Brill Sp. z o.o., Paradigm Publishing Services
Témata:
Hub
Integer programming
Location-Assignment
Multi-Objective Optimization
Multilevel Services
Queue Theory
Reinforced Epsilon Constraint Method
ISSN:2300-3405, 0867-6356, 2300-3405
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Abstract Using hubs in distribution networks is an efficient approach. In this paper, a model for the location-allocation problem is designed within the framework of the queuing network in which services have several levels, and customers must go through these levels to complete the service. The purpose of the model is to locate an appropriate number of facilities among potential locations and allocate customers. The model is presented as a multi-objective nonlinear mixed-integer programming model. The objective functions include the summation of the customer and the waiting time in the system and the waiting time in the system and minimizing the maximum possibility of unemployment in the facility. To solve the model, the technique of accurate solution of the epsilon constraint method is used for multi-objective optimization, and Pareto solutions of the problem will be calculated. Moreover, the sensitivity analysis of the problem is performed, and the results demonstrate sensitivity to customer demand rate. Based on the results obtained, it can be concluded that the proposed model is able to greatly summate the customer and the waiting time in the system and reduce the maximum probability of unemployment at several levels of all facilities. The model can also be further developed by choosing vehicles for each customer.
AbstractList Using hubs in distribution networks is an efficient approach. In this paper, a model for the location-allocation problem is designed within the framework of the queuing network in which services have several levels, and customers must go through these levels to complete the service. The purpose of the model is to locate an appropriate number of facilities among potential locations and allocate customers. The model is presented as a multi-objective nonlinear mixed-integer programming model. The objective functions include the summation of the customer and the waiting time in the system and the waiting time in the system and minimizing the maximum possibility of unemployment in the facility. To solve the model, the technique of accurate solution of the epsilon constraint method is used for multi-objective optimization, and Pareto solutions of the problem will be calculated. Moreover, the sensitivity analysis of the problem is performed, and the results demonstrate sensitivity to customer demand rate. Based on the results obtained, it can be concluded that the proposed model is able to greatly summate the customer and the waiting time in the system and reduce the maximum probability of unemployment at several levels of all facilities. The model can also be further developed by choosing vehicles for each customer.
Author Soerjati, Enni
Suksatan, Wanich
Mavaluru, Dinesh
Aravindhan, Surendar
Voronkova, Olga Yuryevna
Syah, Rahmad
Guerrero, John William Grimaldo
Elveny, Marischa
Jowad, Rawya Read
Author_xml – sequence: 1
  givenname: Rahmad
  surname: Syah
  fullname: Syah, Rahmad
  email: bayurahmadsyah45@gmail.com
  organization: DS & CI Research Group. Universitas Medan Area. Medan. Indonesia; Kolam/Gedung PBSI No.1. 20223
– sequence: 2
  givenname: Marischa
  surname: Elveny
  fullname: Elveny, Marischa
  email: marischaelveny@usu.ac.id
  organization: DS & CI Research Group, Universitas Sumatera Utara, Medan, Indonesia; Dr. Mansur Road No.9. Kampus USU. 20155. Indonesia
– sequence: 3
  givenname: Enni
  surname: Soerjati
  fullname: Soerjati, Enni
  email: enni@unpad.ac.id
  organization: Department Information Technology Communication and Intellectual Property. Faculty of Law, Universitas Padjadjaran, Jatinangor, Sumedang 45363, Jawa Barat, Indonesia
– sequence: 4
  givenname: John William Grimaldo
  orcidid: 0000-0002-1632-5374
  surname: Guerrero
  fullname: Guerrero, John William Grimaldo
  email: jgrimald1@cuc.edu.co
  organization: Departamento de Energía, Universidad de la Costa, Colombia, Barranquilla
– sequence: 5
  givenname: Rawya Read
  surname: Jowad
  fullname: Jowad, Rawya Read
  organization: Radiology department, Hilla university college, Babylon, Iraq
– sequence: 6
  givenname: Wanich
  orcidid: 0000-0003-1797-1260
  surname: Suksatan
  fullname: Suksatan, Wanich
  email: wanich.suk@pccms.ac.th
  organization: M.Sc., RN Faculty of Nursing, HRH Princess Chulabhorn College of Medical Science, Chulabhorn Royal Academy, Bangkok, 10210, Thailand
– sequence: 7
  givenname: Surendar
  surname: Aravindhan
  fullname: Aravindhan, Surendar
  email: surendararavindhan@ieee.org
  organization: Assistant Professor, Department of Pharmacology, Saveetha dental College and hospital, Saveetha institute of medical and technical sciences, Chennai, India
– sequence: 8
  givenname: Olga Yuryevna
  orcidid: 0000-0002-3106-4643
  surname: Voronkova
  fullname: Voronkova, Olga Yuryevna
  email: olka2004@yandex.ru
  organization: Altai State University, Lenin Ave., 61, 656049, Barnaul, Russian Federation, Doctor of Economics, Professor of management, business organization and innovation Department
– sequence: 9
  givenname: Dinesh
  surname: Mavaluru
  fullname: Mavaluru, Dinesh
  email: d.mavaluru@seu.edu.sa
  organization: Department of Information Technology, College of Computing and Informatics, Saudi Electronic University, Saudi Arabia
BookMark eNp1kc1rGzEQxUVJoGmaa8-CnjfR167W0IsJ_Qi4dQvNWYy0s47c9cqVtA7JX99d26WhJLpoJOb95g3vDTnpQ4-EvOPsUihdX7WuSYVgQhSMcfaKnAnJWCEVK0-e1K_JRUprNp7Z-Kr5Gdktt9lv_KPvVzTfIf06dNkXC9xhRxfBQfahL-Yp-VW_wT7T7zHYDjfU9_THgAPSb5jvQ_yV6G2aGHAkLO0aXfY7pMcBexKdb7cxgLt7S05b6BJeHO9zcvvp48_rL8Vi-fnmer4onBJVLmBWtY2qaoeNUDOrwFotbVlLXtZMV8g1lKCdtU5zKGe6slxayRnUZWMVA3lObg7cJsDabKPfQHwwAbzZf4S4MhCzdx0aKyqlFWvb0lrFZQPMuqpWrlHSWcByZL0_sMYVfg-YslmHIfajfTP6qTRjpZi61KHLxZBSxNY4n_fL5wi-M5yZKTAzBWamwMwU2Ci7_E_21-yLgg8HwT10GWODqzg8jMU_U88LlRZca_kHG22vZg
CitedBy_id crossref_primary_10_2478_fcds_2022_0005
crossref_primary_10_1002_adc2_187
Cites_doi 10.1016/j.matcom.2020.07.022
10.1007/s10479-008-0341-2
10.1016/j.cie.2019.07.018
10.1016/0305-0548(74)90076-8
10.1007/s10479-021-04191-0
10.1016/j.ejor.2003.11.032
10.1007/s10845-010-0416-1
10.1016/j.amc.2009.03.037
10.1287/opre.11.3.331
10.1016/j.cor.2006.10.019
10.1016/j.apm.2020.07.019
10.1016/j.cie.2021.107589
10.1109/TCSVT.2020.3047859
10.1016/j.asoc.2012.12.016
10.1080/19488300.2014.965394
10.1016/S0377-2217(98)00186-6
10.1007/s10845-011-0592-7
10.1016/j.jclepro.2020.123199
10.24200/jmas.vol3iss02pp61-67
10.1111/j.1538-4632.1990.tb00210.x
10.1201/9781420066272
10.1016/j.asoc.2011.02.022
10.1016/S0377-2217(00)00314-3
10.1007/s11116-020-10117-9
10.1088/1742-6596/1486/2/022046
10.1016/j.apm.2015.12.013
10.1057/sj/jors/2601250
10.1080/0305215X.2016.1163630
10.1016/j.apenergy.2021.116746
ContentType Journal Article
Copyright 2022. This work is published under http://creativecommons.org/licenses/by-nc-nd/3.0 (the “License”). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License.
Copyright_xml – notice: 2022. This work is published under http://creativecommons.org/licenses/by-nc-nd/3.0 (the “License”). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License.
DBID AAYXX
CITATION
ABUWG
AFKRA
AZQEC
BENPR
CCPQU
DWQXO
PHGZM
PHGZT
PIMPY
PKEHL
PQEST
PQQKQ
PQUKI
PRINS
DOA
DOI 10.2478/fcds-2022-0010
DatabaseName CrossRef
ProQuest Central (Alumni)
ProQuest Central UK/Ireland
ProQuest Central Essentials
ProQuest Central
ProQuest One Community College
ProQuest Central
ProQuest Central Premium
ProQuest One Academic
Publicly Available Content Database
ProQuest One Academic Middle East (New)
ProQuest One Academic Eastern Edition (DO NOT USE)
ProQuest One Academic (retired)
ProQuest One Academic UKI Edition
ProQuest Central China
DOAJ Directory of Open Access Journals
DatabaseTitle CrossRef
Publicly Available Content Database
ProQuest One Academic Middle East (New)
ProQuest Central Essentials
ProQuest One Academic Eastern Edition
ProQuest Central (Alumni Edition)
ProQuest One Community College
ProQuest Central China
ProQuest Central
ProQuest One Academic UKI Edition
ProQuest Central Korea
ProQuest Central (New)
ProQuest One Academic
ProQuest One Academic (New)
DatabaseTitleList Publicly Available Content Database


CrossRef
Database_xml – sequence: 1
  dbid: DOA
  name: DOAJ Directory of Open Access Journals
  url: https://www.doaj.org/
  sourceTypes: Open Website
– sequence: 2
  dbid: PIMPY
  name: Publicly Available Content Database
  url: http://search.proquest.com/publiccontent
  sourceTypes: Aggregation Database
DeliveryMethod fulltext_linktorsrc
Discipline Engineering
EISSN 2300-3405
EndPage 192
ExternalDocumentID oai_doaj_org_article_b264740ff5bb413da0bc684cd43cbae5
10_2478_fcds_2022_0010
10_2478_fcds_2022_0010472177
GroupedDBID 0R~
4.4
5VS
9WM
AATOW
ABFKT
ACGFS
ADBBV
ADBLJ
AFFHD
AFKRA
AHGSO
ALMA_UNASSIGNED_HOLDINGS
BCNDV
BENPR
CCPQU
E0C
EBS
GROUPED_DOAJ
HZ~
KQ8
O9-
OK1
PHGZM
PHGZT
PIMPY
QD8
SA.
SLJYH
Y2W
AAYXX
CITATION
ABUWG
AZQEC
DWQXO
PKEHL
PQEST
PQQKQ
PQUKI
PRINS
ID FETCH-LOGICAL-c426t-a96fd468ced249b4abb73b583158076e17a5a7cbbc71a5976b13b310a85db40a3
IEDL.DBID BENPR
ISICitedReferencesCount 1
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000824850900006&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN 2300-3405
0867-6356
IngestDate Fri Oct 03 12:53:44 EDT 2025
Sun Oct 19 01:39:26 EDT 2025
Tue Nov 18 21:57:42 EST 2025
Sat Nov 29 01:44:19 EST 2025
Sat Nov 29 01:29:49 EST 2025
IsDoiOpenAccess true
IsOpenAccess true
IsPeerReviewed true
IsScholarly true
Issue 2
Language English
License This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 3.0 License.
http://creativecommons.org/licenses/by-nc-nd/3.0
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-c426t-a96fd468ced249b4abb73b583158076e17a5a7cbbc71a5976b13b310a85db40a3
Notes ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ORCID 0000-0002-3106-4643
0000-0002-1632-5374
0000-0003-1797-1260
OpenAccessLink https://www.proquest.com/docview/3156700525?pq-origsite=%requestingapplication%
PQID 3156700525
PQPubID 6775582
PageCount 16
ParticipantIDs doaj_primary_oai_doaj_org_article_b264740ff5bb413da0bc684cd43cbae5
proquest_journals_3156700525
crossref_citationtrail_10_2478_fcds_2022_0010
crossref_primary_10_2478_fcds_2022_0010
walterdegruyter_journals_10_2478_fcds_2022_0010472177
PublicationCentury 2000
PublicationDate 2022-06-01
PublicationDateYYYYMMDD 2022-06-01
PublicationDate_xml – month: 06
  year: 2022
  text: 2022-06-01
  day: 01
PublicationDecade 2020
PublicationPlace Poznan
PublicationPlace_xml – name: Poznan
PublicationTitle Foundations of computing and decision sciences
PublicationYear 2022
Publisher Sciendo
De Gruyter Brill Sp. z o.o., Paradigm Publishing Services
Publisher_xml – name: Sciendo
– name: De Gruyter Brill Sp. z o.o., Paradigm Publishing Services
References 2024042811020442517_j_fcds-2022-0010_ref_008
2024042811020442517_j_fcds-2022-0010_ref_007
2024042811020442517_j_fcds-2022-0010_ref_029
2024042811020442517_j_fcds-2022-0010_ref_009
2024042811020442517_j_fcds-2022-0010_ref_011
2024042811020442517_j_fcds-2022-0010_ref_033
2024042811020442517_j_fcds-2022-0010_ref_010
2024042811020442517_j_fcds-2022-0010_ref_032
2024042811020442517_j_fcds-2022-0010_ref_013
2024042811020442517_j_fcds-2022-0010_ref_035
2024042811020442517_j_fcds-2022-0010_ref_012
2024042811020442517_j_fcds-2022-0010_ref_034
2024042811020442517_j_fcds-2022-0010_ref_015
2024042811020442517_j_fcds-2022-0010_ref_014
2024042811020442517_j_fcds-2022-0010_ref_036
2024042811020442517_j_fcds-2022-0010_ref_017
2024042811020442517_j_fcds-2022-0010_ref_016
2024042811020442517_j_fcds-2022-0010_ref_031
2024042811020442517_j_fcds-2022-0010_ref_030
2024042811020442517_j_fcds-2022-0010_ref_019
2024042811020442517_j_fcds-2022-0010_ref_018
2024042811020442517_j_fcds-2022-0010_ref_022
2024042811020442517_j_fcds-2022-0010_ref_021
2024042811020442517_j_fcds-2022-0010_ref_002
2024042811020442517_j_fcds-2022-0010_ref_024
2024042811020442517_j_fcds-2022-0010_ref_001
2024042811020442517_j_fcds-2022-0010_ref_023
2024042811020442517_j_fcds-2022-0010_ref_004
2024042811020442517_j_fcds-2022-0010_ref_026
2024042811020442517_j_fcds-2022-0010_ref_003
2024042811020442517_j_fcds-2022-0010_ref_025
2024042811020442517_j_fcds-2022-0010_ref_006
2024042811020442517_j_fcds-2022-0010_ref_028
2024042811020442517_j_fcds-2022-0010_ref_005
2024042811020442517_j_fcds-2022-0010_ref_027
2024042811020442517_j_fcds-2022-0010_ref_020
References_xml – ident: 2024042811020442517_j_fcds-2022-0010_ref_035
  doi: 10.1016/j.matcom.2020.07.022
– ident: 2024042811020442517_j_fcds-2022-0010_ref_004
  doi: 10.1007/s10479-008-0341-2
– ident: 2024042811020442517_j_fcds-2022-0010_ref_002
  doi: 10.1016/j.cie.2019.07.018
– ident: 2024042811020442517_j_fcds-2022-0010_ref_015
  doi: 10.1016/0305-0548(74)90076-8
– ident: 2024042811020442517_j_fcds-2022-0010_ref_036
  doi: 10.1007/s10479-021-04191-0
– ident: 2024042811020442517_j_fcds-2022-0010_ref_024
  doi: 10.1016/j.ejor.2003.11.032
– ident: 2024042811020442517_j_fcds-2022-0010_ref_020
  doi: 10.1007/s10845-010-0416-1
– ident: 2024042811020442517_j_fcds-2022-0010_ref_017
  doi: 10.1016/j.amc.2009.03.037
– ident: 2024042811020442517_j_fcds-2022-0010_ref_008
  doi: 10.1287/opre.11.3.331
– ident: 2024042811020442517_j_fcds-2022-0010_ref_025
  doi: 10.1016/j.cor.2006.10.019
– ident: 2024042811020442517_j_fcds-2022-0010_ref_031
  doi: 10.1016/j.apm.2020.07.019
– ident: 2024042811020442517_j_fcds-2022-0010_ref_033
  doi: 10.1016/j.cie.2021.107589
– ident: 2024042811020442517_j_fcds-2022-0010_ref_027
– ident: 2024042811020442517_j_fcds-2022-0010_ref_029
– ident: 2024042811020442517_j_fcds-2022-0010_ref_003
  doi: 10.1109/TCSVT.2020.3047859
– ident: 2024042811020442517_j_fcds-2022-0010_ref_023
  doi: 10.1016/j.asoc.2012.12.016
– ident: 2024042811020442517_j_fcds-2022-0010_ref_006
  doi: 10.1080/19488300.2014.965394
– ident: 2024042811020442517_j_fcds-2022-0010_ref_019
  doi: 10.1016/S0377-2217(98)00186-6
– ident: 2024042811020442517_j_fcds-2022-0010_ref_022
– ident: 2024042811020442517_j_fcds-2022-0010_ref_018
– ident: 2024042811020442517_j_fcds-2022-0010_ref_021
  doi: 10.1007/s10845-011-0592-7
– ident: 2024042811020442517_j_fcds-2022-0010_ref_030
  doi: 10.1016/j.jclepro.2020.123199
– ident: 2024042811020442517_j_fcds-2022-0010_ref_028
  doi: 10.24200/jmas.vol3iss02pp61-67
– ident: 2024042811020442517_j_fcds-2022-0010_ref_014
  doi: 10.1111/j.1538-4632.1990.tb00210.x
– ident: 2024042811020442517_j_fcds-2022-0010_ref_013
  doi: 10.1201/9781420066272
– ident: 2024042811020442517_j_fcds-2022-0010_ref_005
  doi: 10.1016/j.asoc.2011.02.022
– ident: 2024042811020442517_j_fcds-2022-0010_ref_016
  doi: 10.1016/S0377-2217(00)00314-3
– ident: 2024042811020442517_j_fcds-2022-0010_ref_007
– ident: 2024042811020442517_j_fcds-2022-0010_ref_034
  doi: 10.1007/s11116-020-10117-9
– ident: 2024042811020442517_j_fcds-2022-0010_ref_001
  doi: 10.1088/1742-6596/1486/2/022046
– ident: 2024042811020442517_j_fcds-2022-0010_ref_009
– ident: 2024042811020442517_j_fcds-2022-0010_ref_011
  doi: 10.1016/j.apm.2015.12.013
– ident: 2024042811020442517_j_fcds-2022-0010_ref_012
  doi: 10.1057/sj/jors/2601250
– ident: 2024042811020442517_j_fcds-2022-0010_ref_026
  doi: 10.1080/0305215X.2016.1163630
– ident: 2024042811020442517_j_fcds-2022-0010_ref_010
– ident: 2024042811020442517_j_fcds-2022-0010_ref_032
  doi: 10.1016/j.apenergy.2021.116746
SSID ssj0000940581
Score 2.2155282
Snippet Using hubs in distribution networks is an efficient approach. In this paper, a model for the location-allocation problem is designed within the framework of...
SourceID doaj
proquest
crossref
walterdegruyter
SourceType Open Website
Aggregation Database
Enrichment Source
Index Database
Publisher
StartPage 177
SubjectTerms Hub
Integer programming
Location-Assignment
Multi-Objective Optimization
Multilevel Services
Queue Theory
Reinforced Epsilon Constraint Method
SummonAdditionalLinks – databaseName: DOAJ Directory of Open Access Journals
  dbid: DOA
  link: http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwrV1LSwMxEA4iHvRQfGJ9kYPgKbjbTTbpsYrFQ6kKCt6WTJKVFq3Sl-ivd5JstRXFi5eF3WR3Q2aSmS-ZfEPIMVp1MFjEeAPw4mTKtNVN5krZSKxOlIXArt-R3a66v29ez6X68jFhkR44dtwpoMWWPClLAYATLr4OJlfcWJ4Z0C6wlyayOQem-jFeLhEqjSyNDS7VaWnsCFUCoZeHQQtWKJD1L3iYtdewV23dw3DyNp7tjQaT014ntcpXpK3Yxg2y5AabZG2OQXCLTK9wyD_13vGGoitHw3la1vGRQLTzHJfjGIqg9xB2_el1zB9DewN6M3ETR7sxDHxEQ-wA1dUXrqAfZ0Ja_SB8ibYqBvJtcte-uD2_ZFUqBWbQBI-Zbual5bkyziLeAq4BZAZCZalQicxdKrXQ0gAYmWrEGDmkGaDnp5WwwBOd7ZDlwfPA7RJqM8RUCEuERjAjpUUHsiyzUuPotwZHd52wWdcWpuIZ9-kuHgvEG14UhRdF4UXhA-qSOjn5rP8SGTZ-rXnmJfVZyzNjhweoL0WlL8Vf-lInBzM5F9VwHRXYDf64kmhgsfgm-69aP7eKI4aWcu8_2rZPVqOG-kWeA7I8Hk7cIVkx03FvNDwKGv4BdXUDuA
  priority: 102
  providerName: Directory of Open Access Journals
Title Optimizing the Multi-Level Location-Assignment Problem in Queue Networks Using a Multi-Objective Optimization Approach
URI https://reference-global.com/article/10.2478/fcds-2022-0010
https://www.proquest.com/docview/3156700525
https://doaj.org/article/b264740ff5bb413da0bc684cd43cbae5
Volume 47
WOSCitedRecordID wos000824850900006&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
journalDatabaseRights – providerCode: PRVAON
  databaseName: DOAJ Directory of Open Access Journals
  customDbUrl:
  eissn: 2300-3405
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0000940581
  issn: 2300-3405
  databaseCode: DOA
  dateStart: 20120101
  isFulltext: true
  titleUrlDefault: https://www.doaj.org/
  providerName: Directory of Open Access Journals
– providerCode: PRVPQU
  databaseName: ProQuest Central
  customDbUrl:
  eissn: 2300-3405
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0000940581
  issn: 2300-3405
  databaseCode: BENPR
  dateStart: 20120101
  isFulltext: true
  titleUrlDefault: https://www.proquest.com/central
  providerName: ProQuest
– providerCode: PRVPQU
  databaseName: Publicly Available Content Database
  customDbUrl:
  eissn: 2300-3405
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0000940581
  issn: 2300-3405
  databaseCode: PIMPY
  dateStart: 20120101
  isFulltext: true
  titleUrlDefault: http://search.proquest.com/publiccontent
  providerName: ProQuest
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV3fb9MwED7BxgN7GL-1wpj8gMSTtbSx4_QJbWgTSKULCKTxFPlspyqCdjTtEPz13DluxxDwwkukJJYT6y53950v3wE8I6-Ojm5JNUA6BNOX1tuhDI0ZZN5mpcfIrj8y43F5fj6sUsKtTWWVa5sYDbWfO86RH-YENAwnMfWLi6-Su0bx7mpqoXETtpmpjPR8-_hkXL3bZFmYHU7HTqUUuhvJZGwdc-NAmfKwcb4lNSE4xtDommeKBP7Xos7db3H_2ofJYvV9ud4vjW7o9M7_LuAu7KYAVBx1GnMPboTZfdj5hZbwAVyekR35Mv1BJ4LiQxF_0pUjLi8So3mX45Mk1-kklhKIqmtKI6Yz8XYVVkGMu9ryVsSCBGHTDGf4qTOvIj0gziSOEq35Q_hwevL-5SuZ-jNIR359Ke2waLwqShc8gThUFtHkqEtaaZmZIvSN1dY4RGf6loBLgf0cKZy0pfaoMps_gq3ZfBb2QPicgBphHW0JIRnjKSptmryxZFK8I5PRA7mWTe0SeTn30PhcE4hhWdYsy5plyVV6WQ-eb8ZfdLQdfx15zKLejGK67XhhvpjU6eutkcJGo7Km0Yjk9UmH0RWlcl7lDm3QPdhfy7xONqCtrwTeA_2b8lyN-vNbKQLmxjz-97RP4HanvJwT2oet5WIVnsItd7mctouD9CkcxCwDnVWv31QffwKLZBZ3
linkProvider ProQuest
linkToHtml http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMw1V1Lb9NAEB6VFAl6KG-RUmAPIE6rOvZu1jlUqDyqRnXTIBWpnMy-HAVB0sZJq_Kj-I3MPpxSBNx64GIpzmptJ9_OzDc7_gbgBXp1pfErylKFBys6VBrZo7YSaWJkkhvl1fULMRjkx8e94Qr8aN6FcWWVjU30htpMtcuRb2VINIRLYvLXJ6fUdY1yu6tNC40Ai317cY6Urd7uv8P_92Wa7r4_ertHY1cBqtEbzansdSvDurm2BqmHYlIpkSme4wVyJPW2IySXQiulRUdiuN1VnUxhECRzbhRLZIbz3oBV5sDegtVh_2D4aZnVcWp03HdGRaogqBN_C0qRKRP5VqVNjbBE-ueo2BVP6BsGXIly18_9frmxo9niYt7sz3q3t3vnf_vB7sJ6DLDJTlgR92DFTu7D2i-yiw_g7BDt5Lfxd_xAMP4l_iVkWrjyKVJMQw6TIm7HI18qQYah6Q4ZT8iHhV1YMgi18zXxBRdExhkO1ZfgPki8gJ-J7ETZ9ofw8Voe_BG0JtOJfQzEZEhEkctxiQxQCINRd1VllUSTaTSaxDbQBguljuLsrkfI1xJJmsNO6bBTOuy4KsSkDa-W40-CLMlfR75x0FqOcnLi_sR0NiqjdSoVhsWCJVXFlcKoBteo0t2cacMyraTlbdhsMFZGG1eXlwBrA_8NrJej_nxXTCAVFhv_nvY53No7OijKoj_YfwK3w8Jx-a9NaM1nC_sUbuqz-biePYvLkMDn6wbyT9cWcQU
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Optimizing+the+Multi-Level+Location-Assignment+Problem+in+Queue+Networks+Using+a+Multi-Objective+Optimization+Approach&rft.jtitle=Foundations+of+computing+and+decision+sciences&rft.au=Syah%2C+Rahmad&rft.au=Elveny%2C+Marischa&rft.au=Soerjati%2C+Enni&rft.au=Guerrero%2C+John+William+Grimaldo&rft.date=2022-06-01&rft.issn=2300-3405&rft.eissn=2300-3405&rft.volume=47&rft.issue=2&rft.spage=177&rft.epage=192&rft_id=info:doi/10.2478%2Ffcds-2022-0010&rft.externalDBID=n%2Fa&rft.externalDocID=10_2478_fcds_2022_0010
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=2300-3405&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=2300-3405&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=2300-3405&client=summon