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

Integrated optimization for train operation zone and stop plan with passenger distributions

TRANSPORTATION RESEARCH PART E-LOGISTICS AND TRANSPORTATION REVIEW 2018年 109卷 151-173页

作者： Qi, Jianguo Yang, Lixing Di, Zhen Li, Shukai Yang, Kai Gao, Yuan Beijing Jiaotong Univ State Key Lab Rail Traff Control & Safety Beijing 100044 Peoples R China Nanchang Inst Technol Coll Sci Nanchang 330099 Jiangxi Peoples R China

With the aim of generating system-optimal operation strategies, this paper proposes a new integrated optimization method for train operation zone, stop plan and passenger distribution optimization problems on the basis of a train stop planning model. Through the introduction of a set of critical system constraints, the problem is rigorously formulated as a two-objective mixed integer linear programming problem with the objectives of minimizing the total running distance of unoccupied seats and the total number of stops for all involved trains. Finally, two sets of numerical experiments are implemented using GAMS to demonstrate the performance of the proposed approach.

关键词： Integrated optimization Train stop plan Operation zone Passenger distribution mixed-integer linear programming model

来源：评论

学校读者我要写书评

暂无评论

Aircraft maintenance jacking problem via optimization

引用

IEEE TRANSACTIONS ON AEROSPACE AND ELECTRONIC SYSTEMS 2005年第1期41卷 99-109页

作者： Mongeau, M Bès, C Univ Toulouse 3 MIP UMR 5640 F-31062 Toulouse France

We address the problem of assigning forces to jacking positions in order to weaken stress at points where an aircraft maintenance operation has to be performed. We introduce a mixed-integer linear programming model and report encouraging computational experiments on historical data. Our methodology is currently under the process of industrial implementation at Airbus, where it will be used as a maintenance decision-analysis tool.

关键词： aircraft maintenance integer programming linear programming Airbus aircraft maintenance jacking problem aircraft maintenance operation industrial implementation jacking positions maintenance decision-analysis tool mixed-integer linear programming model aircraft maintenance Airbus mixed integer linear programming linear programming integer programming

来源：评论

学校读者我要写书评

暂无评论

Reverse logistics network design for large off-the-road scrap tires from mining sites with a single shredding resource scheduling application

引用

WASTE MANAGEMENT 2019年 100卷 219-229页

作者： Oyola-Cervantes, Jorge Amaya-Mier, Rene Univ Norte Dept Ind Engn Barranquilla 081007 Atlantico Colombia

The mining industry is one of the world's massive scrap off-the-road (OTR) tire generators. Reverse logistics (RL) allows for a cost-effective treatment of residual items with environmentally friendly practices. This paper aims to design a RL network for large OTR tires discarded from scattered mining sites, which requires a substantial initial investment in tire downsizing equipment. Therefore, the on-site use of a single shared shredding resource set is proposed with a schedule of visits between mines. Our contribution is a mixed-integer linear programming model set to determine the OTR tires optimal network, including decisions regarding a tire-fuelled power plant location, tire shredding and transport amounts, and a shredding resource set schedule to maximize the profits of the RL network while considering whole waste tire stockpile limits per year. Results showed that the proposed RL network starting from mine shredding tires and supplying a power generation plant might be a profitable solution that could help mines to comply with the legal regulations and turn this waste into a positive economic value good. Environmental and social implications are the mitigation of scrap tires, an increased job demand triggered by power plants, and public health improvement in the vicinity of the mining sites. (C) 2019 Elsevier Ltd. All rights reserved.

关键词： Reverse logistics network design Off-the-road scrap tires Mining industry case study mixed-integer linear programming model Resource sharing and scheduling Waste management regulations

来源：评论

学校读者我要写书评

暂无评论

Rule-based operation task-aware energy management for ship power systems

引用

IET GENERATION TRANSMISSION & DISTRIBUTION 2020年第25期14卷 6348-6358页

作者： Hein, Kyaw Xu, Yan Senthilkumar, Yuvarekha Gary, Wilson Gupta, Amit Kumar Nanyang Technol Univ Sch Elect & Elect Engn Singapore 639798 Singapore Nanyang Technol Univ Rolls Royce NTU Corp Lab Singapore Singapore Rolls Royce Elect Rolls Royce Singapore

