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

Flight rescheduling of an airline under the ground delay program considering delay propagation in multiple airports (vol 11, pg 1871, 2023)

引用

TRANSPORTMETRICA B-TRANSPORT DYNAMICS 2023年第1期11卷 1871-1892页

作者： Lee, Jiyeon MoonJ, Ilkyeong Department of Industrial Engineering Seoul National University Seoul Republic of Korea Institute of Engineering Research Seoul National University Seoul Republic of Korea

The purpose of this study is to reschedule flights for an airline's profit to correspond to the airport’s changed capacity. In the event of a ground delay program (GDP), the number of flights the airport can accommodate is reduced. We formulated a mixed-integer linear programming (MILP) model to reschedule flights. The MILP models were divided into two versions to handle the uncertainty of the future. In scenarios in which the GDP is changed again, an optimal model obtains solutions for each scenario. The stochastic model solution obtains a minimizing expectation cost of all scenarios. All flights are connected to both the origin and destination airports, and one aircraft may be used for more than one flight. Therefore, we considered delay propagation not only within the same airport but from other airports by extending the setup to include several airports at once. Because the objective of this study is to minimize the operation cost of airline, we also considered costs associated with airline resources such as aircrafts and crews. Related experiments were conducted including comparison between two suggested versions.

关键词： mixed-integer linear programming stochastic programming rescheduling ground delay program air traffic control

来源：评论

学校读者我要写书评

暂无评论

An Accelerated-Decomposition Approach for Security-Constrained Unit Commitment With Corrective Network Reconfiguration

引用

IEEE TRANSACTIONS ON POWER SYSTEMS 2022年第2期37卷 887-900页

作者： Ramesh, Arun Venkatesh Li, Xingpeng Hedman, Kory Univ Houston Dept Elect & Comp Engn Houston TX 77204 USA Arizona State Univ Sch Elect Comp & Energy Engn Tempe AZ 85287 USA

Security-constrained unit commitment (SCUC) model is used for power system day-ahead scheduling. However, current SCUC model uses a static network to deliver power and meet demand optimally. A dynamic network can provide a lower optimal cost and alleviate network congestion. However, due to the computational complexity and the lack of effective algorithms, network reconfiguration has not been included in the SCUC model yet. This paper presents a novel approach to handle the computational complexity in security-constrained unit commitment (SCUC) with corrective network reconfiguration (CNR) while considering the scalability through accelerated-decomposition approach with fast screening non-critical sub-problems of SCUC-CNR. The proposed approach provides substantial computational benefits and is also applicable to SCUC. Simulation results on the IEEE 24-bus system show that the proposed methods are substantially faster without the loss in solution quality while the scalability benefits are demonstrated using larger cases: the IEEE 73-bus system, IEEE 118-bus system and Polish system.

关键词： Generators Indexes Real-time systems Power system reliability Load flow Power system stability Uncertainty Accelerated-decomposition approach benders decomposition corrective transmission switching flexible transmission mixed-integer linear programming network reconfiguration post-contingency congestion relief security-constrained unit commitment topology control

来源：评论

学校读者我要写书评

暂无评论

The system value of optimized battery electric vehicle charging: a case study in South Africa

引用

ELECTRICAL ENGINEERING 2022年第2期104卷 843-853页

作者： Calitz, Joanne R. Bansal, Ramesh C. CSIR Pretoria South Africa Univ Sharjah Dept Elect Engn Sharjah U Arab Emirates Univ Pretoria Dept Elect Elect & Comp Engn Pretoria South Africa

This study quantified the impact of future battery electric vehicle (EV) charging on the least-cost electricity generation portfolio in South Africa (RSA). This was done by performing a capacity expansion optimization of the generation fleet for the year 2040. It was assumed that there would be 2.8 million EVs by 2040, informed by global estimates. Two EV charging scenarios were tested, one using an aggregated fixed charging profile based on existing literature and another where the charging demand was optimized by the power system based on least cost. The results showed that additional capacity was required to meet the demand. For both scenarios, the least-cost capacity investment technologies chosen were the same, although the quantities differed. This indicates that the least-cost technology choice was robust against the charging profiles. The optimized charging profile led to lower system costs and a slightly higher energy share from solar relative to the fixed charging case.

