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

Signal coordination models for long arterials and grid networks

TRANSPORTATION RESEARCH PART C-EMERGING TECHNOLOGIES 2016年 71卷 215-230页

作者： Zhang, Lihui Song, Ziqi Tang, Xiaojun Wang, Dianhai Zhejiang Univ Inst Transportat Engn Hangzhou 310058 Zhejiang Peoples R China Utah State Univ Dept Civil & Environm Engn Logan UT 84322 USA Dalian Univ Technol Sch Transportat & Logist Dalian 116024 Peoples R China

This paper proposes two models to tackle traffic signal coordination problems for long arterials and grid networks. Both models, denoted as MaxBandLA and MaxBandGN, are built based on Little's bandwidth maximization model, and the resulting formulations are both small-sized mixed-integer linear programs. Model MaxBandLA can optimize arterial partition plan and signal coordination plans of all the subsystems simultaneously. Model MaxBandGN directly optimizes the offsets for all the signals in a grid network, and as such, no 'cycle constraints' need to be constructed. Numerical tests are presented to show that both models have the potential to produce coordination plans that are comparable to signal plans optimized by Synchro. (C) 2016 Elsevier Ltd. All rights reserved.

关键词： Signal coordination Long arterial Grid network Bandwidth maximization mixed-integer linear program

来源：评论

学校读者我要写书评

暂无评论

A mathematical approach to find long-term strategies for the implementation of resource-orientated sanitation

引用

WATER SCIENCE AND TECHNOLOGY 2013年第7期67卷 1442-1454页

作者： Alves, I. Kaufmann Univ Kaiserslautern Inst Urban Water Management D-67663 Kaiserslautern Germany

In the present discussion of sustainability centralised water infrastructures are exposed to new challenges, which may cause a conceptual alteration in urban water management. If technologies for closing urban water and nutrient cycles are to at least partially replace existing systems, then intensive reconstruction work becomes essential. The paper presents the development and implementation of a mathematical approach to minimise environmental impact and economic costs on the way to more source-controlled future states in urban water management. To find an optimal transformation strategy, a simultaneous project scheduling and network flow problem was defined as a bi-criteria mixed-integer program. An optimal solution is found by minimising two objective functions concurrently - the economic costs and 'ecologic costs' for the period of consideration. This paper discusses the influence of the weighting of these two costs on optimal transformation strategies for a real catchment in Germany. The results show that the approach can very well support decision makers when showing all impacts of transformation processes in detail. All in all, the developed model can be seen as a first step in strategy-finding for transformations in existing urban water systems.

关键词： decision support mathematical optimisation mixed-integer linear program resource-orientated sanitation transformation strategies

来源：评论

学校读者我要写书评

暂无评论

Estimating flexibility preferences to resolve temporal scheduling conflicts in activity-based modelling

引用

TRANSPORTATION 2024年第2期51卷 501-528页

作者： Manser, Patrick Haering, Tom Hillel, Tim Pougala, Janody Krueger, Rico Bierlaire, Michel Swiss Fed Railways SBB Hilfikerstr 1 CH-3000 Bern 65 Switzerland Ecole Polytech Fed Lausanne EPFL Transport & Mobil Lab TRANSP OR Stn 18 CH-1015 Lausanne Switzerland Univ Coll London UCL London England Tech Univ Denmark DTU Dept Technol Management & Econ DK-2800 Lyngby Denmark

This paper presents a novel activity-based demand model that combines an optimisation framework for continuous temporal scheduling decisions (i.e. activity timings and durations) with traditional discrete choice models for non-temporal choice dimensions (i.e. activity participation, number and type of tours, and destinations). The central idea of our approach is that individuals resolve temporal scheduling conflicts that arise from overlapping activities, e.g. needing to work and desiring to shop at the same time, in order to maximise their daily utility. Flexibility parameters capture behavioural preferences that penalise deviations from desired timings. This framework has three advantages over existing activity-based modelling approaches: (i) the time conflicts between different temporal scheduling decisions including the activity sequence are treated jointly;(ii) flexibility parameters follow a utility maximisation approach;and (iii) the framework can be used to estimate and simulate a city-scale case study in reasonable time. We introduce an estimation routine that allows flexibility parameters to be estimated using real-world observations as well as a simulation routine to efficiently resolve temporal conflicts using an optimisation model. The framework is applied to the full-time workers of a synthetic population for the city of Lausanne, Switzerland. We validate the model results against reported schedules. The results demonstrate the capabilities of our approach to reproduce empirical observations in a real-world case study.

关键词： Activity-based model Discrete choice Mathematical optimisation Maximum likelihood estimation mixed-integer linear program

来源：评论

学校读者我要写书评

暂无评论

The splittable pickup and delivery problem with reloads

引用