This study proposes an operation task-aware energy management strategy for ship power systems that consist of main engines, diesel-electric engines, and energy storage systems. The proposed strategy aims to meet the fuel consumption and task-dependent objectives of the vessel by optimally dispatching the generation and storage units. Firstly, rule-based decisions are made based on the operational task requirements and specifications by the classification societies. Then, in the optimisation stage, these decision variables are used as inputs to formulate and update the operational constraints and the objectives of the optimisation. The optimisation problem is formulated as a mixed-integer linear programming model, and with the help of rule-based decision variables, the problem can be efficiently solved by the exhaustive search algorithm. Four case studies with different operation task sequences and ship topologies are performed to demonstrate the effectiveness of the dispatching scheme. Furthermore, the results indicate the simplicity and practicality for the actual implementation, as well as flexibility and applicability of the proposed optimal energy dispatch for different types of vessels.

关键词： energy management systems integer programming ships linear programming power generation dispatch optimisation energy storage rule-based operation task-aware energy management ship power systems operation task-aware energy management strategy main engines diesel-electric engines energy storage systems task-dependent objectives storage units rule-based decisions operational task requirements optimisation stage operational constraints optimisation problem mixed-integer linear programming model rule-based decision variables different operation task sequences ship topologies optimal energy dispatch

来源：评论

学校读者我要写书评

暂无评论

A deterministic bounding procedure for the global optimization of a bi-level mixed-integer problem

引用

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH 2021年第1期291卷 52-66页

作者： Soares, Ines Alves, Maria Joao Antunes, Carlos Henggeler INESC Coimbra DEEC Rua Silvio LimaPolo 2 P-3030290 Coimbra Portugal Univ Coimbra CeBER Av Dias da Silva 165 P-3004512 Coimbra Portugal Univ Coimbra Fac Econ Av Dias da Silva 165 P-3004512 Coimbra Portugal Univ Coimbra Dept Elect & Comp Engn Rua Silvio LimaPolo 2 P-3030290 Coimbra Portugal

In this paper, a deterministic bounding procedure for the global optimization of a mixed-integer bi-level programming problem is proposed. The aim has been to develop an efficient algorithm to deal with a case study in the electricity retail market. In this problem, an electricity retailer wants to define a time-of-use tariff structure to maximize profits, but he has to take into account the consumers' reaction by means of re-scheduling appliance operation to minimize costs. The problem has been formulated as a bi-level mixed-integer programming model. The algorithm we propose uses optimal-value-function reformulations based on similar principles as the ones that have been used by other authors, which are adapted to the characteristics of this type of (pricing optimization) problems where no upper (lower) level variables appear in the lower (upper) level constraints. The overall strategy consists of generating a series of convergent upper bounds and lower bounds for the upper-level objective function until the difference between these bounds is below a given threshold. Computational results are presented as well as a comparison with a hybrid approach combining a particle swarm optimization algorithm to deal with the upper-level problem and an exact solver to tackle the lower-level problem, which we have previously developed to address a similar case study. When the lower-level model is difficult, a significant relative MIP gap is unavoidable when solving the algorithm's subproblems. Novel reformulations of those subproblems using "elastic" variables are proposed trying to obtain meaningful lower/upper bounds within an acceptable computational time. (C) 2020 Elsevier B.V. All rights reserved.

关键词： Global optimization Bi-level optimization mixed-integer linear programming model Pricing problem Dynamic tariffs Electricity retail market Demand response

来源：评论

学校读者我要写书评

暂无评论

Mathematical programming model for centralised master planning in ceramic tile supply chains

引用

INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH 2010年第17期48卷 5053-5074页

作者： Alemany, M. M. E. Boj, J. J. Mula, Josefa Lario, Francisco-Cruz Univ Politecn Valencia CIGIP E-46071 Valencia Spain

The object of this article is to develop a centralised replenishment, production, and distribution model for ceramic tile supply chains. These supply chains are assumed to be multi-item, multi-supplier, multi-facility, multi-type and multi-level distribution centres. The model deals with multi-period master planning where sourcing considerations for replenishments, production facilities, and distribution centres are important to maximise an objective function involving the total net profit. This model is deterministic and has been formulated as a mixed-integer linear programming (MILP) model. An example based on modifications of real-world industrial problems is presented.