关键词： Electric vehicle (EV) Electric vehicle charging Energy production Generation expansion planning mixed-integer linear programming Solar photovoltaic (PV) Wind

来源：评论

学校读者我要写书评

暂无评论

Simultaneous mixed-integer dynamic scheduling of processes and their energy systems

引用

AICHE JOURNAL 2022年第8期68卷 e17741-e17741页

作者： Baader, Florian Joseph Bardow, Andre Dahmen, Manuel Forschungszentrum Julich Inst Energy & Climate Res Energy Syst Engn IEK 10 D-52425 Julich Germany Rhein Westfal TH Aachen Fac Mech Engn Aachen Germany Swiss Fed Inst Technol Energy & Proc Syst Engn Zurich Switzerland Rhein Westfal TH Aachen Inst Tech Thermodynam Aachen Germany

Increasingly volatile electricity prices make simultaneous scheduling optimization desirable for production processes and their energy systems. Simultaneous scheduling needs to account for both process dynamics and binary on/off-decisions in the energy system leading to challenging mixed-integer dynamic optimization problems. We propose an efficient scheduling formulation consisting of three parts: a linear scale-bridging model for the closed-loop process output dynamics, a data-driven model for the process energy demand, and a mixed-integer linear model for the energy system. Process dynamics is discretized by collocation yielding a mixed-integer linear programming (MILP) formulation. We apply the scheduling method to three case studies: a multiproduct reactor, a single-product reactor, and a single-product distillation column, demonstrating the applicability to multiple input multiple output processes. For the first two case studies, we can compare our approach to nonlinear optimization and capture 82% and 95% of the improvement. The MILP formulation achieves optimization runtimes sufficiently fast for real-time scheduling.

关键词： demand response integration of scheduling and control mixed-integer dynamic optimization mixed-integer linear programming simultaneous scheduling

来源：评论

学校读者我要写书评

暂无评论

Efficient Online Path Selection and Workload Allocation for In-Network Computing in MEC 18th

Efficient Online Path Selection and Workload Allocation for...

引用

18th International Conference on Wireless Artificial Intelligent Computing Systems and Applications, WASA 2024

作者： Ouyang, Sheng Zhang, Fanlong Mai, Junyu Chai, Yuan Chen, Quan Tao, Yongchao School of Computer Science and Technology Guangdong University of Technology Guangzhou China Shenzhen Academy of Aerospace Technology Shenzhen China

ISBN: (纸本)9783031714696

In this paper, we study the joint optimization problem of computation path selection and workload allocation for in-network computing at the edge. The existing works, which only consider the end-to-end latency, ignore the operational cost of the servers and the dynamic tasks arrived in an online manner. Thus, we investigate the first online scheduling problem of path selection and workload allocation for in-network computing. Such a problem is modeled as a mixed integer programming problem, which tries to jointly minimize the server operating cost and end-to-end latency. Then, a dynamic 3D-map is constructed to take both the operation cost and end-to-end latency into account. Based on the constructed 3D-map, a cooperative learning based algorithm with ant colony optimization is proposed. Finally, the extensive simulation demonstrates the proposed algorithm shows good robustness and outperforms the state-of-the-art algorithms. © The Author(s), under exclusive license to Springer Nature Switzerland AG 2025.

关键词： mixed-integer linear programming

来源：评论

学校读者我要写书评

暂无评论

Optimal Scheduling of Electricity-Hydrogen Energy Storage Considering Time-Of-Use Hydrogen Prices 11th

Optimal Scheduling of Electricity-Hydrogen Energy Storage Co...

引用

11th Frontier Academic Forum of Electrical Engineering, FAFEE 2024

