{"title":"A new Fermatean fuzzy multi-objective indefinite quadratic transportation problem with an application to sustainable transportation","authors":"Aakanksha Singh, Ritu Arora, Shalini Arora","doi":"10.1111/itor.13513","DOIUrl":"10.1111/itor.13513","url":null,"abstract":"<p>In this work, a Fermatean fuzzy (FF) multi-objective indefinite quadratic transportation problem (TP) is introduced. Due to some unavoidable reasons, real-life transportation parameters such as supply, demand and costs are indeterminate in nature and cannot be expressed in crisp terms. We represent these parameters using FF numbers, an extension of fuzzy numbers, which are capable of representing indeterminacy efficiently. A multi-objective indefinite quadratic TP where each objective is a product of two linear factors (cost functions) is considered. Defuzzification of FF numbers is accomplished by the introduction of <span></span><math>\u0000 <semantics>\u0000 <mrow>\u0000 <mo>(</mo>\u0000 <mi>α</mi>\u0000 <mo>,</mo>\u0000 <mi>β</mi>\u0000 <mo>)</mo>\u0000 </mrow>\u0000 <annotation>$(alpha,beta)$</annotation>\u0000 </semantics></math>-cut for the first time. The obtained crisp TP is solved using the intuitionistic fuzzy programming approach and FF programming approach to arrive at a compromise solution. To substantiate the work, solution methodology based on defuzzification using the ranking function is also deliberated. The applicability of the model is demonstrated through a sustainable TP, which simultaneously minimizes transportation cost with depreciation cost and packaging cost with wastage cost. The resulting value of the objective functions and the aspiration levels are compared to depict the efficacy of the proposed method over the ranking function method. The concluding section summarizes the work, and future avenues along with some limitations of the work are also specified.</p>","PeriodicalId":49176,"journal":{"name":"International Transactions in Operational Research","volume":"32 4","pages":"1977-2002"},"PeriodicalIF":3.1,"publicationDate":"2024-07-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141739979","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"管理学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Municipal street-sweeping area generation with route optimization","authors":"Tyler Parsons, Jaho Seo, Dan Livesey","doi":"10.1111/itor.13515","DOIUrl":"10.1111/itor.13515","url":null,"abstract":"<p>Street sweeping is used in urban municipalities worldwide but requires a great deal of planning for large-scale implementation. Municipalities typically make use of the macro- and microapproach by using operational areas in which routes are assigned, but creating operational areas without an understanding of the expected workload, number of routes, and the travel distance to and from the depot may lead to increased statistics. In this paper, a combination of heuristic approaches is used to assign street-sweeping areas on the macroscale and generate street-sweeping routes on the microscale. For the area assignment, a two-stage cluster approach is proposed, making use of the weighted <i>k</i>-means algorithm and differential evolution. For the route optimization, a three-phase augment merge algorithm is used to create initial solutions, the u-turns are minimized with a modified version of Hierholzer's algorithm and tabu search, and the remaining u-turns are removed using a forward-searching ant colony optimization. A case study in The City of Oshawa, Canada, was used to verify the proposed methodology, and all metrics were theoretically improved.</p>","PeriodicalId":49176,"journal":{"name":"International Transactions in Operational Research","volume":"32 3","pages":"1375-1399"},"PeriodicalIF":3.1,"publicationDate":"2024-07-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141646833","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"管理学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Francisco Yuraszeck, Gonzalo Mejía, Armin Lüer-Villagra
{"title":"An adapted constraint-programming formulation of the resource-constrained project scheduling problem applied to the identical parallel machines group shop and mixed shop scheduling problems","authors":"Francisco Yuraszeck, Gonzalo Mejía, Armin Lüer-Villagra","doi":"10.1111/itor.13504","DOIUrl":"10.1111/itor.13504","url":null,"abstract":"<p>In this paper, we study the group shop and the mixed shop scheduling problems with single and identical parallel machines at each workstation with the makespan criterion. We adapted a constraint programming formulation previously presented for the classical resource-constrained project scheduling problem. The effectiveness of our approach is evident in the fact that it achieved optimality in 107 out of 130 classical group shop scheduling problem instances and in 320 classical mixed shop scheduling problem instances. In the last set, we obtained 13 new optimal solutions.</p>","PeriodicalId":49176,"journal":{"name":"International Transactions in Operational Research","volume":"32 3","pages":"1422-1441"},"PeriodicalIF":3.1,"publicationDate":"2024-07-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141569503","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"管理学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Destination selection and flight scheduling for regional airlines at slot-constrained airports","authors":"Alberto Santini","doi":"10.1111/itor.13505","DOIUrl":"10.1111/itor.13505","url":null,"abstract":"<p>We present the problem of a regional airline based at a slot-constrained airport, which must select a set of destinations to serve, how many flights per day to operate to each destination, at what time the flights take place and which aircraft operates each flight. Restricting ourselves to the special case of regional airlines, which fly round trips from a central hub, we are able to tackle the four above decisions jointly. By contrast, in the existing literature, these decisions are usually optimised separately for generic airline networks. To solve the proposed problem, we introduce two compact integer formulations: a three-index and a two-index formulation. This latter, however, only solves a relaxation of the original problem because it cannot guarantee that all constraints are respected. Therefore, we embed the two-index formulation into an iterative algorithm which dynamically adds violated constraints. Computational experiments highlight the validity of this approach and provide insights into the characteristics of the solutions.</p>","PeriodicalId":49176,"journal":{"name":"International Transactions in Operational Research","volume":"32 3","pages":"1400-1421"},"PeriodicalIF":3.1,"publicationDate":"2024-07-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://onlinelibrary.wiley.com/doi/epdf/10.1111/itor.13505","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141569502","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"管理学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
L. Alçada‐Almeida, N. Sousa, J. Coutinho‐Rodrigues
{"title":"A multi‐objective model for publicly funded festival planning","authors":"L. Alçada‐Almeida, N. Sousa, J. Coutinho‐Rodrigues","doi":"10.1111/itor.13500","DOIUrl":"https://doi.org/10.1111/itor.13500","url":null,"abstract":"This article proposes a multi‐objective mixed‐integer linear programming model to assist event managers in obtaining and evaluating non‐dominated solutions to the problem of selecting a daily lineup of shows and activities for a festival – be it cultural, sports, ceremonial or any other kind. The model, which is especially adequate for designing festivals with public funding, has five objectives, relating to financial, logistical and how renowned the festival artists or acts are. It includes support for multiple days, multiple stages and different types of shows, all subject to constraints imposed by the intrinsic nature of the festival itself. The output of the model is a set of optimized daily lineups for the activities that constitute the festival, each corresponding to a particular compromise between the five objectives. The approach is demonstrated with a case study for a 5‐day festival, for which non‐dominated solutions are derived, presented and discussed. Results show that the model can provide a good variety of solutions while ensuring the persistence of the more desirable shows. The model is a novel decision support tool to assist in designing festival lineups that provide optimal audience experience, a key factor in attracting spectators, tourists and increasing comeback value.","PeriodicalId":49176,"journal":{"name":"International Transactions in Operational Research","volume":"152 1","pages":""},"PeriodicalIF":3.1,"publicationDate":"2024-06-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141505590","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"管理学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Evaluating input- and output-specific inefficiency in courts of justice. An empirical study of Polish district courts","authors":"Magdalena Kapelko","doi":"10.1111/itor.13503","DOIUrl":"10.1111/itor.13503","url":null,"abstract":"<p>Efficient judicial systems are acknowledged to benefit economic growth, firm competition, entrepreneurship, and financial market development. The goal of this paper is to measure the relative technical inefficiency of Polish district courts for the period 2017–2021 in civil, criminal, and family cases. Unlike other papers on justice (in)efficiency, this study uses input-specific and output-specific production models combined with the Data Envelopment Analysis technique. This approach allows for assessment of the contributions of specific inputs and outputs to overall court inefficiency. The results show considerable differences in inefficiencies with regard to courts’ specific inputs and outputs and the types of cases being processed. The evidence shows that the greatest inefficiency is found among court workers (i.e., other judicial staff and judges), while among judges, it is civil judges, with this result being robust to the model's specification. According to the results, the year 2020 marked a clear increase in the inefficiency of almost all variables, which can be attributed to the Coronavirus Disease 2019 (COVID-19) pandemic and restrictions on the functioning of the courts. Finally, the results also highlight a heterogeneity among courts depending on their geographical location and size, with courts related to the largest cities and those of large size tending to be the most inefficient.</p>","PeriodicalId":49176,"journal":{"name":"International Transactions in Operational Research","volume":"32 5","pages":"2767-2797"},"PeriodicalIF":3.1,"publicationDate":"2024-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://onlinelibrary.wiley.com/doi/epdf/10.1111/itor.13503","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141529197","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"管理学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Effects of product online reviews on product returns: a review and classification of the literature","authors":"Yun Wang, Bo Yu, Jing Chen","doi":"10.1111/itor.13502","DOIUrl":"https://doi.org/10.1111/itor.13502","url":null,"abstract":"Product returns pose a significant challenge for online retailers, primarily due to consumer uncertainty, both before and after the purchase. These uncertainties may stem from factors such as the absence of a “touch and feel” experience, mismatched product expectations, or post‐purchase regret, where consumers change their minds. Online reviews, shared by previous consumers who have already experienced the products, can have a substantial impact not only on new consumers’ purchasing but also on return decisions. Surprisingly, there has been limited research to understand the influence of online reviews on product returns. This paper applies the input‐process‐output framework to conduct a comprehensive review and analysis of studies related to online reviews and product returns. Based on this review and analysis, a conceptual model is proposed, and an outline for the future research agenda is discussed.","PeriodicalId":49176,"journal":{"name":"International Transactions in Operational Research","volume":"14 1","pages":""},"PeriodicalIF":3.1,"publicationDate":"2024-06-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141505592","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"管理学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Global scale efficiency in data envelopment analysis","authors":"Juan Aparicio, Daniel Santín","doi":"10.1111/itor.13501","DOIUrl":"10.1111/itor.13501","url":null,"abstract":"<p>In the realm of assessing scale efficiency (SE), it tends to be computed as a firm-specific phenomenon rather than something associated with the whole shape of the frontier of the technology under evaluation. This circumstance may lead to inaccuracies in the conclusions drawn regarding the returns to scale (RTS) exhibited across the entire frontiers since they can be biased by the location of the observations. This paper addresses this gap by defining the notion of global SE measured through projecting synthetic observations randomly generated within a unit-hypercube against the technologies under constant and variable RTS. Our approach enables the comparison of the local SE exhibited by each firm in relation to the global expected percentage of production points that display a similar type of RTS across the production frontier. The approach is illustrated through a numerical example and applied to a set of hospitals in Spain.</p>","PeriodicalId":49176,"journal":{"name":"International Transactions in Operational Research","volume":"32 5","pages":"2474-2496"},"PeriodicalIF":3.1,"publicationDate":"2024-06-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://onlinelibrary.wiley.com/doi/epdf/10.1111/itor.13501","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141505591","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"管理学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Special Issue on “Optimizing Port and Maritime Logistics: Advances for Sustainable and Efficient Operations”","authors":"","doi":"10.1111/itor.13477","DOIUrl":"https://doi.org/10.1111/itor.13477","url":null,"abstract":"","PeriodicalId":49176,"journal":{"name":"International Transactions in Operational Research","volume":"31 6","pages":"4404-4405"},"PeriodicalIF":3.1,"publicationDate":"2024-06-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141430280","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"管理学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Special Issue on “Sharing Platforms for Sustainability: Exploring Strategies, Trade-offs, and Applications”","authors":"","doi":"10.1111/itor.13497","DOIUrl":"https://doi.org/10.1111/itor.13497","url":null,"abstract":"","PeriodicalId":49176,"journal":{"name":"International Transactions in Operational Research","volume":"31 6","pages":"4402-4403"},"PeriodicalIF":3.1,"publicationDate":"2024-06-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141430279","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"管理学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}