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

A smart energy scheduling under uncertainties of an iron ore stockyard-port system using a rolling horizon algorithm

引用

COMPUTERS & OPERATIONS RESEARCH 2024年 164卷

作者： Junior, Marcos W. J. Servare Rocha, Helder R. de Oliveira Salles, Jose L. Felix Fed Univ Espirito St Elect Eng Dept Ave Fernando Ferrari 514 BR-29075910 Vitoria ES Brazil

Planning the efficient use of electricity in iron ore stockyard operations is a strategic issue due to the constant rise in energy prices nowadays and its considerable impact on production costs. This paper proposes a new large-scale mixed-integer nonlinear programming (MINLP) model for stockyard-port energy planning solved by the energy scheduling algorithm and a commercial solver to minimize power costs. The proposed nonlinear optimization problem is solved through an equivalent MILP model to minimize the flows of power and material between the stockyard-port equipment. The electrical machines are powered by different electricity energy providers, and eventually consume storage energy from batteries. The energy scheduling algorithm allows the planner to find a solution that saves electrical power costs in real time under unforeseen operational changes. Numerical results obtained through the proposed algorithm with a scheduling horizon of 24 h, show that the presence of the battery in the stockyard-port electrical grid allows for an energy cost reduction of up to 17.88% compared to the case without the battery. The energy scheduling based on rolling horizon algorithm provides feasible solutions near to the optimal solution, with an average distance of 1.78%, and it has an affordable computation time in instances where the MINLP model is not able to provide a solution.

关键词： Stockyard Port Energy scheduling rolling horizon algorithm Mixed-integer nonlinear programming model Battery management

来源：评论

学校读者我要写书评

暂无评论

Integrated mobile facility production and distribution scheduling planning;A synchronized solution framework

引用

APPLIED MATHEMATICS AND COMPUTATION 2025年 494卷

作者： Ramezanian, Reza Mahdavi, Mohammad Hosein Shahparvari, Shahrooz K N Toosi Univ Technol KNTU Dept Ind Engn Tehran Iran RMIT Univ Coll Business & Law Sch Accounting Informat Syst & Supply Chain Melbourne Australia

This research explores supply chain modeling for mobile production facilities, emphasizing distribution and manufacturing processes. The focus is on a fleet of production-equipped trucks that manufacture orders during transit to customer locations. A mixed-integer linear programming (MILP) model is proposed to address the production and delivery planning problem, minimizing total costs, including production, transportation, and driver expenses. The computational strategy integrates Benders Decomposition with a rolling horizon heuristic. The accelerated Benders Decomposition reduced computational time by 25-35 % across large-scale scenarios. Numerical experiments demonstrated that the hybrid method achieved optimal or near-optimal solutions with cost savings of 12-18 % compared to standalone methods. For example, in scenarios with 15 mobile facilities and 10 products, the methodology outperformed CPLEX in solution time and quality. The results highlight the practical applicability of the proposed framework, enabling ecommerce enterprises to enhance customer service levels by reducing delivery times by 10-15 %. This study provides a robust and efficient approach to optimizing synchronized production and delivery operations while eliminating the costs associated with fixed manufacturing facilities.

关键词： Mobile facility Mobile production problem Integrated production and routing problem Accelerated benders decomposition rolling horizon algorithm

来源：评论

学校读者我要写书评

暂无评论

Coordinated Rescheduling of Train Timetable and Crew Scheme for Passenger-Freight Collinear Railway

引用

IEEE TRANSACTIONS ON COMPUTATIONAL SOCIAL SYSTEMS 2024年第5期11卷 5828-5838页

作者： Wang, Rui Zhou, Min Wang, Hongwei Yang, Bo Dong, Hairong Wang, Fei-Yue Beijing Jiaotong Univ Sch Automat & Intelligence Beijing 100044 Peoples R China China Railway Beijing Grp Co Ltd Dept Dispatching Beijing 100038 Peoples R China Chinese Acad Sci State Key Lab Multimodal Artificial Intelligence Beijing 100190 Peoples R China Chinese Acad Sci State Key Lab Management & Control Complex Syst Beijing 100190 Peoples R China

