检索结果-内蒙古大学图书馆

Mathematical models and heuristics for double-load crane scheduling in slab yards

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH 2025年第3期324卷 773-786页

作者： Dong, Zixiong Che, Ada Feng, Jianguang Northwestern Polytech Univ Sch Management Xian 710072 Peoples R China

This paper studies a novel crane scheduling problem with unconstrained double-load operations (CSP-UDL) in slab yards. It aims to optimize the sequence of crane operations to minimize makespan. Unlike conventional crane operations, which handle one or two slabs per trip, the unconstrained double-load operation enables the transport of more than two slabs in a single trip, thereby improving logistic efficiency and reducing the makespan. To tackle this problem, we propose two mixed integer linear programming (MILP) models for solving small-and medium-sized instances. We develop two heuristics for large-sized instances: a hybrid heuristic and a matheuristic. The hybrid heuristic integrates tabu search within an adaptive large neighborhood search (ALNS) framework, while the matheuristic integrates this hybrid heuristic with an MILP model, leveraging the strengths of both exact and heuristic methods. Extensive computational experiments demonstrate that while the proposed MILP models can exactly solve instances with up to 50 tasks, the hybrid heuristic and the matheuristic demonstrate robust performance in solving large-sized instances.

关键词： Slab yard Crane scheduling Double-load operation mixed integer linear programming Heuristic

来源：评论

学校读者我要写书评

暂无评论

Seniority-based surgery scheduling and team assignment

引用

SADHANA-ACADEMY PROCEEDINGS IN ENGINEERING SCIENCES 2025年第2期50卷 1-8页

作者： Didem Batur Sir, G. Oner, Nurhan Erol, Serpil Gazi Univ Fac Engn Dept Ind Engn Ankara Turkiye Gen Directorate PTT Ankara Turkiye

Crucial resources for surgical operations are obviously operating rooms and surgical teams. It is essential to ensure the equitable assignment of operations to both operating rooms and surgical teams, taking into account the capacities, resting periods, and cleaning times. Additionally, the varying levels of expertise required for different types of surgeries should be considered. In this study, we focus on these challenges within the context of surgery scheduling and team assignment problems. We propose a mathematical model-based solution approach for operating room planning that aligns surgical teams with the specific requirements of various procedures, consistent with real life applications. Key considerations include appropriate workload distribution, sufficient rest times, and opportunities for surgeon training. By utilizing the methodology presented in this study, we effectively assign daily planned operations to the appropriate operating rooms and surgical teams. The proposed procedure is successfully applied to real data from the otorhinolaryngology department of a public hospital, as well as to randomly generated test problems. This study provides exact solutions for the aforementioned surgery scheduling and team assignment issues.

关键词： Operating room scheduling surgical team assignment surgery types surgeon seniority mixed integer linear programming

来源：评论

学校读者我要写书评

暂无评论

Transport capacity analysis for sharing-corridor metro lines under virtual coupling

引用

COMPUTERS & INDUSTRIAL ENGINEERING 2024年 192卷

作者： Wang, Pengling Ge, Jianhao Xiao, Xiaofang Ye, Yutao Lu, Miaojia Tongji Univ Coll Transportat Engn Shanghai Peoples R China Tongji Univ Key Lab Rd & Traff Engn Minist Educ Shanghai Peoples R China Tongji Univ Shanghai Key Lab Rail Infrastruct Durabil & Syst S Shanghai Peoples R China Tongji Univ Shanghai Colabrat Innovat Res Ctr Multinetwork & M Shanghai Peoples R China

In this study, a method is proposed to analyse the capacity improvement ability of using virtual coupling technology to the sharing -corridor metro lines for solving the problem of capacity bottleneck. A mixed integer linear programming model is developed to optimise the train timetable of sharing -corridor lines under the assumption of using the virtual coupling technology, considering the constraints related to train timetabling, virtual coupling technology, and passenger assignment, with the objective to improve the service quality. The model adopts the departure times, arrival times, and whether each train service is planned as virtually coupled, with its adjacent front one or the following one, as decision variables. Furthermore, a method is proposed to evaluate the capacity utilisation referring to UIC 406 and considering the feature of virtual coupling technology. The experiments on Shanghai Metro Line 3 and Line 4 are implemented to verify the effectiveness on transport capacity and passenger service quality of the proposed method. The results show that using virtual coupling technology can launch eight more train services during morning peak hours and at most reduce passengers' waiting time by 73.8 s.