EUROPEAN JOURNAL OF INDUSTRIAL ENGINEERING 2008年第2期2卷 112-133页

作者： Kerivin, H. L. M. Lacroix, M. Mahjoub, A. R. Quilliot, A. Univ Paris 09 F-75775 Paris 16 France Univ Clermont Ferrand LIMOS CNRS UMR 6158 F-63177 Aubiere France

In this paper, we consider a variant of the Pickup and Delivery Problem (PDP), where any demand may be dropped off elsewhere other than its destination, picked up later by the same or another vehicle, and so on until it has reached its destination. We discuss the complexity of this problem and present two mixed-integer linear programming formulations based on a space-time graph. We describe some valid inequalities for the problem along with separation routines. Based on these results, we develop a branch-and-cut algorithm for the problem, and present some computational results. [Received 31 January 2007;Revised 08 August 2007;Accepted 02 October 2007]

关键词： transportation problem mixed-integer linear program multicommodity flow metric inequalities branch-and-cut

来源：评论

学校读者我要写书评

暂无评论

An ultra-fast optimization algorithm for unit commitment based on neural branching

引用

ENERGY REPORTS 2023年 9卷 1112-1120页

作者： Sun, Yi Wu, Jun Zhang, Guofang Zhang, Lei Li, Ran State Grid Sichuan Elect Power Co Sichuan 610041 Peoples R China Shanghai Jiao Tong Univ Sch Smart Energy Shanghai 200240 Peoples R China