On a passenger-freight collinear railway, the freight train operation level is comparatively low, frequently resulting in significant deviations from the original timetable and crew plan in the presence of various interferences. This article focuses on the problem of coordinated rescheduling of train timetable and crew scheme in the presence of disruptions on a double-track passenger-freight collinear railway. We develop a mixed-integer linear program (MILP) model considering the distinct priorities of passenger and freight trains, as well as crew operations, thereby surpassing the current practice of independently adjusting train timetable and crew plan to achieve a collaborative solution. The objective is to minimize delays for passenger trains and deviations in crew schedule, while maximizing the delivery rate of freight trains at railway Bureau boundary stations prior to the settlement time. Furthermore, for large-scale delays, we design a solution algorithm based on the rolling horizon approach to enhance computational efficiency. To validate the effectiveness of the proposed model, simulation experiments are conducted using actual running data from the Beijing-Shanghai railway. The experimental results illustrate that our coordinated model enhances the feasibility of adjustment outcomes during emergencies, in contrast to the model that neglects crew connections. Additionally, our proposed algorithm guarantees a solving error of under 5% and reduces solving time by over 60% compared with the results obtained by CPLEX. Moreover, three additional comparison experiments are conducted to further demonstrate the impact of crew activities on train operation adjustments, which also indicate that our approach can provide dispatchers with more feasible train operation adjustment schemes in terms of crew utilization.

关键词： Rail transportation Delays Mathematical models Schedules Interference Dispatching Optimization Crew operation interference passenger-freight collinear railway rolling horizon algorithm train operation adjustment

来源：评论

学校读者我要写书评

暂无评论

Routing and scheduling of trains and engines in a railway marshalling station yard

引用

TRANSPORTATION RESEARCH PART C-EMERGING TECHNOLOGIES 2024年 167卷

作者： Zhao, Jun Xiang, Jianghai Peng, Qiyuan Southwest Jiaotong Univ Sch Transportat & Logist Chengdu 611756 Sichuan Peoples R China Southwest Jiaotong Univ Natl United Engn Lab Integrated & Intelligent Tran Chengdu 611756 Sichuan Peoples R China

In a busy railway marshalling station, train and engine traffic management in the receiving/departure yard plays a crucial role in efficient and stable operations. Traditionally, a track assignment problem (TAP) is solved to assign tracks to trains for berthing at a receiving/departure yard. However, the TAP does not encompass shunting operations in the yard (e.g., engine replacement and train disassembly), which can result in additional scheduling challenges for dispatchers and route conflicts between operations. This paper investigates a train and engine routing and scheduling problem (TERSP) in a receiving/departure yard of railway marshalling stations, which involves simultaneously assigning routes and scheduling route-setting start times for both train and shunting operations to be conducted in the yard. By introducing the concepts of task, activity, and pattern, we transform the original problem into assigning pre-generated patterns incorporating both route and route-setting start time alternatives to activities. The transformed problem is formulated into a compact binary integer linear programming model with a linear number of constraints and the objective of minimizing the total time deviation of all involved tasks. An improved technique that relies on listing all maximal (bi)cliques in a constructed graph is designed to effectively model the time coherence and track section occupation constraints. A heuristic that gradually expands the patterns for the identified key activities by adding more start time alternatives is applied to remedy an infeasible model caused by potential route conflicts. In addition, a rolling horizon algorithm that decomposes the original problem into consecutive smaller stages using either a time-rolling or a train-rolling rule is developed to efficiently solve instances. Finally, numerical experiments based on the physical layouts and real timetables of a receiving yard and a departure yard of a large marshalling station in China ar

关键词： Railway transportation Routing and scheduling Marshalling station Binary integer linear programming rolling horizon algorithm

来源：评论

学校读者我要写书评

暂无评论

Package routing problem with registered couriers and stochastic demand

引用

TRANSPORTATION RESEARCH PART E-LOGISTICS AND TRANSPORTATION REVIEW 2021年 147卷 102248-102248页

作者： Yildiz, Baris Koc Univ Dept Ind Engn Istanbul Turkey