关键词： master planning supply chain ceramic sector mixed-integer linear programming model

来源：评论

学校读者我要写书评

暂无评论

Strategic wind power investment in competitive electricity markets considering the possibility of participation in intraday market

引用

IET GENERATION TRANSMISSION & DISTRIBUTION 2020年第14期14卷 2676-2686页

作者： Mousavi, Seyed Milad Barforoshi, Taghi Babol Noshirvani Univ Technol Dept Elect & Comp Engn Babol Sar Iran

Wind power application in producing electrical energy is an integral part of the increased eco-friendly generation. Accordingly, wind power producers may have a dominant position in some electricity markets. This study mainly concerns a strategic wind power investor who owns a number of units and seeks to optimise its expansion plans on sizes and sites of new generation capacities in a horizon year. Here, the investor is a price-maker in both day-ahead (DA) and intraday (ID) markets, while acts as a deviator in the balancing market. A stochastic bi-level model is proposed wherein the upper-level, the investor maximises the expected profit. Both DA and ID market clearings are considered in the lower-level (LL). The model is formulated as a mathematical program with equilibrium constraints (MPEC) by replacing the LL problem with its Karush-Kuhn-Tucker (KKT) conditions. The MPEC model is then converted to a mixed-integer linear programming model. A three-bus illustrative example and IEEE 24-bus reliability test system are used to demonstrate the effectiveness of the proposed model. The results confirm that the presence of the ID market in the investment model has increased the expected profits of the investor and also increases invested wind capacity.

关键词： wind power investment power markets integer programming mathematical programming wind power plants pricing power generation economics linear programming strategic wind power investment competitive electricity markets intraday market wind power application electrical energy increased eco-friendly generation wind power producers dominant position strategic wind power investor expansion plans generation capacities horizon year price-maker balancing market stochastic bi-level model upper-level expected profit lower-level Karush-Kuhn-Tucker conditions MPEC model mixed-integer linear programming model IEEE 24-bus reliability test system ID market investment model wind capacity

来源：评论

学校读者我要写书评

暂无评论

Optimal strategy to reduce energy waste in an electricity distribution network through direct/indirect bulk load control

引用

ENERGY 2024年 294卷

作者： Cerna, Fernando V. Dantas, Jamile T. Naderi, Ehsan Contreras, Javier Univ Fed Roraima Dept Elect Engn BR-69310000 Boa Vista Brazil Univ Fed Roraima Postgrad Program Nat Resources PRONAT Res Area Management & Dynam Nat Resources Renewabl Ave Nova Iorque Aeroporto BR-69310000 Boa Vista Brazil Arkansas State Univ Coll Engn & Comp Sci Dept Elect Engn Jonesboro AR 72401 USA Univ Castilla La Mancha Sch Ind Engn Ciudad Real 13071 Spain

In recent decades, the ever-increasing demand for electricity in large cities is leading the electricity distribution network (EDN) to an operational state of fatigue, especially at peak load times. In this context, load congestion, technical losses, and voltage deviations across the EDN can contribute to the high waste of electricity as well as to the worsening of the supply service. To face this problem, this paper proposes a mixed integer linear programming (MILP) model that aims to reshape the demand profile (i.e., load reduction in peak periods without load rebound in the remaining periods of the day) of total consumers while the voltage deviations and technical losses are minimized. In the proposed model, the demand profile reshaping is carried out through direct (DC) and indirect (IC) bulk control of residential, commercial, and industrial loads, while the load factor (LF), i.e., indicator related to the efficient use of electricity, is improved. Due to the scheduling of these loads at certain times of the day, the occurrence of voltage deviations and technical losses can be mitigated by the efficient control of capacitor banks (CBs). To corroborate the applicability of the proposed MILP model, the 33-node IEEE test system was used. The results show the technical and economic gains for the distribution company (DISCO) and the total number of consumers.

关键词： Capacitor banks Distribution company Electricity distribution network mixed-integer linear programming model Direct control Indirect control

来源：评论

学校读者我要写书评

暂无评论

A bi-level approach to load restoration strategy considering variant length of time steps

引用