The computational efficiency of unit commitment (UC) is important for power system operations. Traditionally the unit commitment problem is solved per hour in a day, but with the scale of the power system and the electricity market continuing to expand, the large-scale UC problem will be hard to be solved within 1 h which will affect the power system operation and market clearing. To reduce the solving time of the large-scale UC problem, an ultra-fast optimization algorithm of neural branching for unit commitment (NBUC) is proposed. NBUC learns the branch and bound (B&B) decision made by full strong branching (FSB), which can generate the perfect B&B order to minimize the iterative process but take a lot of time to decide the perfect order by using graph convolutional neural network according to the historical data, and then makes the perfect order prediction with a certain precision without spending a lot of time to make B&B decision which minimizes the solving time including the iteration time and decision time in order to solve the large-scale UC problem quickly. A modified RTS-96 bus system is used to validate the effectiveness of the proposed NBUC. The results show 9.3% and 23.2% reductions in computational time compared with commercial software CPLEX and SCIP. (c) 2023 The Author(s). Published by Elsevier Ltd. This is an open access article under the CC BY-NC-ND license (http://***/licenses/by-nc-nd/4.0/).

关键词： Unit commitment mixed-integer linear program Branch-and-bound Graph convolutional neural network Neural branching

来源：评论

学校读者我要写书评

暂无评论

Partner selection and synchronized planning in dynamic manufacturing networks

引用

IEEE TRANSACTIONS ON ROBOTICS AND AUTOMATION 2003年第1期19卷 117-130页

作者： Viswanadham, N Gaonkar, RS Natl Univ Singapore Logist Inst Asia Pacific Singapore 119260 Singapore

In this paper, we develop a mixed-integer programming model for integrated partner selection and scheduling in an Internet-enabled dynamic manufacturing network environment. We assume that all stakeholders in the supply chain (SC) share information on their capacities, schedules, and cost structures. Based on this information, the model addresses the issue of partner selection and SC synchronization for profit maximization, while considering various manufacturing and logistics constraints. Furthermore, we study the dynamic configuration of the SC and its performance with respect to different buyer locations, different order patterns, and the utilization of transshipment hubs. The model is solved using optimization tools from ILOG, located in Paris, France, and Mountain View, CA.

关键词： Internet-enabled supply chains mixed-integer linear program partner selection supply chain design supply chain planning and scheduling

来源：评论

学校读者我要写书评

暂无评论

Routing and emergency-response-team siting for high-level radioactive waste shipments

引用

IEEE TRANSACTIONS ON ENGINEERING MANAGEMENT 1998年第2期45卷 141-152页

作者： List, GF Turnquist, MA Rensselaer Polytech Inst Dept Civil Engn Troy NY 12180 USA Cornell Univ Sch Civil & Environm Engn Ithaca NY 14853 USA

Route choice and emergency-response-team siting are both important facets of any high-level radioactive-waste shipment campaign, These two sets of decisions are clearly related, and both involve multiple objectives, This paper describes a methodology for making these decisions jointly, in a logical and sequential fashion, and illustrates the technique using preliminary estimates of shipments to be made to the Waste Isolation Pilot Project facility.

关键词： decision support systems high-level radioactive waste transportation mixed-integer linear program multiobjective routing multiobjective siting

来源：评论

学校读者我要写书评

暂无评论

Improving the robustness and efficiency of crude scheduling algorithms

引用

AICHE JOURNAL 2007年第10期53卷 2659-2680页

作者： Li, Jie Li, Wenkai Karimi, I. A. Srinivasan, Rajagopalan Natl Univ Singapore Dept Chem & Biomol Engn Singapore 117576 Singapore Inst Chem & Engn Sci Jurong Isl 627833 Singapore

Higher crude prices have made it even more imperative that refiners blend low-quality and high-quality crudes optimally to maximize their margins. Mathematical modeling of crude blending results in bilinear terms, which combined with commonly used feed quality specifications, make crude scheduling a large, nonconvex, mixed-integer nonlinear optimization problem. The existing literature algorithms and software (DICOPT/GAMS and BARON/GAMS;Brooke et al., GAMS: a user's guide, GAMS, 1998) fail to solve practical instances of this difficult and useful problem. In this paper, we first enhance the practical utility of our previous crude scheduling algorithm by adding 15 properties and corresponding linearly additive indices, which are used in the refinery industry to ensure feed quality. Then, we propose some new iterative strategies to improve the robustness and solution quality of this algorithm. We also propose a partial relaxation strategy to increase its solution speed. We prove its enhanced performance using 24 industry-scale examples, and estimate bounds on solution quality. In contrast to existing algorithms or software that fail to solve most of these problems, our revised algorithm solves all problems successfully and gives profits within 6% of our computed upper bounds. (c) 2007 American Institute of Chemical Engineers.

关键词： crude oil scheduling refinery short-term scheduling blending operations mixed-integer linear program crude quality

来源：评论

学校读者我要写书评

暂无评论

Modeling Load Redistribution Attacks in Integrated Electricity-Gas Systems

引用

IEEE TRANSACTIONS ON SMART GRID 2024年第4期15卷 4115-4127页

作者： Liu, Rong-Peng Wang, Xiaozhe Zeng, Bo Zgheib, Rawad McGill Univ Dept Elect & Comp Engn Montreal PQ H3A 0E9 Canada Univ Pittsburgh Dept Ind Engn Pittsburgh PA 15106 USA Univ Pittsburgh Dept Elect & Comp Engn Pittsburgh PA 15106 USA Hydro Quebec Res Inst Varennes PQ J3X1S1 Canada

As the share of gas-fired power generation continues to increase, it is essential to consider integrated electricity-gas systems (IEGSs). However, the development of IEGSs has led to an increased reliance on cyber infrastructures, such as communication systems, which in turn makes IEGSs more susceptible to cyberattacks. This paper investigates the paradigm and stealthy conditions of load redistribution (LR) attacks on IEGSs and proposes a bilevel mixed-integer model to identify the most severe LR attack from an economic perspective. Under a mild assumption, we prove that the proposed model does not exclude any possible upper-level attack, which differs from existing models that may yield suboptimal solutions. A modified reformulation and decomposition (R&D) algorithm is developed to solve this model in a master-subproblem framework. Particularly, we design a new subproblem to address potential infeasibility issues in the master problem. Accordingly, two types of cuts are added to the master problem for ensuring algorithm feasibility and solution optimality. Testing results validate the effectiveness of the proposed model and solution method.

关键词： Pipelines Computer crime Power systems Transmission line measurements Research and development Mathematical models Load modeling Bilevel program cybersecurity integrated electricity and gas systems load redistribution attacks mixed-integer linear program

来源：评论

学校读者我要写书评

暂无评论

A mathematical model for planning transportation of multiple petroleum products in a multi-pipeline system

引用

COMPUTERS & CHEMICAL ENGINEERING 2010年第3期34卷 401-413页

作者： Herran, A. de la Cruz, J-M. de Andres, B. Univ Complutense Dept Comp Sci Engn CES Felipe 2 Aranjuez 28300 Spain Univ Complutense Dept Comp Architecture & Automat Control Aranjuez 28300 Spain

A multiproduct Pipeline provides an economic way to transport large Volumes of refined petroleum products over long distances. In such a pipeline, different products are pumped back-to-back without any separation device between them. Sometimes, multiproduct pipelines can be connected together, resulting in a more complex system commonly named multi-pipeline system. This paper proposes a new discrete mathematical approach to solve short-term operational planning Of multi-pipeline systems for refined products. This model is based on a discrete approach that divides both the planning horizon into time intervals of equal duration and the individual polyducts into packages of equal volume each containing a single product. Numerical examples are solved in order to show the performance of the proposed model. All the instances are implemented with the OPL modeling language running CPLEX as solver. (C) 2009 Elsevier Ltd. All rights reserved.

关键词： Multiproduct pipeline Multi-pipeline system Transportation Planning and scheduling Discrete approach mixed-integer linear program

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：