Pub Date : 2023-01-01DOI: 10.1504/ijor.2023.133747
Mustafa S. Canbolat, George O. Wesolowsky, Michael v, on Massow
We study the problem of finding a minimax location for a rectangular barrier facility on the plane and simultaneously minimising the interference of the barrier facility to the interactions among the existing facilities using rectilinear distances. This provides an ex post opportunity to modify an existing network or layout while minimising the disruption. The problem is formulated as a bi-objective problem and a mixed integer program is proposed as a solution methodology. A simulated annealing algorithm is presented for an extension of the problem where expropriation or removal of existing facilities is also possible. We consider expropriation or removal of existing facilities only if such policy is necessary or cost-beneficial.
{"title":"Locating a rectangular barrier facility on the plane: a bi-objective approach","authors":"Mustafa S. Canbolat, George O. Wesolowsky, Michael v, on Massow","doi":"10.1504/ijor.2023.133747","DOIUrl":"https://doi.org/10.1504/ijor.2023.133747","url":null,"abstract":"We study the problem of finding a minimax location for a rectangular barrier facility on the plane and simultaneously minimising the interference of the barrier facility to the interactions among the existing facilities using rectilinear distances. This provides an ex post opportunity to modify an existing network or layout while minimising the disruption. The problem is formulated as a bi-objective problem and a mixed integer program is proposed as a solution methodology. A simulated annealing algorithm is presented for an extension of the problem where expropriation or removal of existing facilities is also possible. We consider expropriation or removal of existing facilities only if such policy is necessary or cost-beneficial.","PeriodicalId":35451,"journal":{"name":"International Journal of Operational Research","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135952752","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2023-01-01DOI: 10.1504/ijor.2023.10056844
P. S, Palaniammal S
{"title":"A State Dependent Arrival Analysis In a Non-Markovian Bulk Queue with Server Failures","authors":"P. S, Palaniammal S","doi":"10.1504/ijor.2023.10056844","DOIUrl":"https://doi.org/10.1504/ijor.2023.10056844","url":null,"abstract":"","PeriodicalId":35451,"journal":{"name":"International Journal of Operational Research","volume":"54 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"86797496","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2023-01-01DOI: 10.1504/ijor.2023.134779
Juliana Fausto Flores, André Andrade Longaray, Leonardo Ensslin, Ademar Dutra, Sandra Ensslin, Vilmar Antonio Gonçalves Tondolo
{"title":"Using constructivist multi-criteria decision aid to evaluate the workforce sizing in public organisations: the case of a Brazilian university","authors":"Juliana Fausto Flores, André Andrade Longaray, Leonardo Ensslin, Ademar Dutra, Sandra Ensslin, Vilmar Antonio Gonçalves Tondolo","doi":"10.1504/ijor.2023.134779","DOIUrl":"https://doi.org/10.1504/ijor.2023.134779","url":null,"abstract":"","PeriodicalId":35451,"journal":{"name":"International Journal of Operational Research","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135610779","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2023-01-01DOI: 10.1504/ijor.2023.134402
Drinko Kurevija
This article analyses the performances of the Austrian Research Promotion Agency's (ARPA) general program by applying a novel approach to data envelopment analysis (DEA) namely the adjusted DEA (A-DEA). Considering the previous findings of Sowlati and Paradi (2004) by defining a new 'practical frontier' and utilising management input, a modified linear programming model and a methodology for improving the efficiency of empirically efficient units was applied. The aim was to find the output for the novel 'different' units in order to identify an alternative frontier of both already empirically efficient and these 'new' DMUs considering the performances of ARPA's general program.
本文采用一种新颖的数据包络分析(DEA)方法，即调整后的DEA (a -DEA)，分析了奥地利研究促进局(ARPA)一般计划的绩效。考虑到Sowlati和Paradi(2004)通过定义一个新的“实践前沿”和利用管理投入的先前发现，采用了改进的线性规划模型和方法来提高经验效率单位的效率。其目的是找到新颖的“不同”单元的输出，以便确定既具有经验效率又考虑到ARPA一般程序性能的这些“新”dmu的替代边界。
{"title":"Novel approach to data envelopment analysis - the case of the Austrian general program","authors":"Drinko Kurevija","doi":"10.1504/ijor.2023.134402","DOIUrl":"https://doi.org/10.1504/ijor.2023.134402","url":null,"abstract":"This article analyses the performances of the Austrian Research Promotion Agency's (ARPA) general program by applying a novel approach to data envelopment analysis (DEA) namely the adjusted DEA (A-DEA). Considering the previous findings of Sowlati and Paradi (2004) by defining a new 'practical frontier' and utilising management input, a modified linear programming model and a methodology for improving the efficiency of empirically efficient units was applied. The aim was to find the output for the novel 'different' units in order to identify an alternative frontier of both already empirically efficient and these 'new' DMUs considering the performances of ARPA's general program.","PeriodicalId":35451,"journal":{"name":"International Journal of Operational Research","volume":"51 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135104930","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2023-01-01DOI: 10.1504/ijor.2023.134397
Rohit Sindhwani, Venkataramanaiah Saddikuti, Omkarprasad S. Vaidya
The healthcare and economic distress caused by large-scale disruptive events is most severe. The recent pandemic, SARS-CoV-2, has affected the entire world with its relentless energy. Only few supply chains (SCs) have remained resilient during disruptions. We highlight that these organisations do not just focus on SC resilience; the innate nature of being responsible has helped them stay afloat. Thus, we understand and identify various enablers of resilient and responsible SCs for survival during large-scale disruptions in India. 15 enablers and 30 sub-enablers for SC survivability are identified from literature and verified by experts. Integrated ISM-ANP approach and MICMAC analysis is adopted to develop a conceptual framework and prioritise enablers for SC survivability. The three most important sub-enablers in near term are advanced tracking and tracing system (0.0807), information sharing of business objectives (0.0776) and multi-way partnership (0.0776), respectively.
{"title":"Evaluation of enablers of supply chain resilience and responsibility in India during large-scale disruptions: an ISM-ANP approach","authors":"Rohit Sindhwani, Venkataramanaiah Saddikuti, Omkarprasad S. Vaidya","doi":"10.1504/ijor.2023.134397","DOIUrl":"https://doi.org/10.1504/ijor.2023.134397","url":null,"abstract":"The healthcare and economic distress caused by large-scale disruptive events is most severe. The recent pandemic, SARS-CoV-2, has affected the entire world with its relentless energy. Only few supply chains (SCs) have remained resilient during disruptions. We highlight that these organisations do not just focus on SC resilience; the innate nature of being responsible has helped them stay afloat. Thus, we understand and identify various enablers of resilient and responsible SCs for survival during large-scale disruptions in India. 15 enablers and 30 sub-enablers for SC survivability are identified from literature and verified by experts. Integrated ISM-ANP approach and MICMAC analysis is adopted to develop a conceptual framework and prioritise enablers for SC survivability. The three most important sub-enablers in near term are advanced tracking and tracing system (0.0807), information sharing of business objectives (0.0776) and multi-way partnership (0.0776), respectively.","PeriodicalId":35451,"journal":{"name":"International Journal of Operational Research","volume":"84 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135105197","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2023-01-01DOI: 10.1504/ijor.2023.132816
Michael O. Olusola, Sidney I. Onyeagu
This paper re-appraises the use of the minimised sum of deviations by the proportion method (MSDP), the linear discriminant analysis (LDA) embodied in Minitab and the logit discriminant analysis (LoDA), for allocating observations into one of two mutually exclusive groups using some examples. In a recent paper, the MSDP was proposed as a means of generating a discriminant function that separates observations in a training sample (or development sample) of known group membership into specified groups. In the MSDP formulation, the sum of the proportion of exterior deviations is minimised subject to the group separation constraints, the normalisation constraint, the upper bound constraints on proportions of exterior deviations and the sign unrestriction vis-à-vis the non-negativity constraints. The decision rule on group-membership prediction is constructed using the apparent error rate. This study compares the performance of the MSDP with the LDA and LoDA based on their classification accuracy. The obtained results indicate that the LoDA is not suitable for the examples considered and that the MSDP is an appropriate alternative to the LDA.
{"title":"Performance of some discriminant analysis techniques","authors":"Michael O. Olusola, Sidney I. Onyeagu","doi":"10.1504/ijor.2023.132816","DOIUrl":"https://doi.org/10.1504/ijor.2023.132816","url":null,"abstract":"This paper re-appraises the use of the minimised sum of deviations by the proportion method (MSDP), the linear discriminant analysis (LDA) embodied in Minitab and the logit discriminant analysis (LoDA), for allocating observations into one of two mutually exclusive groups using some examples. In a recent paper, the MSDP was proposed as a means of generating a discriminant function that separates observations in a training sample (or development sample) of known group membership into specified groups. In the MSDP formulation, the sum of the proportion of exterior deviations is minimised subject to the group separation constraints, the normalisation constraint, the upper bound constraints on proportions of exterior deviations and the sign unrestriction vis-à-vis the non-negativity constraints. The decision rule on group-membership prediction is constructed using the apparent error rate. This study compares the performance of the MSDP with the LDA and LoDA based on their classification accuracy. The obtained results indicate that the LoDA is not suitable for the examples considered and that the MSDP is an appropriate alternative to the LDA.","PeriodicalId":35451,"journal":{"name":"International Journal of Operational Research","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"136079478","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2023-01-01DOI: 10.1504/ijor.2023.133741
Ali Kansou, Bilal Kanso, Adnan Yassine
This paper considers the multi-depot multi-compartment capacitated arc routing problem. It consists to find a set of vehicle routes with minimal travelled distance that satisfy the demands of a set of customers for several products. This problem has some important applications such as in the fields of transportation, distribution and logistics since companies are increasingly using multiple depots to store their products and separate compartments which are necessary since each product has its own specific characteristics and cannot be mixed during transportation. In this paper, a new approach based on the ant colony optimisation that is hybridised with a simulated annealing algorithm is developed. Computational experiments are performed on a benchmark of instances taken from the literature, and a set of real-life instances, and on another new set of random large-scale instances. The proposed metaheuristic generates high-quality solutions compared to the existing algorithms and particularly the results on the new instances seem promising, purposeful and powerful.
{"title":"Hybridised ant colony optimisation for the multi-depot multi-compartment capacitated arc routing problem","authors":"Ali Kansou, Bilal Kanso, Adnan Yassine","doi":"10.1504/ijor.2023.133741","DOIUrl":"https://doi.org/10.1504/ijor.2023.133741","url":null,"abstract":"This paper considers the multi-depot multi-compartment capacitated arc routing problem. It consists to find a set of vehicle routes with minimal travelled distance that satisfy the demands of a set of customers for several products. This problem has some important applications such as in the fields of transportation, distribution and logistics since companies are increasingly using multiple depots to store their products and separate compartments which are necessary since each product has its own specific characteristics and cannot be mixed during transportation. In this paper, a new approach based on the ant colony optimisation that is hybridised with a simulated annealing algorithm is developed. Computational experiments are performed on a benchmark of instances taken from the literature, and a set of real-life instances, and on another new set of random large-scale instances. The proposed metaheuristic generates high-quality solutions compared to the existing algorithms and particularly the results on the new instances seem promising, purposeful and powerful.","PeriodicalId":35451,"journal":{"name":"International Journal of Operational Research","volume":"39 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135952840","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：