Providing the crowd-sourced delivery capacity and hence enabling the practice, occasional couriers (OC) are the most critical resource in crowd-shipping (CS). Therefore, as well as establishing and retaining a solid OC base, using the OC trips efficiently is of utmost importance for the viability of the CS applications. One auspicious idea to enhance the efficiency, i.e., cover a larger demand set with the available OC trips, is to use transshipments (deliver packages with a coordinated effort of OCs) and collect OC trip information in advance to efficiently coordinate them, which gives rise to the package routing problem with registered couriers (PRP-R) we introduce in this paper. In particular, we study a CS model in which the couriers register their trips in advance while the express shipping demands arrive through a stochastic process, and the network management needs to dynamically decide package-courier assignments to carry out deliveries in the most efficient way. We develop a novel rolling horizon algorithm to solve this challenging problem in real-time, which explicitly considers the limited OC capacities and use of a back-up delivery capacity (company-owned or third party provided) to ensure the service quality. Beyond the classical rolling horizon approaches, the suggested methodology uses a novel Monte Carlo procedure to take anticipated future system conditions into account, and thus can provide package-courier assignments that have almost the same cost with the optimal solution of the static version of the problem where all demand arrivals are known a-priory. The comprehensive numerical experiments attest to the efficacy of our methodology for the real-time management of the CS operations and provide significant managerial insights about the design of CS networks.

关键词： Crowd-shipping Express delivery City logistics Mathematical programming rolling horizon algorithm

来源：评论

学校读者我要写书评

暂无评论

A disjunctive programming model and a rolling horizon algorithm for optimal multiperiod capacity expansion in a multiproduct batch plant

引用

COMPUTERS & CHEMICAL ENGINEERING 2012年 46卷 29-38页

作者： Garcia-Ayala, Gabriela Rios-Mercado, Roger Z. Chacon-Mondragon, Oscar L. Tecnol Monterrey Ctr Qual & Mfg Monterrey 64849 NL Mexico Univ Autonoma Nuevo Leon Grad Program Syst Engn San Nicol 66450 NL Mexico

This paper addresses a multiperiod mixed integer nonlinear programming problem for the capacity expansion of multiproduct batch plants. Given a certain batch plant with its current configuration, product recipes, and growing production targets, modular expansions are wanted so that new demand can be met. Unlike most work for the batch retrofit problem, a multiperiod disjunctive model is presented, such that long term investments and expansions can be planned out in advance. To solve the model we propose a rolling horizon algorithm that further exploits the advantages of a disjunctive programming model. Empirical work shows that the rolling horizon algorithm is very effective on finding near optimal solutions to large instances with a considerable number of time periods. Furthermore, the solution found by the proposed algorithm can be used as a starting solution for the direct method to the original problem delivering a global optimal solution. (c) 2012 Elsevier Ltd. All rights reserved.

关键词： Batch retrofit Multiproduct batch plants Multiperiod MINLP model Disjunctive programming rolling horizon algorithm

来源：评论

学校读者我要写书评

暂无评论

Trajectory-based traffic management inside an autonomous vehicle zone

引用

TRANSPORTATION RESEARCH PART B-METHODOLOGICAL 2019年 120卷 76-98页

作者： Lu, Gongyuan Nie, Yu (Marco) Liu, Xiaobo Li, Denghui Southwest Jiaotong Univ Sch Transportat & Logist Chengdu Sichuan Peoples R China Northwestern Univ Dept Civil & Environm Engn 2145 Sheridan Rd Evanston IL 60208 USA Southwest Jiaotong Univ Natl Engn Lab Integrated Transportat Big Data App Chengdu Sichuan Peoples R China

This paper studies a trajectory-based traffic management (TTM) problem for the purpose of managing traffic in a road facility reserved exclusively for autonomous vehicles (AV). The base TTM model aims to find optimal trajectories for multiple AVs while resolving inter-vehicle conflicts in the most generic way. The model is formulated as a mixed integer program (MIP) that can be solved using off-the-shelf solvers. To improve computational efficiency, a specialized algorithm based on the rolling horizon approach is also developed. We then show that the base TTM model can be easily extended to first accommodate scheduling decisions (the rrms model) and to further impose equity constraints (the TTMSE model). For the simplest network and homogeneous users, solutions to TTMS and TTMSE are similar, respectively, to system optimal (SO) and user equilibrium (UE) solutions of Vickrey's bottleneck model. Numerical experiments highlight TTM's ability to simultaneously generate optimal trajectories for multiple vehicles. They also show that, while solving TTM exactly is computationally demanding, obtaining good approximate solutions can be accomplished efficiently by the rolling horizon algorithm. (C) 2019 Elsevier Ltd. All rights reserved.

关键词： Trajectory-based traffic management Autonomous vehicles Mixed integer program rolling horizon algorithm

来源：评论

学校读者我要写书评

暂无评论

