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

Two-stage distributionally robust integrated scheduling of oxygen distribution and steelmaking-continuous casting in steel enterprises

引用

APPLIED ENERGY 2023年 351卷

作者： Zhang, Liu Zhang, Kaitian Zheng, Zhong Chai, Yi Lian, Xiaoyuan Zhang, Kai Xu, Zhaojun Chen, Sujun Chongqing Univ Coll Mat Sci & Engn Chongqing 400000 Peoples R China Chongqing Univ Coll Automat Chongqing 400000 Peoples R China Minist Educ Key Lab Complex Syst Safety & Control Chongqing 400000 Peoples R China Shougang Jingtang United Iron & Steel Co Ltd Minist Energy & Environm Tangshan 063200 Peoples R China

In the steel industry, the imbalance between fluctuating oxygen demand and stable supply generally results in excessive oxygen emissions and power waste. Independent optimal scheduling of oxygen distribution (OD) or steelmaking-continuous casting (SCC) has limited ability to handle this issue. To address this challenge, we propose an integrated scheduling model that allows for flexible interaction between OD and SCC. We first develop an SCC scheduling model that applies to machine sharing of duplex and conventional smelting, and derive an OD scheduling model. A critical demand interface is further designed to connect the scheduling models of SCC and OD, resulting in a mixed integer linear programming-based integrated scheduling model. Existing research overlooks the probability information of demand uncertainty posed by unpredictable interferences, which limits the ability to handle uncertain demands. To address this limitation, we embed demand probability distribution via a data-driven ambiguity set and upgrade the deterministic integrated scheduling model via twostage distributionally robust optimization. Our model was tested with real data and resulted in a 15% reduction in total costs compared to independent scheduling of OD and SCC. Additionally, it effectively reduced uncertainty risk to 8.3% with low conservativeness, demonstrating superior performance compared to recent methods.

关键词： Integrated scheduling Oxygen distribution Steelmaking -continuous casting Distributionally robust optimization mixed -integer linear programming Steel enterprise

来源：评论

学校读者我要写书评

暂无评论

The stochastic inventory routing problem on electric roads

引用

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH 2023年第1期310卷 156-167页

作者： Gutierrez-Alcoba, Alejandro Rossi, Roberto Martin-Barragan, Belen Embley, Tim Univ Edinburgh Business Sch Edinburgh EH8 9JS Scotland Costain Grp Plc Maidenhead SL6 4UB England

In this work we introduce a green inventory routing problem termed the Stochastic Inventory Routing Problem on Electric Roads (S-IRP-ER), in which a hybrid vehicle navigates a road network with charging opportunities in some road sections, to cover the non-stationary stochastic demand of a single product for a set of retailers in the network. We model the problem using isochrone graphs to represent the real road network. In an isochrone graph nodes are located such that the time to travel any arc is constant all over the network. This allows for tracking the battery level of the vehicle serving retailers, as it charges and discharges continuously while travelling. We formulate a mathematical programming heuristics and prove its effectiveness. We use our model on a realistic instance of the problem, showcasing the different strategies that a vehicle may follow depending on fuel costs in relation to the costs of electricity.(c) 2023 Published by Elsevier B.V.

关键词： Inventory Routing Electric roads Stochastic demand mixed -integer linear programming

来源：评论

学校读者我要写书评

暂无评论

Short-term optimal scheduling of cascade hydropower plants with reverse-regulating effects

引用

RENEWABLE ENERGY 2022年 199卷 395-406页

作者： Su, Chengguo Wang, Peilin Yuan, Wenlin Wu, Yang Jiang, Feng Wu, Zening Yan, Denghua Zhengzhou Univ Sch Hydraul Sci & Engn Zhengzhou 450001 Peoples R China Yunnan Power Grid Co Ltd Power Dispatching & Control Ctr Kunming 650011 Peoples R China UCL Bartlett Sch Construct & Project Management London WC1E 6BT England China Inst Water Resources & Hydropower Res Water Resources Dept Beijing 100038 Peoples R China

The joint operation mode of large hydropower plants and their reverse-regulating plants has been widely used in China's major river basins. Hence this paper establishes an optimization model for the short-term optimal scheduling of cascade hydropower plants with reverse-regulating effects. Two conflicting objectives that need to be considered for optimal operation are minimizing the peak-valley difference of the power grid and minimizing the outflow variation of the reverse-regulating plant. The complex hydraulic coupling between the main -regulating plant and reverse-regulating plant is of particular concern. A novel two-layer nested approach, coupling constraint method and a mixed-integer linear programming (MILP) approach, is therefore proposed to solve the model. The results for three case studies demonstrate that: 1) The proposed approach is computa-tionally efficient, and the average time for a single calculation is about 12 min;2) The peak-valley difference of power grid G in dry season and flood season is reduced by 26.0% and 15.7%, respectively, after optimization. The outflow variation of the reverse-regulating plant has been controlled at 300 and 350 m3/s, respectively. 3) The developed model produces a more realistic and executable scheduling scheme than the benchmark model which does not consider the complex hydraulic coupling between cascade plants.