关键词： Metro timetable optimisation Virtual coupling mixed integer linear programming Capacity analysis

来源：评论

学校读者我要写书评

暂无评论

A Customized Local Energy Trading Approach Using a Comprehensive Set of Performance Indices

引用

IEEE ACCESS 2025年 13卷 9413-9429页

作者： Patnaik, Smitali Cali, Umit Noras, Maciej A. Univ North Carolina Charlotte Dept Engn Technol & Construct Management Charlotte NC 28223 USA Norwegian Univ Sci & Technol NTNU Dept Elect Power Engn N-7491 Trondheim Norway Univ York Sch Phys Engn & Technol York YO10 5DD England

This paper presents a customized local energy trading approach using a comprehensive set of performance indices (i.e. Community Savings, Self-Consumption, Self-Sufficiency, Fairness Index, Individual Household Savings) for evaluation of the trading practices. The simulations performed on historical data sets compared dispatch mechanisms based on mixed integer linear programming (MILP) and techniques originating from Auction-Based approaches. The intent was to use performance metrics in building Local Energy Market (LEM) trading solutions based on a given set of limited inputs and use them to optimize pricing or trading dispatch to get the best consumer returns. Modeling results indicate that the Auction-Based Model performed better than the MILP methods in terms of all performance indices and had potential to provide participants with higher levels of savings.

关键词： Pricing Batteries Indexes Costs Resource management Peer-to-peer computing Optimization Load modeling Electricity Data models Distributed energy resources mixed integer linear programming auction peer-to-peer energy trading optimization photovoltaic self-sufficiency self-consumption fairness index

来源：评论

学校读者我要写书评

暂无评论

Optimal Transmission Switching for Congestion Management and Cost Reduction Using linearized AC Optimal Power Flow

引用

INTERNATIONAL TRANSACTIONS ON ELECTRICAL ENERGY SYSTEMS 2025年第1期2025卷

作者： Habibi, Mohammad Zangeneh, Ali Shahid Rajaee Teacher Training Univ Elect Engn Dept Tehran Iran Kharazmi Univ Elect & Comp Engn Dept Tehran Iran

Several approaches have been introduced to manage congestion in transmission lines while simultaneously reducing the generation cost of power systems. Two of these approaches, namely, generation rescheduling and transmission switching are used together in this article. Changing the system topology through optimal transmission switching (OTS) is an important and active research area in power systems for this purpose. Essentially, OTS is a mixed-integer nonlinear programming (MINLP) problem that is inherently nonlinear and nonconvex. Therefore, solving this nonlinear problem poses significant challenges for researchers. On one hand, there is no guarantee of reaching a global optimal solution, and on the other hand, issues such as the lack of convergence and increased solution time have made it difficult to solve the OTS problem. linearizing the OTS problem provides a guaranteed method for reaching a comprehensive optimal solution. This study presents a new linear mathematical model for the OTS problem. The proposed model is solved using mixed-integer linear programming (MILP), which accurately determines the opening or closing status of transmission lines and the number of lines that should be opened to reduce the generation and congestion costs in the network. To this aim, a linear programming and piecewise approximation, along with Taylor's series approximation method, is used to linearize the generation cost function, and AC optimal power flow equations. To reduce the solution time of the OTS problem without losing accuracy, a congestion cost index is used based on decreasing the total congestion cost of transmission lines, as well as the production cost of generators. The proposed model is implemented on IEEE 9-bus and IEEE 118-bus standard test systems. Also, in order to analyze the reliability of the system before and after switching, two methods of contingency analysis and calculation of the LOLP index have been used. The obtained results show that transmission

关键词： congestion management linearizing methods mixed integer linear programming transmission switching

来源：评论

学校读者我要写书评

暂无评论

Graph-Based Genetic Algorithm for Localization of Multiple Existing Leakages in Water Distribution Networks

引用

JOURNAL OF WATER RESOURCES PLANNING AND MANAGEMENT 2025年第1期151卷

作者： Oberascher, Martin Minaei, Amin Sitzenfrei, Robert Univ Innsbruck Dept Infrastruct Engn Unit Environm Engn Tech Str 13 A-6020 Innsbruck Austria