作者： Shen, Qianfeng Zhang, Shaohua Chang, Yixin Wang, Yufan Bai, Yilin Lyu, Chenghao Integrated Innovation Department China EPPEI Smart Energy Co. LTD. Beijing China School of Future Technology Xi’an Jiaotong University Xi’an710049 China School of Electrical Engineering Xi’an Jiaotong University Xi’an710049 China

ISBN: (纸本)9789819788316

The integration of renewable energy sources has significantly advanced sustainability efforts, yet their intermittent nature poses challenges to grid stability. Electricity-Hydrogen (EH) storage systems have emerged as promising solutions to store surplus renewable energy. Existing studies often overlook the technical disparities between Hydrogen Energy Storage Systems (HESS) and Battery Energy Storage Systems (BESS), highlighting the critical importance of considering Time-of-Use (TOU) hydrogen market prices in optimizing EH storage, as TOU pricing schemes incentivize efficient storage resource utilization and grid operation optimization. This paper addresses the pressing need for optimal scheduling strategies for EH storage systems in the context of renewable energy integration. The mathematical model is formulated by conducting comprehensive analyses to assess the economic aspects of EH storage under TOU hydrogen pricing scenarios. Additionally, a solution methodology based on mixed-integer-linear programming (MILP) and rolling optimization is employed to solve the problem. Through the comparative analysis, the results suggest that considering TOU prices of hydrogen can enhance the profitability of hydrogen trading, thereby improving the economic viability of the integrated power system. © Beijing Paike Culture Commu. Co., Ltd. 2025.

关键词： mixed-integer linear programming

来源：评论

学校读者我要写书评

暂无评论

An efficient parallel single surrogate objective optimization method for multi-objective black-box problem and its application in processor design 20

An efficient parallel single surrogate objective optimizatio...

引用

IEEE 20th International Conference on Automation Science and Engineering (CASE)

作者： Lv, Xiaoliang Zhai, Qiaozhu Zhu, Yuhang Hu, Jianchen Zhou, Yuzhou Guan, Xiaohong Xi An Jiao Tong Univ Syst Engn Inst MOE KLINNS Lab Xian 710049 Peoples R China Tsinghua Univ Ctr Intelligent & Networked Syst Beijing 100084 Peoples R China Tsinghua Univ TNLIST Beijing 100084 Peoples R China

ISBN: (纸本)9798350358513;9798350358520

As micro-architectures evolve with increasing complexity, the design process needs to account for a broad range of parameters, which leads to expansive design spaces. Design space exploration (DSE) for multiple metrics with limited simulation resources is a challenging task. In this paper, we focus on multi-objective (performance and area of processor) optimization, where one of the objectives (performance) is infeasible to model analytically and the other (area) is easy to model analytically. Most of the current black-box optimization methods are data-driven, which means that they require a large amount of simulation data to model the optimization metrics for high-dimensional and discrete problems. Based on the mixed integer linear programming (MILP), the Surrogate Objectivebased Parallel Multi-objective Optimization Algorithm (SOPMOOA) is proposed to reduce the data requirements by integrating mechanism constraints and human experience. The proposed method adopts the separability assumption to establish a surrogate objective function that is ordinal consistent with the real black-box objective for paralleling a single objective model. The white box objective is modeled as a series of arithmetic constraints, thus transforming the multi-objective optimization problem into a series of parallel single-objective optimization problems. The Pareto-optimal set is explored by iteratively constructing a series of parallel single-objective black-box optimization problems. The experimental results show that the proposed algorithm outperforms HEBO, a stateof-the-art Bayesian optimization (BO) method, combined with NSGA-II in terms of the quality of the Pareto-optimal set and the recommended points.

关键词： mixed-integer linear programming

来源：评论

学校读者我要写书评

暂无评论

Quantum solution for solving the Bin Packing problem 10

Quantum solution for solving the Bin Packing problem

引用

10th International Conference on Control, Decision and Information Technologies (CoDIT)

