首页 > 最新文献

International Transactions in Operational Research最新文献

英文 中文
Optimization of a semiflexible demand-responsive feeder bus system using variable neighborhood search 基于可变邻域搜索的半柔性需求响应接驳公交系统优化
IF 3.1 4区 管理学 Q2 MANAGEMENT Pub Date : 2025-02-05 DOI: 10.1111/itor.13616
Fábio Sartori Vieira, Kenneth Sörensen, Pieter Vanstenwegen

A demand-responsive feeder system (DRFS) presents an alternative to traditional feeder bus systems (TFS) in areas with low demand. This paper introduces an optimization problem to support the planning and operation of a DRFS. A variable neighborhood search (VNS) is employed to optimize the DRFS, focusing on minimizing passengers' travel times. The performance of the VNS is compared with that obtained by solving the mathematical model using a commercial solver (CPLEX) across two networks: a small network for validation and a larger suburban network that simulates a TFS. The results indicate that the VNS is a viable and efficient alternative for optimizing DRFS operations, providing flexibility in route and departure time adjustments, and achieving significant reductions in passenger travel times. The results also demonstrate that the DRFS outperforms the TFS in low-demand areas. On average, the VNS improves upon CPLEX results, obtained within one hour of calculation time for the small network, by 2.3%. Using the same resources, the DRFS reduces the average passenger travel time by 9.6% compared to the TFS.

