International Transactions in Operational Research最新文献_第6页

Adaptive feasible and infeasible evolutionary search for the knapsack problem with forfeits 有弃权的knapsack问题的自适应可行和不可行进化搜索

IF 3.1 4区管理学

International Transactions in Operational Research Pub Date : 2024-07-26 DOI: 10.1111/itor.13512

Qing Zhou, Jin-Kao Hao, Zhong-Zhong Jiang, Qinghua Wu

引用次数: 0

Two-stage pricing of products and services considering different competitive environments 考虑不同竞争环境的产品和服务的两阶段定价

IF 3.1 4区管理学

International Transactions in Operational Research Pub Date : 2024-07-25 DOI: 10.1111/itor.13520

Wei Qi, Ziwei Li, Xuwang Liu

引用次数: 0

Sequencing situations with position-dependent effects under cooperation 合作条件下具有位置依赖效应的排序情况

IF 3.1 4区管理学

International Transactions in Operational Research Pub Date : 2024-07-25 DOI: 10.1111/itor.13518

A. Saavedra-Nieves, M. A. Mosquera, M. G. Fiestras-Janeiro

引用次数: 0

The quality admission and price decisions of production capacity on the third‐party platform for shared manufacturing 共享制造第三方平台的产能质量准入和价格决策

IF 3.1 4区管理学

International Transactions in Operational Research Pub Date : 2024-07-23 DOI: 10.1111/itor.13517

Wenbo Li, Bin Dan, Xumei Zhang, Ting Lei, Shengming Zhang

{"title":"The quality admission and price decisions of production capacity on the third‐party platform for shared manufacturing","authors":"Wenbo Li, Bin Dan, Xumei Zhang, Ting Lei, Shengming Zhang","doi":"10.1111/itor.13517","DOIUrl":"https://doi.org/10.1111/itor.13517","url":null,"abstract":"Many third‐party platforms for shared manufacturing (platforms) have developed rapidly in recent years. The quality admission and pricing of production capacity are crucial issues for these platforms. This paper focuses on the platform supply chain composed of a platform, multiple manufacturers with surplus production capacity (sharers), and multiple manufacturers with insufficient production capacity (renters). Considering the impact of the production capacity quality on the shared scale and rental demand of production capacity, this paper constructs a game model for the platform supply chain under different quality admission scenarios, investigates the quality admission and price decisions of production capacity on the platform, and analyses the impact of the quality admission on the sharers’ and renters’ profits. The results show that the platform sets the quality admission when the sharers’ production capacity scale is small and the platform regulatory cost is low. The platform always increases its service price but may reduce the rental price of production capacity under the quality admission scenario. When the sharers’ production capacity scale is large, the platform lowers the threshold of quality admission with the quality elasticity of production capacity increasing. In addition, when the quality elasticity of production capacity and platform regulatory cost are low, and the sharers’ production capacity scale is small, the quality admission of the platform realizes the win–win–win situation for the platform, renters, and sharers.","PeriodicalId":49176,"journal":{"name":"International Transactions in Operational Research","volume":"16 1","pages":""},"PeriodicalIF":3.1,"publicationDate":"2024-07-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141776882","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}

引用次数: 0

Hierarchical goal programming approaches to solve a discrete-time formulation for the aircraft recovery problem of a Brazilian oil and gas company 用分层目标编程方法解决巴西一家石油天然气公司飞机回收问题的离散时间公式

IF 3.1 4区管理学

International Transactions in Operational Research Pub Date : 2024-07-19 DOI: 10.1111/itor.13516

Tarley Mansur Fantazzini, Thiago Vieira, Reinaldo Morabito, Pedro Munari

{"title":"Hierarchical goal programming approaches to solve a discrete-time formulation for the aircraft recovery problem of a Brazilian oil and gas company","authors":"Tarley Mansur Fantazzini, Thiago Vieira, Reinaldo Morabito, Pedro Munari","doi":"10.1111/itor.13516","DOIUrl":"10.1111/itor.13516","url":null,"abstract":"We address the aircraft recovery problem faced by a Brazilian oil and gas company during its offshore operations. This problem involves hiring helicopters from an outsourced company to transport personnel from an airport to maritime units. The performed flights are subject to disruptions and might require rescheduling. To assist with decision-making in such situations, we introduce a discrete-time integer linear programming (ILP) model that considers company-specific attributes, including a lexicographic objective function that prioritizes (i) the reduction of flight transfers to the next day; (ii) the reduction of helicopter utilization; and (iii) the reduction of flight delays of the day. We develop four different solution approaches using hierarchical goal programming based on the proposed model, aided by enhancements and valid inequalities. Computational experiments using both real-world and simulated instances demonstrate that our approaches can provide effective solutions for most instances using a general-purpose ILP solver within acceptable computation times.","PeriodicalId":49176,"journal":{"name":"International Transactions in Operational Research","volume":"32 3","pages":"1343-1374"},"PeriodicalIF":3.1,"publicationDate":"2024-07-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141745883","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}

引用次数: 0

Design of survivable networks with low connectivity requirements 设计连接要求低的可生存网络

IF 3.1 4区管理学

International Transactions in Operational Research Pub Date : 2024-07-18 DOI: 10.1111/itor.13511

Fatmah Almathkour, Youcef Magnouche, A. Ridha Mahjoub, Raouia Taktak

引用次数: 0

A new Fermatean fuzzy multi-objective indefinite quadratic transportation problem with an application to sustainable transportation 新的 Fermatean 模糊多目标不定四元交通问题及其在可持续交通中的应用

IF 3.1 4区管理学

International Transactions in Operational Research Pub Date : 2024-07-16 DOI: 10.1111/itor.13513

Aakanksha Singh, Ritu Arora, Shalini Arora

{"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":"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 <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.","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}

引用次数: 0

Municipal street-sweeping area generation with route optimization 通过优化路线生成市政街道清扫区域

IF 3.1 4区管理学

International Transactions in Operational Research Pub Date : 2024-07-15 DOI: 10.1111/itor.13515

Tyler Parsons, Jaho Seo, Dan Livesey

{"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":"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 k-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.","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}

引用次数: 0

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 将资源受限项目调度问题的改编约束编程公式应用于相同并联机器分组车间和混合车间调度问题

IF 3.1 4区管理学

International Transactions in Operational Research Pub Date : 2024-07-08 DOI: 10.1111/itor.13504

Francisco Yuraszeck, Gonzalo Mejía, Armin Lüer-Villagra

引用次数: 0

Destination selection and flight scheduling for regional airlines at slot-constrained airports 支线航空公司在机位紧张机场的目的地选择和航班调度

IF 3.1 4区管理学

International Transactions in Operational Research Pub Date : 2024-07-08 DOI: 10.1111/itor.13505

Alberto Santini

引用次数: 0