Water utility operators prioritize timely repairs of leakages, an activity that refers to a challenging task by the spatial localization of multiple existing leakages within a water distribution network (WDN). In the literature, genetic algorithms (GAs) are applied to find the best combinations of leakages, typically in combination with a reduced number of candidate leakage nodes to reduce computational effort. To address this limitation, a graph-based GA is proposed in this work by considering the topological relationship between the leakage candidate nodes and sizes for the creation of the offspring. In greater detail, each gene in the graph-based GA consists of a leakage place and leakage size, and two random genes are selected based on the roulette wheel selection for the creation of the offspring. Afterward, possible offspring nodes are selected within the shortest path between these two leakage places or in spatial proximity connected to the shortest path, where the leakage size is set to a random value between the leakage sizes of the two genes. The developed approach was tested on part of a WDN with 100 different leakage scenarios and varying number of leakages, sizes, and locations. As the results showed, the graph-based GA significantly improved leakage localization compared with a classic GA and linear programming solver, with a median distance of 44 m between suspected and actual leakage locations given perfect conditions while also being computationally efficient. However, the achievable performance was strongly affected by measurement errors, model uncertainties, and partially unknown nodal demands and was more accurate for localizing leakage places near exactly measured locations and with larger leakage sizes.

关键词： Leakage localization mixed integer linear programming Optimization Parameter uncertainty Water distribution network (WDN)

来源：评论

学校读者我要写书评

暂无评论

Order acceptance and scheduling under eligibility, availability, and budget constraints in distributed heterogeneous flow shop production

引用

EXPERT SYSTEMS WITH APPLICATIONS 2025年 280卷

作者： Xiong, Fuli Jing, Lin Xiang, Chengfei Han, Yitong Xian Univ Architecture & Technol Sch Informat & Control Engn Xian 710055 Peoples R China

The distributed manufacturing model enhances production flexibility and efficiency. This study investigates the order acceptance and scheduling problem in distributed heterogeneous factories while considering constraints including order-to-factory eligibility, processing time availability, and budget limitations, with the objective of maximizing total profit. The problem involves four interrelated decisions: order selection, allocation, sequencing, and scheduling. To address this, we formulate a Manne-based mixed-integer linear programming (MILP) model and a constraint programming (CP) model. However, these methods become computationally impractical for large instances. To improve efficiency, we develop three logic-based Benders decomposition (LBBD) algorithms that iteratively solve a master problem (MP) for order acceptance and allocation and subproblems (SPs) for scheduling within each factory. A local search (LS) algorithm is integrated to enhance solution quality and convergence speed. Experimental results validate the effectiveness of the proposed approach. For small-scale instances, our method achieves optimality where MILP and CP fail. In large-scale cases, it reduces the optimality gap by 54.2% and 100% across two scenarios while cutting solution time by 20.6%, 84.2%, and 98.3% in three scenarios. Applied to real-world scenarios, it increases total profit by 4.9%, confirming its practical value. These results demonstrate that the proposed LBBD framework significantly outperforms MILP and CP, solving larger instances efficiently with superior solution quality. Additionally, sensitivity analysis highlights key trade-offs in due date flexibility, budget constraints, and order distribution for optimizing scheduling performance.

关键词： Order acceptance and scheduling Logic-based Benders decomposition Constraint programming mixed integer linear programming Local search

来源：评论

学校读者我要写书评

暂无评论

Optimizing battery storage for sustainable energy communities: A multi-scenario analysis

引用

SUSTAINABLE CITIES AND SOCIETY 2025年 118卷

作者： Guo, Feng Gomes, Luis Ma, Ling Tian, Zhiyong Vale, Zita Pang, Shiyuan Huazhong Univ Sci & Technol Natl Ctr Technol Innovat Digital Construct Wuhan 430074 Peoples R China Huazhong Univ Sci & Technol Sch Civil & Hydraul Engn Wuhan 430074 Peoples R China Polytech Porto LASI Intelligent Syst Associate Lab GECAD Res Grp Intelligent Engn & Comp Adv Innovat Porto Portugal Huazhong Univ Sci & Technol Sch Environm Sci & Engn Wuhan 430074 Peoples R China Huazhong Univ Sci & Technol Sch Environm Sci & Engn Hubei Key Lab Multimedia Pollut Cooperat Control Y Wuhan 430074 Peoples R China Huadian Jinsha River Upstream Hydropower Dev Co Lt Chengdu 610041 Peoples R China