Optimal scheduling of a by-product gas supply system in the iron- and steel-making process under uncertainties

引用

COMPUTERS & CHEMICAL ENGINEERING 2019年 125卷 351-364页

作者： Coelho Pena, Joao G. de Oliveira Junior, Valter B. Felix Salles, Jose L. Univ Fed Espirito Santo Elect Engn Dept Vitoria ES Brazil ArcelorMittal Tubarao Serra ES Brazil

This paper addresses the real time by product gas scheduling in an integrated iron- and steel-making industry with uncertainty in by-product gas flows from a rolling horizon algorithm. Adaptive time-series models determined from real data performs forecast for each producer and consumer of by-product gases in main units of the steel-making plant. The individual consumptions of the blast furnace and coke oven gases are modelled using the seasonal Holt-Winters method with smoothing constants estimated via genetic algorithm, whereas the individual productions of the blast furnace and coke oven are identified from autoregressive and integrated moving-average. LDG gas production is forecasted using a heuristic method that leverages the operational information. The model's parameters are updated periodically due to the nonlinearities present in the time series. After the forecasting phase, the algorithm performs short-term decisions using a MILP optimization model, that minimizes the imbalance between the random dynamics of by-product fuel generation and consumption and maximizes the energy efficiency. Through computational simulations, we show that the operational stability of gas holders and the electrical energy production increase, whereas the waste of gas in flare stack decreases, when the control horizon of the rolling horizon algorithm is reduced. (C) 2019 Elsevier Ltd. All rights reserved.

关键词： rolling horizon algorithm Scheduling By-product gas forecasting Iron- and steel-making process Gas holder level control Energy saving

来源：评论

学校读者我要写书评

暂无评论

A Real-time Train Timetable Rescheduling Approach to High-speed Railway

A Real-time Train Timetable Rescheduling Approach to High-sp...

引用

Chinese Automation Congress (CAC)

作者： Gao, Xinyu Beijing Jiaotong Univ Sch Elect & Informat Engn Beijing Peoples R China

ISBN: (纸本)9781728140940

This paper from a macroscopic viewpoint develops a real-time train timetable rescheduling approach on a single high-speed railway line in case of a typical large disruption, where the availability of a certain track segment is temporarily lost. A multi-objective mixed-integer linear programming model is constructed to minimise the number of cancelled trains and the total delay of trains that incorporates arrival delays and departure delays. A heuristic rolling horizon algorithm is also applied so as to obtain the feasibly near-optimal solution and satisfy the practical demand of the real-time performance. The proposed approach is further tested on a real-world case study and the numerical results show that it yields better feasible solutions and consumes the desired computation time, thereby demonstrating its effectiveness and efficiency.

关键词： High-speed train rescheduling Mixed-integer linear programming rolling horizon algorithm

来源：评论

学校读者我要写书评

暂无评论

Heuristics for dynamic and stochastic inventory-routing

引用

COMPUTERS & OPERATIONS RESEARCH 2014年第PartA期52卷 55-67页

作者： Coelho, Leandro C. Cordeau, Jean-Francois Laporte, Gilbert Univ Laval Fac Sci Adm Quebec City PQ G1V 0A6 Canada HEC Montreal Montreal PQ H3T 2A7 Canada

The combination of inventory management and vehicle routing decisions yields a difficult combinatorial optimization problem called the Inventory-Routing Problem (IRP). This problem arises when both types of decisions must be made jointly, which is the case in vendor-managed inventory systems. The IRP has received significant attention in recent years, with several heuristic and exact algorithms available for its static and deterministic versions. In the dynamic version of the IRP, customer demands are gradually revealed over time and planning must be made at the beginning of each of several periods. In this context, one can sometimes take advantage of stochastic information on demand through the use of forecasts. We propose different heuristic policies to handle the dynamic and stochastic version of the IRP. We perform an extensive computational analysis on randomly generated instances in order to compare several solution policies. Amongst other conclusions we show that it is possible to take advantage of stochastic information to generate better solutions albeit at the expense of more computing time. We also find that the use of a longer rolling horizon step does not help improve solutions. Finally, we show that ensuring consistent solutions over time increases the cost of the solutions much more under a dynamic environment than in a static setting. (C) 2014 Elsevier Ltd. All rights reserved.

关键词： Dynamic demand Stochastic demand Inventory-routing rolling horizon algorithm Heuristic

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：