IET GENERATION TRANSMISSION & DISTRIBUTION 2022年第2期16卷 319-332页

作者： Sun, Lei Yang, Zhichao Li, Mingming Ding, Ming Liang, Bomiao Hefei Univ Technol Sch Elect Engn & Automat Hefei Peoples R China Anhui Prov Key Lab Renewable Energy Utilizat & En Hefei Peoples R China Zhejiang Univ Sci & Technol Sch Automat & Elect Engn Hangzhou Peoples R China

A bi-level load restoration optimisation strategy is proposed for the transmission system with wind farm-energy storage combined systems (WESs), taking the variant length of time steps into account. The upper level model is proposed to maximise weighted restored loads, and formulated as a mixed-integer linear programming model. After solving the upper model, the optimal load pickup and transmission line restoration scheme can be obtained and delivered to the lower level model. The lower level model adopts a non-linear model to minimise the length of the current time step, which is delivered to the upper lever model. By iteratively solving the upper and lower level models, the optimal load pickup and transmission line restoration scheme as well as the optimal length of current time step can be obtained. To minimise the gap between the scheduled generation of the WES and its actual power generation, a real-time energy storage (ES) dispatch strategy is proposed taking maximum charging-discharging cycles of the ES into account. The entire load restoration strategy can be obtained by iteratively solving the proposed model with updated operational conditions of power systems. Finally, two test systems are employed to verify the validity and correctness of the proposed model.

关键词： transmission line restoration scheme power transmission lines dispatch strategy wind farm-energy storage combined systems power system restoration power generation dispatch wind power plants bi-level load restoration optimisation strategy integer programming current time step mixed-integer linear programming model iterative method charging-discharging cycles transmission system nonlinear model actual power generation WES iterative methods

来源：评论

学校读者我要写书评

暂无评论

mixed-integer linear programming and composed heuristics for three-stage remanufacturing system scheduling problem

引用

ENGINEERING APPLICATIONS OF ARTIFICIAL INTELLIGENCE 2024年第PartB期137卷

作者： Wang, Wenjie Tian, Guangdong Zhang, Honghao Li, Zhiwu Lv, Lei Li, Cheng Zhengzhou Univ Sch Mech & Power Engn Zhengzhou 450001 Peoples R China Beijing Univ Civil Engn & Architecture Sch Machinery & Vehicles Beijing 100044 Peoples R China Shandong Univ Sch Mech Engn Jinan 250061 Peoples R China Macau Univ Sci & Technol Inst Syst Engn Taipa 999078 Macao Peoples R China

The three-stage remanufacturing system scheduling problem (3T-RSSP) has been a hot research topic recently. The remanufacturing system in this paper is equipped with a novel configuration of unrelated parallel disassembly/reassembly workstations and parallel dedicated flow-shop-type reprocessing lines. To this end, a mixedinteger linear programming (MILP) model based on the adjacent sequence-based modeling idea is first proposed to address the 3T-RSSP for a makespan minimization. Compared with other ideas, the adjacent sequence-based modeling idea is effective in deciding precedence relationship between two adjacent operations, especially for the investigated 3T-RSSP. The 3T-RSSP is NP (non-deterministic polynomial)-hard, we also design 18 composed heuristics for large-sized problems to gain a better performance, compared to traditional isolated heuristics. Simulation experiments are carried out on a publicly available dataset to test the performance the MILP model and composed heuristics. Results imply that the MILP model solved by CPLEX can seek optimum solutions within a short time when the problem size is small. It is found that when problem size becomes 2.0, 4.0, 8.0 times large, performance indicators NCs (number of constraints) and NBVs (number of binary variables) of the model become 3.29, 11.81, 44.60 and 3.43, 12.57, 48.00 times large. Besides, compared with other composed heuristics, LTRTF (longest total reprocessing time-first available machine) gains the best performance. Instance P5-C3-D2/A2 is selected to quantitatively analyze the MILP model by presenting the detailed 0-1 binary variable values. Finally, by comparing with position-based MILP model, the adjacent sequence-based MILP model has better performance in characterizing the investigated 3T-RSSP.

关键词： Remanufacturing system scheduling Makespan mixed-integer linear programming model Exact algorithm Composed heuristics

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：