The Energy Community (EC) is expanding worldwide, with Solar Photovoltaic (PV) systems as the primary Renewable Energy Source (RES). However, "solar curtailment" challenges the European Union's 2030 Target of achieving 45 % renewables in final energy consumption. Peer-to-peer (P2P) energy sharing and Battery Energy Storage Systems (BESS) sharing can improve the RES share more effectively, but they face obstacles like high costs and low utilisation rates. This research develops a hybrid model that combines P2P energy sharing with BESS, optimised using mixed integer linear programming (MILP). A new pricing mechanism for P2P transactions and refined Shapley value calculations are introduced. Simulations conducted over 672 h across four seasons and 21,147 scenarios demonstrate that all proposed models effectively increase the renewable energy share. SBES-S and OCBES-S models are the most economical in spring and summer, with EC costs of -13.028 and -55.578. The OCBES-S model is the most cost-effective for autumn and the year, costing 92.998 and 174.101, respectively. Compared to the scenario without BESS and P2P sharing, it reduces annual electricity costs by 16.34 %. This study provides all EC stakeholders with a tool for option comparison and economic analysis, supporting the sustainable development of EC and renewable energy.

关键词： Energy community Battery energy storage systems Peer to peer mixed integer linear programming Renewable energy Sustainable development

来源：评论

学校读者我要写书评

暂无评论

Multi-Agent Grouping and Routing with Cooperative Tasks

引用

JOURNAL OF AEROSPACE INFORMATION SYSTEMS 2025年第3期22卷 163-176页

作者： Choi, Euihyeon Ahn, Jaemyung Korea Adv Inst Sci & Technol KAIST Dept Aerosp Engn 291 Daehak Ro Daejeon 34141 South Korea

This paper introduces a grouping and routing problem of multiple agents for cooperative missions. The introduced problem, referred to as the Vehicle Grouping and Routing Problem with Profits, aims to maximize the total reward obtained by conducting a multi-agent mission (e.g., cooperative reconnaissance) while reducing its makespan by appropriately grouping the agents and determining their routes under operational constraints (e.g., fuel, endurance). A mixed-integer linear programming formulation and a conservative column generation-based solution procedure for the problem are proposed. A case study with homogeneous and heterogeneous agents and numerical experiments involving a cooperative reconnaissance mission with multiple unmanned aerial vehicles demonstrate the validity of the proposed formulation and solution procedure.

关键词： Unmanned Aerial Vehicle mixed integer linear programming Optimization Algorithm Flight Dynamics Autonomous Technology Planetary Science and Exploration Aerospace Engineering

来源：评论

学校读者我要写书评

暂无评论

Analysis of the inter-city shared mobility system based on autonomous electric vehicles

引用

RENEWABLE ENERGY 2025年 239卷

作者： Wang, Peng Jiang, Han Cui, Yanlei Zhao, Mingming Ren, Yilong Xu, Liang Beihang Univ Hangzhou Innovat Inst Beijing Peoples R China Beihang Univ Sch Transportat Sci & Engn Beijing Peoples R China Beihang Univ State Key Lab Intelligent Transportat Syst Beijing Peoples R China Xidian Univ State Key Lab Integrated Serv Networks Xian Peoples R China Xidian Univ Hangzhou Inst Technol Hangzhou Peoples R China

While autonomous electric vehicles (AEVs) have been preliminarily implemented in shared travel services from both technical and theoretical perspectives, challenges such as dispersed fleets, limited service quality, and travel safety concerns have confined existing research to intra-city shared mobility, with few studies focusing on inter-city shared mobility for AEVs. With China's metropolitan regions expanding and intercity travel rapidly increasing, examining the use of shared autonomous electric vehicles (SAEVs) for intercity travel is essential for future transportation systems. To address this issue, this study models the inter-city shared mobility problem utilizing mixed integer linear programming. The problem is defined on a directed graph and addressed using a variable neighborhood search algorithm. Numerical experiments are designed based on the actual shared mobility data between Yinchuan and Shizuishan, Ningxia Province, China. From the perspective of the operating platform, the potential influencing factors of the inter-city shared mobility system are analyzed, including passenger travel demand, fleet size, vehicle range, and the number of charging stations. The results demonstrate that increasing temporal and spatial imbalance in passenger travel demand and excessive fleet size will lead to lower total revenue of the operation platform. Conversely, within certain thresholds, increasing the number of charging stations, vehicle range, and fleet size will increase the total revenue. Continuing to increase the number of charging stations and vehicle range has no significant effect on total revenue and service rate but will lead to a waste of basic resources. The study is expected to provide solution for building an inter-city shared mobility system based on SAEVs. By fully understanding the system's limitations and advantages, we aim to provide a reference template for constructing future inter-city shared mobility systems.

关键词： Shared autonomous electric vehicle Inter-city shared mobility system mixed integer linear programming Variable neighborhood search

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：