关键词： Cascade hydropower plants Complex hydraulic coupling Reverse -regulating effects Two -layer nested approach mixed -integer linear programming

来源：评论

学校读者我要写书评

暂无评论

Impact of the splitting of the German-Austrian electricity bidding zone on investment in a grid-scale battery energy storage system deployed for price arbitrage with gray and green power in Austrian and German day-ahead power markets

引用

ENERGY REPORTS 2022年 8卷 12045-12062页

作者： Hurta, Adam Zilka, Miroslav Freiberg, Frantisek Czech Tech Univ Fac Mech Engn Dept Enterprise Management & Econ Karlovo Namesti 13 Prague 2 Czech Republic

The splitting of the German-Austrian electricity bidding zone in October 2018 established limits for cross-border exchanges of power between Germany and Austria, which led to the decoupling of German and Austrian wholesale power prices. We analyze the impact of the split on the investment in lithium-ion grid-scale battery energy storage systems (BESS) used for intertemporal arbitrage in German and Austrian day-ahead power markets with hourly contracts operated by the Energy Exchange of Austria. The paper was written in response to the increasing share of green power in the national energy mix of the two countries, followed by a similar development in the volume of green power traded. Arbitrage with green power was analyzed and compared to arbitrage with power from conventional sources using a robust mixed-integer linear programming (MILP) model extended with a battery degradation process. The model was solved for different levels of depth of discharge (DOD) to identify the optimum between cycle life and calendar aging with respect to prevailing market conditions. Using predicted costs of battery, a break-even point was reached with 60% DOD identified as the optimal pattern for the dispatch of the BESS. A separate scenario was considered for the analysis of the impact of moving from the perfect knowledge of future prices to a situation where day-ahead prices are forecasted using the seasonal autoregressive integrated moving average (SARIMA) model.(c) 2022 The Author(s). Published by Elsevier Ltd. This is an open access article under the CC BY license (http://***/licenses/by/4.0/).

关键词： German-Austrian electricity bidding zone Battery storage Green power mixed -integer linear programming Electricity forecasting

来源：评论

学校读者我要写书评

暂无评论

Electric Bus Charging Scheduling for a Single Public Transport Route Considering Nonlinear Charging Profile and Battery Degradation Effect

引用

TRANSPORTATION RESEARCH PART B-METHODOLOGICAL 2022年 159卷 49-75页

作者： Zhou, Yu Meng, Qiang Ong, Ghim Ping Natl Univ Singapore Dept Civil & Environm Engn Singapore 117576 Singapore

This study deals with a fundamental electric bus charging scheduling (EBCS) problem for a single public transport route by considering the nonlinear electric bus (EB) charging profile and battery degradation effect under the partial charging policy, which allows EBs to be charged any length of time and make good use of dwell times between consecutive trips. Given a group of trip tasks for an EB fleet and charger type, the problem is to minimize the total cost for a public transport operator of providing peak-hour bus services for a focal single public transport route by simul-taneously determining the EB-to-trip assignment and EB charging schedule with charger type choice subject to the necessary EB operational constraints. We first build a mixed-integer nonlinear and nonconvex programming (MINL&NCP) model for the EBCS problem. To effec-tively solve the MINL&NCP model to global optimality, we subsequently develop two mixed -integer linear programming (MILP) models by means of linearization and approximation tech-niques. To accelerate the solution efficiency, we further create three families of valid inequalities depending on the unique features of the problem. A real case study based on the No.171 bus route in Singapore is conducted to demonstrate the performance of the developed models. Extensive numerical experiments are carried out to seek valuable managerial insights for public transport operators.

关键词： Electric bus bus -to -trip assignment charging scheduling battery degradation mixed -integer linear programming valid inequalities

来源：评论

学校读者我要写书评

暂无评论

Mathematical models for a ship routing problem with a small number of ports on a route

引用

APPLIED MATHEMATICAL MODELLING 2022年 111卷 126-138页

作者： Lee, Jonghwa Kim, Byung-In Pohang Univ Sci & Technol POSTECH Dept Ind & Management Engn Pohang South Korea

This paper presents an industrial ship routing problem with split loads faced by a steel company that exports its steel products to neighboring countries. The problem considers two types of ships: ships with contracts of affreightment and spot ships. It also consid-ers other practical constraints, such as cargo-cargo and cargo-ship compatibility and the minimum loading amount for using a ship. Due to high surcharges for multiple port vis-its, each ship is allowed to visit at most two loading and two unloading ports. Herein, arc flow-based and path flow-based mathematical models are proposed to solve the problem. Computational experiments show that the path flow model is more efficient than the arc flow model. The path flow model can reduce the computational time by 67% on average and find optimal solutions to real-world ship routing problems in acceptable computa-tional time in most cases.(c) 2022 Elsevier Inc. All rights reserved.

关键词： Ship routing problem Split load mixed -integer linear programming Optimal solution

来源：评论

学校读者我要写书评

暂无评论

Timetable synchronization optimization in a subway-bus network

引用

PHYSICA A-STATISTICAL MECHANICS AND ITS APPLICATIONS 2022年第Part1期608卷

作者： Huang, Kang Wu, Jianjun Sun, Huijun Yang, Xin Gao, Ziyou Feng, Xujie Beijing Jiaotong Univ State Key Lab Rail Traff Control & Safety Beijing 100044 Peoples R China Eindhoven Univ Technol Urban Planning & Transportat Grp Eindhoven Netherlands Beijing Jiaotong Univ Minist Transport Key Lab Transport Ind Big Data Applicat Technol Co Beijing 100044 Peoples R China China Acad Transportat Sci Key Lab Adv Publ Transportat Sci Beijing 100029 Peoples R China

The subway and bus together contribute to the structure of public transport network in a metropolis. However, integrated service of public transport is not satisfied due to the lower timetable synchronization between these two modes at transfer stations. In this paper, a double-layer public transport network composed of subway/bus lines and stations is first created. Then, two stages are included in the timetable optimization process. In the first stage, a user equilibrium assignment model and a capacity restriction iterative algorithm are employed to obtain the passenger distribution in the subway- bus public transport transfer network. Based on this distribution, with the consideration of the synchronization and section service level, a mixed-integer linear programming (MILP) model is applied to optimize the timetables of the subway and bus networks in the second stage. Computational results using real Automatic Fare Collection System (AFC) data from the public transport system in Beijing are reported, and these results show that the suggested model is efficient in improving passenger service levels. (c) 2022 Published by Elsevier B.V.

关键词： Timetable synchronization Subway-bus networks mixed -integer linear programming AFC data

来源：评论

学校读者我要写书评

暂无评论

Two-sided disassembly line balancing problem with sequence-dependent setup time: A constraint programming model and artificial bee colony algorithm

引用

EXPERT SYSTEMS WITH APPLICATIONS 2022年 203卷

作者： Cil, Zeynel Abidin Kizilay, Damla Li, Zixiang Oztop, Hande Izmir Democracy Univ Dept Ind Engn Izmir Turkey Wuhan Univ Sci & Technol Key Lab Met Equipment & Control Technol Wuhan Hubei Peoples R China Wuhan Univ Sci & Technol Hubei Key Lab Mech Transmiss & Mfg Engn Wuhan Hubei Peoples R China Izmir Democracy Univ Dept Ind Engn Gursel Aksel Bulvari 14 TR-35140 Izmir Turkey

The large-size products can allow workers to perform tasks on both sides of the line. Hence, a two-sided disassembly line is preferred to ensure several advantages, such as a shorter line. The two-sided disassembly line balancing problem (TDLBP) is relatively new in the literature. This study considers the two-sided disas-sembly line balancing problem with sequence-dependent setup time (TDLBP-SDST) to reflect the real practice better, as sequence-dependent setup times may exist between tasks in many real-life applications. To the authors' best knowledge, sequence-dependent setup time has not been considered for the TDLBP in the current literature. The proposed problem creates a more complicated problem. Therefore, proposing effective solution techniques is more critical for obtaining better results. This study proposes two new mixed-integer linear programming models and a novel constraint programming (CP) model to define and solve the TDLBP-SDST. A genetic algorithm, an artificial bee colony algorithm, and the improved versions of these two algorithms are also developed to solve the large-size problems due to the NP-hardness of the TDLBP-SDST. Furthermore, a novel CP model is proposed for the standard TDLBP without considering sequence-dependent setup times. Initially, we compare the performance of the proposed CP model to those of the previous state-of-the-art methods in the literature for the TDLBP without sequence-dependent setup time. The computational results show that the proposed CP model out-performs all the other solution methods and reports the best-known results for all existing benchmark instances for the TDLBP. Then, we present the computational results of the proposed models and algorithms for the TDLBP-SDST. Computational study on a comprehensive set of generated instances indicates that the proposed solution methods effectively solve the TDLBP-SDST.

关键词： Two-sided disassembly line Line balancing Sequence -dependent setup time Constraint programming Metaheuristic algorithms mixed -integer linear programming

来源：评论

学校读者我要写书评

暂无评论

Fast scheduling of human-robot teams collaboration on synchronised production-logistics tasks in aircraft assembly

引用

ROBOTICS AND COMPUTER-INTEGRATED MANUFACTURING 2024年 85卷

作者： Guo, Daqiang Univ Cambridge Inst Mfg IfM Ctr Int Mfg Dept Engn 17 Charles Babbage Rd Cambridge CB3 0FS England

The deployment of human-robot teams (HRTs) promises to realise the potential of each team member regarding their distinct abilities and combines efficiency and flexibility in manufacturing operations. However, enabling effective coordination amongst collaborative tasks performed by humans and robots while ensuring safety and satisfying specific constraints is challenging. Motivated by real-world applications that Boeing and Airbus adopt HRTs in manufacturing operations, this paper investigates the allocating and coordinating of HRTs to support safe and efficient human-robot collaboration on synchronised production-logistics tasks in aircraft assembly. We connect the operations research and robotics communities by formulating the problem with precedence constraints, spatial constraints, temporal constraints, and synchronisation constraints that fits within the classic multi-robot task allocation (MRTA) category into a flexible job shop scheduling problem. Two exact approaches, including mixed-integer linear programming (MILP) and constraint programming (CP), are proposed to formulate and solve this problem. A benchmark set with 80 instances (e.g., small/medium-scale and large-scale instances) that corresponds to real dimensions of industrial problems with production tasks, subtasks, locations, deadlines, human worker eligibility and capacity, robot eligibility and capacity, material handling system capacity, and travel times is developed. Experimental evaluation with a total of 1200 independent tests on the benchmark set shows the superiority of the CP approach comparing the MILP approach for efficiently solving real-life scheduling problems of HRTs collaboration on synchronised production-logistics tasks in aircraft assembly.

关键词： Human -robot teams collaboration Synchronised production -logistics Multi -robot task allocation Flexible job shop scheduling Constraint programming mixed -integer linear programming

来源：评论

学校读者我要写书评

暂无评论

Q-learning guided algorithms for bi-criteria minimization of total flow time and makespan in no-wait permutation flowshops

引用

SWARM AND EVOLUTIONARY COMPUTATION 2024年 89卷

作者： Yuksel, Damla Kandiller, Levent Tasgetiren, Mehmet Fatih Yasar Univ Dept Ind Engn TR-35100 Izmir Turkiye Baskent Univ Dept Ind Engn TR-06790 Ankara Turkiye

Combining Deep Reinforcement Learning and meta-heuristic techniques represents a new research direction for enhancing the search capabilities of meta-heuristic methods in the context of production scheduling. Q-learning is a prominent reinforcement learning in which its utilization aims to direct the selection of actions, thus preventing the necessity for a random exploration in the iterative process of the metaheuristics. In this study, we provide Q-learning guided algorithms for the Bi-Criteria No-Wait Flowshop Scheduling Problem (NWFSP). The problem is treated as a bi-criteria combinatorial optimization problem where total flow time and makespan are optimized simultaneously. Firstly, a deterministic mixed-integer linear programming (MILP) model is provided. Then, Q-learning guided algorithms are developed: Bi-Criteria Iterated Greedy Algorithm with Q-Learning (BCIGQL). Bi-Criteria Block Insertion Heuristic Algorithm with Q-Learning (BC-BIHQL). Moreover, the performance of the proposed Q-learning guided algorithms is compared over a collection of Bi-Criteria Genetic Local Search Algorithms (BC-GLS), Bi-Criteria Iterated Greedy Algorithm (BC-IG), Bi-Criteria Iterated Greedy Algorithm with a Local Search (BC-IGALL) and Bi-Criteria Variable Block Insertion Heuristic Algorithm (BC-VBIH). The complete computational experiment, performed on 480 problem instances of Vallada et al. (2015), which is known as the VRF benchmark set, indicates that the BC-BIHQL and the BC-IGQL algorithms outperform the BC-GLS, BC-IG, BCIGALL, and BC-VBIH algorithms in comparative performance metrics. More specifically, the proposed BC-BIHQL and BC-IGQL algorithms can yield more non-dominated bi-criteria solutions with the most substantial competitiveness than the remaining algorithms. At the same time, both are competitive with each other on the benchmark problems. Moreover, the BC-IGQL algorithm dominates almost 97% and 99% of the solutions reached by the BC-IG, BC-IGALL, and BC-VBIH algorit

关键词： Bi-criteria scheduling problems No -wait flowshop scheduling problem Makespan Total flow time mixed -integer linear programming Bi-criteria heuristic optimization

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：