作者： Deleplanque, Samuel Durbec, Amelia El Yaagoubi, Amina Univ Lille JUNIA CNRS Cent LilleUMR IEMN 8520 41 Bvd Vauban Lille Valenciennes France Univ Catholique Lille LITL Junia ICL F-59000 Lille France

ISBN: (纸本)9798350373981;9798350373974

Quantum optimization shows significant potential in tackling complex combinatorial challenges, prompting our research exploration into the domain of quantum computing to address the Bin Packing Problem (BPP) through Quadratic Unconstrained Binary Optimization (QUBO) formulations. This work-in-progress paper outlines our proposal for a thorough study that encompasses classical bin packing formulations, initiating with the mixed integer linear Program, followed by a comparative analysis of the corresponding QUBO representations, and adopting a structured approach of Quantum Annealing on the D-Wave machine. While our work is still in progress, continuous comparative analyses are being conducted to evaluate various QUBO formulations, derived from diverse classical bin packing models, aiming to identify the most efficient QUBO for addressing the BPP. On another front, efforts are dedicated to refining the solution process further, with a focus on enhancing the precision of the selected QUBO formulation.

关键词： mixed-integer linear programming

来源：评论

学校读者我要写书评

暂无评论

Electric-vehicle routing problem with time windows and energy minimization: green logistics with same-day delivery approaches 4

Electric-vehicle routing problem with time windows and energ...

引用

4th IEEE International Conference on Electrical, Computer, and Energy Technologies, ICECET 2024

作者： Moradi, Nima Kayvanfar, Vahid Baldacci, Roberto Concordia University Information Systems Engineering Montreal Canada College of Science and Engineering Hamad Bin Khalifa University Qatar Foundation Division of Engineering Management and Decision Sciences Doha34110 Qatar

ISBN: (纸本)9798350395914

Electric Vehicle (EV)-based last-mile delivery has been studied in recent years due to its theoretical and practical importance. EVs are known for their eco-friendliness and no air pollution in Green Logistics. However, there is no work on integrating the energy consumption and same-day delivery approaches with Electric-Vehicle Routing Problem with Time Windows (EVRP- TW). The influence of payload weights on the EVs energy consumption is considerable and should be considered when planning routes. This work presents the Prize-Collecting EVRP- TW with Energy Minimization (PC-EVRP- TW-EM), finding the optimal routes of EV s to visit the customers with prime membership (same-day service) and consume less battery energy. A mixed-integer program models the PC-EVRP- TW-EM. The results show the efficiency of the proposed approach, reducing the energy consumption and usage cost of EVs by an average of 32.97% and 29.17%, respectively. © 2024 IEEE.

关键词： mixed-integer linear programming

来源：评论

学校读者我要写书评

暂无评论

Integral Attack with Bit-Based Division Property on Block Cipher LBC-3 18

Integral Attack with Bit-Based Division Property on Block Ci...

引用

18th International Symposium on Information Theory and Its Applications, ISITA 2024

作者： Shibayama, Naoki Igarashi, Yasutaka Tokyo University of Science 2641 Yamazaki Noda Chiba278-8510 Japan

ISBN: (纸本)9784885523519

The block cipher LBC-3, which was proposed by Nyssanbayeva et al. in 2022, has a 64-bit block size, an 80-bit secret key size, and the number of rounds is 20. The designer investigated the avalanche effect of LBC-3, and Yasushi et al. evaluated the security against differential and linear cryptanalysis. On the other hand, it has not been evaluated the security against integral cryptanalysis, which is one of the most powerful cryptanalysis techniques on block cipher. In this paper, we apply integral cryptanalysis to LBC-3. By establishing the mixed integer linear programming (MILP) model based on bit-based division property, we discovered the 18-round integral characteristic, the longest integral characteristic of LBC-3. Then, based on the 16-round characteristic newly found, we show that the integral attack on full-round LBC-3 is more efficiently possible with 2{50.8 data and 2{51.4 times of encryption. © 2024 The Institute of Electronics, Information and Communication Engineers.

关键词： mixed-integer linear programming

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：