在低需求地区,需求响应馈线系统(DRFS)是传统馈线巴士系统(TFS)的替代方案。本文介绍了一个支持DRFS规划和运行的优化问题。采用可变邻域搜索(VNS)优化DRFS,以最小化乘客出行时间为目标。将VNS的性能与使用商用求解器(CPLEX)跨两个网络求解数学模型获得的性能进行了比较:一个用于验证的小型网络和一个模拟TFS的大型郊区网络。结果表明,VNS是优化DRFS操作的可行且有效的替代方案,提供了路线和出发时间调整的灵活性,并显著减少了乘客的旅行时间。结果还表明,在低需求地区,DRFS优于TFS。对于小型网络,VNS在计算时间为1小时的CPLEX结果基础上平均提高2.3%。在使用相同资源的情况下,与交通运输服务相比,交通运输服务减少了9.6%的平均乘客旅行时间。
{"title":"Optimization of a semiflexible demand-responsive feeder bus system using variable neighborhood search","authors":"Fábio Sartori Vieira,&nbsp;Kenneth Sörensen,&nbsp;Pieter Vanstenwegen","doi":"10.1111/itor.13616","DOIUrl":"https://doi.org/10.1111/itor.13616","url":null,"abstract":"<p>A demand-responsive feeder system (DRFS) presents an alternative to traditional feeder bus systems (TFS) in areas with low demand. This paper introduces an optimization problem to support the planning and operation of a DRFS. A variable neighborhood search (VNS) is employed to optimize the DRFS, focusing on minimizing passengers' travel times. The performance of the VNS is compared with that obtained by solving the mathematical model using a commercial solver (CPLEX) across two networks: a small network for validation and a larger suburban network that simulates a TFS. The results indicate that the VNS is a viable and efficient alternative for optimizing DRFS operations, providing flexibility in route and departure time adjustments, and achieving significant reductions in passenger travel times. The results also demonstrate that the DRFS outperforms the TFS in low-demand areas. On average, the VNS improves upon CPLEX results, obtained within one hour of calculation time for the small network, by 2.3%. Using the same resources, the DRFS reduces the average passenger travel time by 9.6% compared to the TFS.</p>","PeriodicalId":49176,"journal":{"name":"International Transactions in Operational Research","volume":"32 6","pages":"3413-3440"},"PeriodicalIF":3.1,"publicationDate":"2025-02-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144244346","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
Drone-enabled material handling in smart manufacturing 智能制造中的无人机物料处理
IF 3.1 4区 管理学 Q2 MANAGEMENT Pub Date : 2025-02-03 DOI: 10.1111/itor.13621
Julio Jiménez-Sarda, Daniel F. Silva, Alice E. Smith

Amidst labor shortages, increasing land prices, and other aspects of the post-pandemic world, our logistics chain must consider new technological alternatives. Automated material handling equipment often requires valuable floor space and specialized layouts. Uncrewed aerial vehicles, popularly called drones, offer a flexible and cost-effective alternative. To explore the potential benefits and challenges of such systems, we used a version of the multi-trip vehicle routing problem with time windows to model two realistic manufacturing environments as use cases. We provide the mixed integer linear programming formulation of this problem and compare results with those of a human-only based system in a detailed simulated environment. Furthermore, as a physical proof-of-concept, we outfitted a commercially available drone with pick-up and carry capabilities. We found that, even with limited drone carrying capacity, there are economic benefits realized from time savings, compared to ground-based material handling systems. Besides these time savings, drones are sustainable as they operate on battery power and do not impair the air quality or the traffic experienced on the ground.

在劳动力短缺、地价上涨以及大流行后世界的其他方面,我们的物流链必须考虑新的技术替代方案。自动化物料搬运设备通常需要宝贵的占地面积和专门的布局。无人驾驶飞行器,通常被称为无人机,提供了一种灵活而经济的替代方案。为了探索这种系统的潜在优势和挑战,我们使用了一个带时间窗口的多行程车辆路线问题的版本,将两个现实的制造环境作为用例进行建模。我们给出了该问题的混合整数线性规划公式,并在详细的模拟环境中将结果与仅基于人的系统的结果进行了比较。此外,作为物理概念验证,我们为商用无人机配备了拾取和携带能力。我们发现,与地面材料处理系统相比,即使无人机运载能力有限,也可以从节省时间中获得经济效益。除了节省时间,无人机是可持续的,因为它们靠电池供电,不会影响空气质量或地面交通。
{"title":"Drone-enabled material handling in smart manufacturing","authors":"Julio Jiménez-Sarda,&nbsp;Daniel F. Silva,&nbsp;Alice E. Smith","doi":"10.1111/itor.13621","DOIUrl":"https://doi.org/10.1111/itor.13621","url":null,"abstract":"<p>Amidst labor shortages, increasing land prices, and other aspects of the post-pandemic world, our logistics chain must consider new technological alternatives. Automated material handling equipment often requires valuable floor space and specialized layouts. Uncrewed aerial vehicles, popularly called drones, offer a flexible and cost-effective alternative. To explore the potential benefits and challenges of such systems, we used a version of the multi-trip vehicle routing problem with time windows to model two realistic manufacturing environments as use cases. We provide the mixed integer linear programming formulation of this problem and compare results with those of a human-only based system in a detailed simulated environment. Furthermore, as a physical proof-of-concept, we outfitted a commercially available drone with pick-up and carry capabilities. We found that, even with limited drone carrying capacity, there are economic benefits realized from time savings, compared to ground-based material handling systems. Besides these time savings, drones are sustainable as they operate on battery power and do not impair the air quality or the traffic experienced on the ground.</p>","PeriodicalId":49176,"journal":{"name":"International Transactions in Operational Research","volume":"32 6","pages":"3296-3315"},"PeriodicalIF":3.1,"publicationDate":"2025-02-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144244458","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
Top heavy? On the allocative efficiency of small school districts 上沉重的?论小学区的配置效率
IF 3.1 4区 管理学 Q2 MANAGEMENT Pub Date : 2025-02-02 DOI: 10.1111/itor.13617
Lori L. Taylor, Shawna Grosskopf, Kathy J. Hayes

Policymakers tend to presume that small local education agencies (LEAs) are administratively top heavy, but indivisibilities at the classroom level could just as easily lead small LEAs to overuse teachers rather than administrators. This analysis uses an input distance function and administrative data on students, staff, and spending to estimate the technical and allocative efficiency of Texas public school districts. Our results suggest that small districts are no more likely to overuse administrators than to overuse teachers. Once likely determinants of inefficiency are taken into account, there is no relationship between school district size and the degree of allocative inefficiency. As such, our analysis casts doubt on the efficacy of efficiency rules of thumb that are common in public service practice.

政策制定者倾向于认为小型地方教育机构(LEAs)在行政管理上过于繁重,但课堂层面的不可分割性也很容易导致小型地方教育机构过度使用教师而不是管理人员。该分析使用输入距离函数和有关学生、员工和支出的管理数据来估计德克萨斯州公立学区的技术和分配效率。我们的研究结果表明,小地区不太可能过度使用管理人员,也不太可能过度使用教师。一旦考虑到效率低下的可能决定因素,学区规模和分配效率低下的程度之间就没有关系了。因此,我们的分析对公共服务实践中常见的效率经验法则的有效性提出了质疑。
{"title":"Top heavy? On the allocative efficiency of small school districts","authors":"Lori L. Taylor,&nbsp;Shawna Grosskopf,&nbsp;Kathy J. Hayes","doi":"10.1111/itor.13617","DOIUrl":"https://doi.org/10.1111/itor.13617","url":null,"abstract":"<p>Policymakers tend to presume that small local education agencies (LEAs) are administratively top heavy, but indivisibilities at the classroom level could just as easily lead small LEAs to overuse teachers rather than administrators. This analysis uses an input distance function and administrative data on students, staff, and spending to estimate the technical and allocative efficiency of Texas public school districts. Our results suggest that small districts are no more likely to overuse administrators than to overuse teachers. Once likely determinants of inefficiency are taken into account, there is no relationship between school district size and the degree of allocative inefficiency. As such, our analysis casts doubt on the efficacy of efficiency rules of thumb that are common in public service practice.</p>","PeriodicalId":49176,"journal":{"name":"International Transactions in Operational Research","volume":"32 5","pages":"2707-2731"},"PeriodicalIF":3.1,"publicationDate":"2025-02-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143818614","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
Resilient design of hyperconnected multiactor Physical Internet supply chain networks 超连接多主体实体互联网供应链网络弹性设计
IF 3.1 4区 管理学 Q2 MANAGEMENT Pub Date : 2025-01-31 DOI: 10.1111/itor.13615
Rafael D. Tordecilla, Jairo R. Montoya-Torres, William J. Guerrero

The Physical Internet (PI) is a relatively new logistics paradigm defined as a supply chain framework whose physical components are standardized and optimized with the main objective of increasing the supply chain's overall efficiency, resilience, and sustainability. Given the novelty of the PI concept, there is a lack of scientific literature addressing it from a quantitative point of view, although formulating and solving mathematical models representing resilient PI problems are relevant and innovative issues for academics, practitioners, and governments. In this work, we present a multiperiod mixed-integer programming model to design PI-enabled supply chain networks, in which both cost and resilience are optimized. Hyperconnection and multiple actors are considered in the proposed models. A lexicographic method is proposed to solve these models with multiple objectives, which includes a modified version of the hypervolume measure. Both newly designed and adapted benchmark instances are employed to assess our models' performance. We compare this model against a traditional proprietary logistics model and a horizontal collaboration model between two companies. Results show that hyperconnectivity increases resilience by 5.5%$5.5%$ and reduces the supply chain network design costs by 26.4%$26.4%$. The risk of not satisfying the destination's demands is reduced as well. Furthermore, in the PI context, we propose a minimax model that has been proved to increase cost equity between the considered actors. This model reduces the average difference between the costs of these actors from 77%$77%$ to 4%$4%$.

物理互联网(PI)是一个相对较新的物流范式,它被定义为一个供应链框架,其物理组件被标准化和优化,主要目标是提高供应链的整体效率、弹性和可持续性。鉴于PI概念的新颖性,缺乏从定量角度解决它的科学文献,尽管制定和解决代表弹性PI问题的数学模型对于学术界,实践者和政府来说是相关的和创新的问题。在这项工作中,我们提出了一个多周期混合整数规划模型来设计pi支持的供应链网络,其中成本和弹性都是优化的。提出的模型考虑了超连接和多参与者。提出了一种词典学方法来解决这些具有多目标的模型,其中包括一个修改版本的hypervolume度量。采用新设计和调整的基准实例来评估我们的模型的性能。我们将这种模式与传统的专有物流模式和两家公司之间的横向合作模式进行比较。结果表明,超连通性使弹性提高了5.5%,并使供应链网络设计成本降低了26.4%。不满足目的地需求的风险也降低了。此外,在PI上下文中,我们提出了一个极小极大模型,该模型已被证明可以增加所考虑的参与者之间的成本公平。这个模型将这些演员之间的平均成本差异从77% $ 77% $减少到4% $ 4% $。
{"title":"Resilient design of hyperconnected multiactor Physical Internet supply chain networks","authors":"Rafael D. Tordecilla,&nbsp;Jairo R. Montoya-Torres,&nbsp;William J. Guerrero","doi":"10.1111/itor.13615","DOIUrl":"https://doi.org/10.1111/itor.13615","url":null,"abstract":"<p>The Physical Internet (PI) is a relatively new logistics paradigm defined as a supply chain framework whose physical components are standardized and optimized with the main objective of increasing the supply chain's overall efficiency, resilience, and sustainability. Given the novelty of the PI concept, there is a lack of scientific literature addressing it from a quantitative point of view, although formulating and solving mathematical models representing resilient PI problems are relevant and innovative issues for academics, practitioners, and governments. In this work, we present a multiperiod mixed-integer programming model to design PI-enabled supply chain networks, in which both cost and resilience are optimized. Hyperconnection and multiple actors are considered in the proposed models. A lexicographic method is proposed to solve these models with multiple objectives, which includes a modified version of the hypervolume measure. Both newly designed and adapted benchmark instances are employed to assess our models' performance. We compare this model against a traditional proprietary logistics model and a horizontal collaboration model between two companies. Results show that hyperconnectivity increases resilience by <span></span><math>\u0000 <semantics>\u0000 <mrow>\u0000 <mn>5.5</mn>\u0000 <mo>%</mo>\u0000 </mrow>\u0000 <annotation>$5.5%$</annotation>\u0000 </semantics></math> and reduces the supply chain network design costs by <span></span><math>\u0000 <semantics>\u0000 <mrow>\u0000 <mn>26.4</mn>\u0000 <mo>%</mo>\u0000 </mrow>\u0000 <annotation>$26.4%$</annotation>\u0000 </semantics></math>. The risk of not satisfying the destination's demands is reduced as well. Furthermore, in the PI context, we propose a minimax model that has been proved to increase cost equity between the considered actors. This model reduces the average difference between the costs of these actors from <span></span><math>\u0000 <semantics>\u0000 <mrow>\u0000 <mn>77</mn>\u0000 <mo>%</mo>\u0000 </mrow>\u0000 <annotation>$77%$</annotation>\u0000 </semantics></math> to <span></span><math>\u0000 <semantics>\u0000 <mrow>\u0000 <mn>4</mn>\u0000 <mo>%</mo>\u0000 </mrow>\u0000 <annotation>$4%$</annotation>\u0000 </semantics></math>.</p>","PeriodicalId":49176,"journal":{"name":"International Transactions in Operational Research","volume":"32 6","pages":"3528-3564"},"PeriodicalIF":3.1,"publicationDate":"2025-01-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144245119","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
Capacity management of forwarder with multiple carriers under uncertain flight travel time and stochastic shipment demand 不确定飞行时间和随机运输需求下多承运人货运代理的容量管理
IF 3.1 4区 管理学 Q2 MANAGEMENT Pub Date : 2025-01-28 DOI: 10.1111/itor.13613
Kannapha Amaruchkul

Consider a freight forwarder who obtains cargo space from multiple carriers. Some capacities are reserved long term in advance through allotment contracts, while some are booked on short-term daily basis. A unified mathematical program for both short- and long-term problems under uncertainties is proposed. Demands are modeled using a probability distribution as in the stochastic program, whereas flight travel times belong to an uncertainty set as in robust optimization. In the first stage, the allotments are determined. In the second stage, the shipment demand materializes but the travel time is still unknown, the forwarder determines the daily allocation among flights, given the first-stage allotment. The objective is to minimize the expected total cost in the two stages. We derive a closed-form solution for a special case, propose a heuristic for a general case, and evaluate its performance via numerical experiments, whose historical records came from one of the largest Thai forwarders.

考虑一个从多个承运人处获得货舱的货运代理。有些能力是通过分配合同提前长期保留的,而有些则是按短期每日预订的。提出了不确定条件下短期和长期问题的统一数学程序。需求在随机规划中使用概率分布建模,而飞行时间在鲁棒优化中属于不确定性集。在第一阶段,确定分配。在第二阶段,货运需求实现,但运输时间未知,货代在给定第一阶段分配的情况下确定航班之间的每日分配。目标是使这两个阶段的预期总成本最小化。我们推导了一个特殊情况下的封闭形式的解决方案,提出了一个启发式的一般情况下,并通过数值实验评估其性能,其历史记录来自泰国最大的货代之一。
{"title":"Capacity management of forwarder with multiple carriers under uncertain flight travel time and stochastic shipment demand","authors":"Kannapha Amaruchkul","doi":"10.1111/itor.13613","DOIUrl":"https://doi.org/10.1111/itor.13613","url":null,"abstract":"<p>Consider a freight forwarder who obtains cargo space from multiple carriers. Some capacities are reserved long term in advance through allotment contracts, while some are booked on short-term daily basis. A unified mathematical program for both short- and long-term problems under uncertainties is proposed. Demands are modeled using a probability distribution as in the stochastic program, whereas flight travel times belong to an uncertainty set as in robust optimization. In the first stage, the allotments are determined. In the second stage, the shipment demand materializes but the travel time is still unknown, the forwarder determines the daily allocation among flights, given the first-stage allotment. The objective is to minimize the expected total cost in the two stages. We derive a closed-form solution for a special case, propose a heuristic for a general case, and evaluate its performance via numerical experiments, whose historical records came from one of the largest Thai forwarders.</p>","PeriodicalId":49176,"journal":{"name":"International Transactions in Operational Research","volume":"32 6","pages":"3619-3666"},"PeriodicalIF":3.1,"publicationDate":"2025-01-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144245144","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
Multiobjective model to optimize charging station location for the decarbonization process in Mexico 墨西哥脱碳过程中充电站位置优化的多目标模型
IF 3.1 4区 管理学 Q2 MANAGEMENT Pub Date : 2025-01-26 DOI: 10.1111/itor.13611
Francisco Ruiz-Barajas, Elias Olivares-Benitez, Adrian Ramirez-Nafarrate, Rosa G. González-Ramírez

Electric vehicles (EVs) offer significant potential for advancing sustainable environmental goals. However, their widespread adoption has been concentrated in urban areas, raising challenges for interurban travel. In many countries, charging station networks are primarily located within cities, highlighting a key opportunity for expansion to support longer distance journeys. This article addresses the facility location problem for EV charging stations to enable interurban travel. We propose a multiobjective optimization model based on the flow refueling location model with three objectives: maximizing CO2 emissions reduction, minimizing total costs, and reducing user charging time. The model is solved using an epsilon constraint approach, and Mexico's charging station network is used as a case study. Through computational experiments, various scenarios are evaluated, and a comparative analysis is performed between electric and internal combustion vehicles. Results show that deploying 20 strategically located charging stations could mitigate 3.1 million tons of CO2, requiring an investment of nearly USD 3.9 million.

电动汽车为推进可持续环境目标提供了巨大的潜力。然而,它们的广泛采用集中在城市地区,给城市间的旅行带来了挑战。在许多国家,充电站网络主要位于城市内,这凸显了扩展以支持更长距离旅行的关键机会。本文研究了电动汽车充电站的设施选址问题,以实现城市间的出行。提出了一种基于流动加油位置模型的多目标优化模型,该模型具有CO2减排最大化、总成本最小化和用户充电时间最小化三个目标。以墨西哥充电站网络为例,采用epsilon约束方法求解该模型。通过计算实验,对各种工况进行了评估,并对电动汽车和内燃机汽车进行了对比分析。结果表明,部署20个战略位置的充电站可以减少310万吨二氧化碳,需要近390万美元的投资。
{"title":"Multiobjective model to optimize charging station location for the decarbonization process in Mexico","authors":"Francisco Ruiz-Barajas,&nbsp;Elias Olivares-Benitez,&nbsp;Adrian Ramirez-Nafarrate,&nbsp;Rosa G. González-Ramírez","doi":"10.1111/itor.13611","DOIUrl":"https://doi.org/10.1111/itor.13611","url":null,"abstract":"<p>Electric vehicles (EVs) offer significant potential for advancing sustainable environmental goals. However, their widespread adoption has been concentrated in urban areas, raising challenges for interurban travel. In many countries, charging station networks are primarily located within cities, highlighting a key opportunity for expansion to support longer distance journeys. This article addresses the facility location problem for EV charging stations to enable interurban travel. We propose a multiobjective optimization model based on the flow refueling location model with three objectives: maximizing CO<sub>2</sub> emissions reduction, minimizing total costs, and reducing user charging time. The model is solved using an epsilon constraint approach, and Mexico's charging station network is used as a case study. Through computational experiments, various scenarios are evaluated, and a comparative analysis is performed between electric and internal combustion vehicles. Results show that deploying 20 strategically located charging stations could mitigate 3.1 million tons of CO<sub>2</sub>, requiring an investment of nearly USD 3.9 million.</p>","PeriodicalId":49176,"journal":{"name":"International Transactions in Operational Research","volume":"32 6","pages":"3211-3231"},"PeriodicalIF":3.1,"publicationDate":"2025-01-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144245098","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
Rebuilding a DSS with feedback from behavioral and neuroscience studies 用行为和神经科学研究的反馈重建DSS
IF 2.9 4区 管理学 Q2 MANAGEMENT Pub Date : 2025-01-21 DOI: 10.1111/itor.13614
Evanielle Barbosa Ferreira, Tarsila Rani Soares de Vasconcelos, Lucia Reis Peixoto Roselli, Adiel Teixeira de Almeida

As the complexity of decisions and development technologies increase, decision support systems (DSSs) emerge to support decision-making and improve the system's interaction with decision-makers (DMs). Hence, this study seeks to show the modulations made in the FITradeoff (Flexible and Interactive Trade-off) DSS, highlighting its flexible and interactive nature. These modulations have been made due to findings from behavioral and neuroscience studies conducted on the FITradeoff method and represent an important advance in research in the multicriteria decision-making/aiding field. The study focuses on the main modulation made in the preference modeling process of the FITradeoff method, namely combining two paradigms for modeling preferences: elicitation by decomposition and holistic evaluation. Thus, the study discusses its implementation in the DSS, shows the flexibility this gives DMs, and highlights the two decision strategies presented in the holistic evaluation, that is, selecting the best alternative and eliminating the worst alternative.

随着决策和开发技术的复杂性的增加,决策支持系统(DSSs)出现,以支持决策并改善系统与决策者(DMs)的交互。因此,本研究旨在展示在fitradoff(灵活和互动权衡)决策支持系统中所做的调制,突出其灵活和互动的性质。这些调整是基于对fitradoff方法进行的行为和神经科学研究的发现,代表了多标准决策/辅助领域研究的重要进展。重点研究了FITradeoff方法在偏好建模过程中所做的主要调制,即结合了分解启发和整体评价两种建模偏好的范式。因此,本研究讨论了其在决策支持系统中的实施,展示了这给决策管理人员带来的灵活性,并强调了在整体评估中提出的两种决策策略,即选择最佳方案和消除最差方案。
{"title":"Rebuilding a DSS with feedback from behavioral and neuroscience studies","authors":"Evanielle Barbosa Ferreira,&nbsp;Tarsila Rani Soares de Vasconcelos,&nbsp;Lucia Reis Peixoto Roselli,&nbsp;Adiel Teixeira de Almeida","doi":"10.1111/itor.13614","DOIUrl":"https://doi.org/10.1111/itor.13614","url":null,"abstract":"<p>As the complexity of decisions and development technologies increase, decision support systems (DSSs) emerge to support decision-making and improve the system's interaction with decision-makers (DMs). Hence, this study seeks to show the modulations made in the FITradeoff (Flexible and Interactive Trade-off) DSS, highlighting its flexible and interactive nature. These modulations have been made due to findings from behavioral and neuroscience studies conducted on the FITradeoff method and represent an important advance in research in the multicriteria decision-making/aiding field. The study focuses on the main modulation made in the preference modeling process of the FITradeoff method, namely combining two paradigms for modeling preferences: elicitation by decomposition and holistic evaluation. Thus, the study discusses its implementation in the DSS, shows the flexibility this gives DMs, and highlights the two decision strategies presented in the holistic evaluation, that is, selecting the best alternative and eliminating the worst alternative.</p>","PeriodicalId":49176,"journal":{"name":"International Transactions in Operational Research","volume":"33 4","pages":"2759-2780"},"PeriodicalIF":2.9,"publicationDate":"2025-01-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"146148195","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
Bi-objective minimization of energy consumption and cycle time for the robotic assembly line balancing problem: pseudo-polynomial case and reduced search space metaheuristic 机器人装配线平衡问题的能量消耗和周期时间双目标最小化:伪多项式情形和简化搜索空间元启发式
IF 2.9 4区 管理学 Q2 MANAGEMENT Pub Date : 2025-01-21 DOI: 10.1111/itor.13610
Youssef Lahrichi, Samia Chehbi Gamoura, David Damand, Marc Barth

Energy consumption and cycle time are two contradictory optimization objectives for the robotic assembly line balancing problem (RALBP). Indeed, minimizing the cycle time leads to choosing the fastest robots, while minimizing the energy consumption leads to choosing the robots with the smallest powers. In the context of RALBP, cycle time minimization has been extensively studied while energy minimization has been much less considered. Studies dealing with simultaneous minimization of the two later are even scarcer. A bi-objective RALBP considering simultaneous minimization of cycle time and energy consumption is studied in this paper. The energy consumption is calculated based on recent papers from the literature. It includes energy consumed during both operation time and idle time. In this paper, a pseudo-polynomial case is solved thanks to an exact algorithm called split. This latter enumerates all Pareto-optimal solutions corresponding to a given giant sequence of operations. Split is then used as a decoder in a metaheuristic operating in a reduced search space where giant sequences encode solutions. An experimental study is performed on instances taken from the literature to test the suggested encoding–decoding scheme. It shows that the suggested approach yields competitive results compared to the literature.

在机器人装配线平衡问题(RALBP)中,能量消耗和周期时间是两个相互矛盾的优化目标。事实上,最小化周期时间导致选择最快的机器人,最小化能耗导致选择功率最小的机器人。在RALBP的背景下,周期时间最小化得到了广泛的研究,而能量最小化却很少被考虑。后来处理两者同时最小化的研究就更少了。研究了同时考虑循环时间和能量消耗最小化的双目标RALBP算法。能源消耗是根据最近的文献计算得出的。它包括运行时间和空闲时间消耗的能量。在本文中,利用一种称为split的精确算法解决了一种伪多项式情况。后者列举了与给定的巨大操作序列相对应的所有帕累托最优解。然后,Split被用作元启发式解码器,在减少的搜索空间中操作,其中大序列编码解决方案。实验研究是从文献中采取的实例来测试建议的编解码方案。这表明,与文献相比,建议的方法产生了具有竞争力的结果。
{"title":"Bi-objective minimization of energy consumption and cycle time for the robotic assembly line balancing problem: pseudo-polynomial case and reduced search space metaheuristic","authors":"Youssef Lahrichi,&nbsp;Samia Chehbi Gamoura,&nbsp;David Damand,&nbsp;Marc Barth","doi":"10.1111/itor.13610","DOIUrl":"https://doi.org/10.1111/itor.13610","url":null,"abstract":"<p>Energy consumption and cycle time are two contradictory optimization objectives for the robotic assembly line balancing problem (RALBP). Indeed, minimizing the cycle time leads to choosing the fastest robots, while minimizing the energy consumption leads to choosing the robots with the smallest powers. In the context of RALBP, cycle time minimization has been extensively studied while energy minimization has been much less considered. Studies dealing with simultaneous minimization of the two later are even scarcer. A bi-objective RALBP considering simultaneous minimization of cycle time and energy consumption is studied in this paper. The energy consumption is calculated based on recent papers from the literature. It includes energy consumed during both operation time and idle time. In this paper, a pseudo-polynomial case is solved thanks to an exact algorithm called split. This latter enumerates all Pareto-optimal solutions corresponding to a given giant sequence of operations. Split is then used as a decoder in a metaheuristic operating in a reduced search space where giant sequences encode solutions. An experimental study is performed on instances taken from the literature to test the suggested encoding–decoding scheme. It shows that the suggested approach yields competitive results compared to the literature.</p>","PeriodicalId":49176,"journal":{"name":"International Transactions in Operational Research","volume":"33 4","pages":"2731-2758"},"PeriodicalIF":2.9,"publicationDate":"2025-01-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"146148196","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
Comparative analysis of product and network supply chain resilience 产品与网络供应链弹性的比较分析
IF 2.9 4区 管理学 Q2 MANAGEMENT Pub Date : 2025-01-19 DOI: 10.1111/itor.13612
Dmitry Ivanov

Supply chain resilience has been extensively investigated at the network and firm levels. More granular studies at the level of product supply chain resilience are scarce. In this paper, we examine relationships between product supply chain resilience, firm resilience, and network resilience. We simulate supply chains with two products in different settings of structural and process diversity, connectivity, and flexibility. The methodology is based on discrete-event simulation. The focus of the analysis is on managerial insights. Our main insights show that the resilience of product supply chains depends on the firm and network resilience, and higher firm and network resilience do not always automatically translate into higher resilience at the product level. Managerial implications are discussed and generalized. The outcomes of our study can be used by supply chain and operations managers to improve the resilience of supply chain with consideration of both product and network levels. We contribute to the literature by offering novel insights on the interrelations between firm and network resilience practices and product supply chain resilience.

供应链弹性已经在网络和公司层面进行了广泛的研究。在产品供应链弹性水平上进行更细致的研究是稀缺的。本文研究了产品供应链弹性、企业弹性和网络弹性之间的关系。我们在结构和流程多样性、连接性和灵活性的不同设置中模拟两种产品的供应链。该方法基于离散事件模拟。分析的重点是管理洞察力。我们的主要见解表明,产品供应链的弹性取决于企业和网络弹性,而更高的企业和网络弹性并不总是自动转化为更高的产品层面的弹性。对管理的影响进行了讨论和概括。我们的研究结果可以被供应链和运营管理者用来提高供应链的弹性,同时考虑产品和网络两个层面。我们通过对公司和网络弹性实践与产品供应链弹性之间的相互关系提供新颖的见解来贡献文献。
{"title":"Comparative analysis of product and network supply chain resilience","authors":"Dmitry Ivanov","doi":"10.1111/itor.13612","DOIUrl":"https://doi.org/10.1111/itor.13612","url":null,"abstract":"<p>Supply chain resilience has been extensively investigated at the network and firm levels. More granular studies at the level of product supply chain resilience are scarce. In this paper, we examine relationships between product supply chain resilience, firm resilience, and network resilience. We simulate supply chains with two products in different settings of structural and process diversity, connectivity, and flexibility. The methodology is based on discrete-event simulation. The focus of the analysis is on managerial insights. Our main insights show that the resilience of product supply chains depends on the firm and network resilience, and higher firm and network resilience do not always automatically translate into higher resilience at the product level. Managerial implications are discussed and generalized. The outcomes of our study can be used by supply chain and operations managers to improve the resilience of supply chain with consideration of both product and network levels. We contribute to the literature by offering novel insights on the interrelations between firm and network resilience practices and product supply chain resilience.</p>","PeriodicalId":49176,"journal":{"name":"International Transactions in Operational Research","volume":"33 4","pages":"2358-2376"},"PeriodicalIF":2.9,"publicationDate":"2025-01-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://onlinelibrary.wiley.com/doi/epdf/10.1111/itor.13612","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"146148155","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}
引用次数: 0
The K $K$ -prize-collecting coverage problem by aligned disks 对齐磁盘的K$ K$奖收集覆盖率问题
IF 2.9 4区 管理学 Q2 MANAGEMENT Pub Date : 2025-01-19 DOI: 10.1111/itor.13608
Hao Zhang, Xiya Zheng, Zhonghao Liu, Xiaofei Liu
<p>In this paper, we study the <span></span><math> <semantics> <mi>K</mi> <annotation>$K$</annotation> </semantics></math>-prize-collecting coverage problem by using aligned disks. Suppose <span></span><math> <semantics> <mi>U</mi> <annotation>$U$</annotation> </semantics></math> is a set of users, <span></span><math> <semantics> <mi>L</mi> <annotation>$L$</annotation> </semantics></math> is a horizontal line on the plane, and <span></span><math> <semantics> <mi>S</mi> <annotation>$S$</annotation> </semantics></math> is a set of points on the line <span></span><math> <semantics> <mi>L</mi> <annotation>$L$</annotation> </semantics></math>, where each user corresponds to a coordinate point, with an associated profit and an uncovered penalty. The problem is to select a set <span></span><math> <semantics> <msup> <mi>D</mi> <mo>′</mo> </msup> <annotation>$mathcal {D}^{prime }$</annotation> </semantics></math> of disks whose centers are all in <span></span><math> <semantics> <mi>S</mi> <annotation>$S$</annotation> </semantics></math> such that the total profit of the users covered by <span></span><math> <semantics> <msup> <mi>D</mi> <mo>′</mo> </msup> <annotation>$mathcal {D}^{prime }$</annotation> </semantics></math> is at least <span></span><math> <semantics> <mi>K</mi> <annotation>$K$</annotation> </semantics></math>, and the objective value, which consists of the total cost of the disks in <span></span><math> <semantics> <msup> <mi>D</mi> <mo>′</mo> </msup> <annotation>$mathcal {D}^{prime }$</annotation> </semantics></math> plus the total penalty of the uncovered users in <span></span><math> <semantics> <mrow> <mi>U</mi> <mo>∖</mo> <mi>U</mi> <mo>(</mo> <msup> <mi>D</mi> <mo>′</mo> </msup> <mo>)</mo> </mrow> <annotation>$Usetminus U(mathcal {D}^{prime })$</annotation> </semantics></math>, is minimized, where the cost of disk <span></span><math> <semantics> <mi>D</mi> <annotation>$D$</annotation> </semantics></math> is <span></span><math> <semantics> <mrow>
在本文中,我们研究了使用对齐磁盘的K $K$ -奖收集覆盖问题。假设U $U$是一组用户,L $L$是平面上的一条水平线,S $S$是直线L $L$上的一组点,其中每个用户对应于一个坐标点,具有相关的利润和未覆盖的惩罚。问题是选择一个磁盘集D ' $mathcal {D}^{prime }$,其中心都在S $S$,使得D ' $mathcal {D}^{prime }$覆盖的用户的总利润至少为K$K$,目标值,它由D ' $mathcal {D}^{prime }$中磁盘的总成本加上U∈U (D ') $Usetminus U(mathcal {D}^{prime })$中未覆盖用户的总惩罚组成,是最小的,其中磁盘D $D$的成本为r (D) α $r(D)^{alpha }$,α≥1 $alpha ge 1$为衰减因子,r (D) $r(D)$为圆盘D半径$D$,K $K$是一个给定的利润界。我们首先证明了这个问题是np $NP$ -hard的,即使所有用户都位于L线上$L$, α = 1 $alpha =1$,每个用户的惩罚为0。提出了一种伪多项式时间算法。最后,我们给出了该问题的全多项式时间逼近格式。
{"title":"The \u0000 \u0000 K\u0000 $K$\u0000 -prize-collecting coverage problem by aligned disks","authors":"Hao Zhang,&nbsp;Xiya Zheng,&nbsp;Zhonghao Liu,&nbsp;Xiaofei Liu","doi":"10.1111/itor.13608","DOIUrl":"https://doi.org/10.1111/itor.13608","url":null,"abstract":"&lt;p&gt;In this paper, we study the &lt;span&gt;&lt;/span&gt;&lt;math&gt;\u0000 &lt;semantics&gt;\u0000 &lt;mi&gt;K&lt;/mi&gt;\u0000 &lt;annotation&gt;$K$&lt;/annotation&gt;\u0000 &lt;/semantics&gt;&lt;/math&gt;-prize-collecting coverage problem by using aligned disks. Suppose &lt;span&gt;&lt;/span&gt;&lt;math&gt;\u0000 &lt;semantics&gt;\u0000 &lt;mi&gt;U&lt;/mi&gt;\u0000 &lt;annotation&gt;$U$&lt;/annotation&gt;\u0000 &lt;/semantics&gt;&lt;/math&gt; is a set of users, &lt;span&gt;&lt;/span&gt;&lt;math&gt;\u0000 &lt;semantics&gt;\u0000 &lt;mi&gt;L&lt;/mi&gt;\u0000 &lt;annotation&gt;$L$&lt;/annotation&gt;\u0000 &lt;/semantics&gt;&lt;/math&gt; is a horizontal line on the plane, and &lt;span&gt;&lt;/span&gt;&lt;math&gt;\u0000 &lt;semantics&gt;\u0000 &lt;mi&gt;S&lt;/mi&gt;\u0000 &lt;annotation&gt;$S$&lt;/annotation&gt;\u0000 &lt;/semantics&gt;&lt;/math&gt; is a set of points on the line &lt;span&gt;&lt;/span&gt;&lt;math&gt;\u0000 &lt;semantics&gt;\u0000 &lt;mi&gt;L&lt;/mi&gt;\u0000 &lt;annotation&gt;$L$&lt;/annotation&gt;\u0000 &lt;/semantics&gt;&lt;/math&gt;, where each user corresponds to a coordinate point, with an associated profit and an uncovered penalty. The problem is to select a set &lt;span&gt;&lt;/span&gt;&lt;math&gt;\u0000 &lt;semantics&gt;\u0000 &lt;msup&gt;\u0000 &lt;mi&gt;D&lt;/mi&gt;\u0000 &lt;mo&gt;′&lt;/mo&gt;\u0000 &lt;/msup&gt;\u0000 &lt;annotation&gt;$mathcal {D}^{prime }$&lt;/annotation&gt;\u0000 &lt;/semantics&gt;&lt;/math&gt; of disks whose centers are all in &lt;span&gt;&lt;/span&gt;&lt;math&gt;\u0000 &lt;semantics&gt;\u0000 &lt;mi&gt;S&lt;/mi&gt;\u0000 &lt;annotation&gt;$S$&lt;/annotation&gt;\u0000 &lt;/semantics&gt;&lt;/math&gt; such that the total profit of the users covered by &lt;span&gt;&lt;/span&gt;&lt;math&gt;\u0000 &lt;semantics&gt;\u0000 &lt;msup&gt;\u0000 &lt;mi&gt;D&lt;/mi&gt;\u0000 &lt;mo&gt;′&lt;/mo&gt;\u0000 &lt;/msup&gt;\u0000 &lt;annotation&gt;$mathcal {D}^{prime }$&lt;/annotation&gt;\u0000 &lt;/semantics&gt;&lt;/math&gt; is at least &lt;span&gt;&lt;/span&gt;&lt;math&gt;\u0000 &lt;semantics&gt;\u0000 &lt;mi&gt;K&lt;/mi&gt;\u0000 &lt;annotation&gt;$K$&lt;/annotation&gt;\u0000 &lt;/semantics&gt;&lt;/math&gt;, and the objective value, which consists of the total cost of the disks in &lt;span&gt;&lt;/span&gt;&lt;math&gt;\u0000 &lt;semantics&gt;\u0000 &lt;msup&gt;\u0000 &lt;mi&gt;D&lt;/mi&gt;\u0000 &lt;mo&gt;′&lt;/mo&gt;\u0000 &lt;/msup&gt;\u0000 &lt;annotation&gt;$mathcal {D}^{prime }$&lt;/annotation&gt;\u0000 &lt;/semantics&gt;&lt;/math&gt; plus the total penalty of the uncovered users in &lt;span&gt;&lt;/span&gt;&lt;math&gt;\u0000 &lt;semantics&gt;\u0000 &lt;mrow&gt;\u0000 &lt;mi&gt;U&lt;/mi&gt;\u0000 &lt;mo&gt;∖&lt;/mo&gt;\u0000 &lt;mi&gt;U&lt;/mi&gt;\u0000 &lt;mo&gt;(&lt;/mo&gt;\u0000 &lt;msup&gt;\u0000 &lt;mi&gt;D&lt;/mi&gt;\u0000 &lt;mo&gt;′&lt;/mo&gt;\u0000 &lt;/msup&gt;\u0000 &lt;mo&gt;)&lt;/mo&gt;\u0000 &lt;/mrow&gt;\u0000 &lt;annotation&gt;$Usetminus U(mathcal {D}^{prime })$&lt;/annotation&gt;\u0000 &lt;/semantics&gt;&lt;/math&gt;, is minimized, where the cost of disk &lt;span&gt;&lt;/span&gt;&lt;math&gt;\u0000 &lt;semantics&gt;\u0000 &lt;mi&gt;D&lt;/mi&gt;\u0000 &lt;annotation&gt;$D$&lt;/annotation&gt;\u0000 &lt;/semantics&gt;&lt;/math&gt; is &lt;span&gt;&lt;/span&gt;&lt;math&gt;\u0000 &lt;semantics&gt;\u0000 &lt;mrow&gt;\u0000","PeriodicalId":49176,"journal":{"name":"International Transactions in Operational Research","volume":"33 4","pages":"2688-2708"},"PeriodicalIF":2.9,"publicationDate":"2025-01-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"146148118","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
期刊
International Transactions in Operational Research
全部 Acc. Chem. Res. ACS Applied Bio Materials ACS Appl. Electron. Mater. ACS Appl. Energy Mater. ACS Appl. Mater. Interfaces ACS Appl. Nano Mater. ACS Appl. Polym. Mater. ACS BIOMATER-SCI ENG ACS Catal. ACS Cent. Sci. ACS Chem. Biol. ACS Chemical Health & Safety ACS Chem. Neurosci. ACS Comb. Sci. ACS Earth Space Chem. ACS Energy Lett. ACS Infect. Dis. ACS Macro Lett. ACS Mater. Lett. ACS Med. Chem. Lett. ACS Nano ACS Omega ACS Photonics ACS Sens. ACS Sustainable Chem. Eng. ACS Synth. Biol. Anal. Chem. BIOCHEMISTRY-US Bioconjugate Chem. BIOMACROMOLECULES Chem. Res. Toxicol. Chem. Rev. Chem. Mater. CRYST GROWTH DES ENERG FUEL Environ. Sci. Technol. Environ. Sci. Technol. Lett. Eur. J. Inorg. Chem. IND ENG CHEM RES Inorg. Chem. J. Agric. Food. Chem. J. Chem. Eng. Data J. Chem. Educ. J. Chem. Inf. Model. J. Chem. Theory Comput. J. Med. Chem. J. Nat. Prod. J PROTEOME RES J. Am. Chem. Soc. LANGMUIR MACROMOLECULES Mol. Pharmaceutics Nano Lett. Org. Lett. ORG PROCESS RES DEV ORGANOMETALLICS J. Org. Chem. J. Phys. Chem. J. Phys. Chem. A J. Phys. Chem. B J. Phys. Chem. C J. Phys. Chem. Lett. Analyst Anal. Methods Biomater. Sci. Catal. Sci. Technol. Chem. Commun. Chem. Soc. Rev. CHEM EDUC RES PRACT CRYSTENGCOMM Dalton Trans. Energy Environ. Sci. ENVIRON SCI-NANO ENVIRON SCI-PROC IMP ENVIRON SCI-WAT RES Faraday Discuss. Food Funct. Green Chem. Inorg. Chem. Front. Integr. Biol. J. Anal. At. Spectrom. J. Mater. Chem. A J. Mater. Chem. B J. Mater. Chem. C Lab Chip Mater. Chem. Front. Mater. Horiz. MEDCHEMCOMM Metallomics Mol. Biosyst. Mol. Syst. Des. Eng. Nanoscale Nanoscale Horiz. Nat. Prod. Rep. New J. Chem. Org. Biomol. Chem. Org. Chem. Front. PHOTOCH PHOTOBIO SCI PCCP Polym. Chem.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1