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

Strategic evacuation planning with pedestrian guidance and bus routing: a mixed integer programming model and heuristic solution

引用

JOURNAL OF ADVANCED TRANSPORTATION 2016年第7期50卷 1314-1335页

作者： Heydar, Mojtaba Yu, Jie Liu, Yue Petering, Matthew E. H. Univ Newcastle Callaghan NSW Australia Univ Wisconsin Dept Civil & Environm Engn Milwaukee WI 53211 USA Univ Wisconsin Dept Ind & Mfg Engn Milwaukee WI 53201 USA

This paper presents a mathematical model to plan emergencies in a densely populated urban zone where a certain numbers of pedestrians depend on transit for evacuation. The proposed model features an integrated operational framework, which simultaneously guides evacuees through urban streets and crosswalks (referred to as the pedestrian network) to designated pickup points (e.g., bus stops), and routes a fleet of buses at different depots to those pick-up points and transports evacuees to their destinations or safe places. In this level, the buses are routed through the so-called vehicular network. An integrated mixed integer linear program that can effectively take into account the interactions between the aforementioned two networks is formulated to find the maximal evacuation efficiency in two networks. Because the large instances of the proposed model are mathematically difficult to solve to optimality, a two-stage heuristic is developed to solve larger instances of the model. Results from hundreds of numerical examples analysis indicate that proposed heuristic works well in providing (near) optimal or feasibly good solutions for medium-scale to large-scale instances that may arise in real transit-based evacuation situations in a much shorter amount of computational time compared with cplex (can find optimal/feasible solutions for only five instances within 3hours of running). Copyright (c) 2016 John Wiley & Sons, Ltd.

关键词： evacuation mixed-integer linear programming vehicle routing public transit system transportation

来源：评论

学校读者我要写书评

暂无评论

Constrained dynamic programming of mixed-integer linear problems by multi-parametric programming

引用

COMPUTERS & CHEMICAL ENGINEERING 2014年 70卷 172-179页

作者： Rivotti, Pedro Pistikopoulos, Efstratios N. Univ London Imperial Coll Sci Technol & Med Dept Chem Engn Ctr Proc Syst Engn London SW7 2AZ England

This work addresses the topic of constrained dynamic programming for problems involving multi-stage mixed-integer linear formulations with a linear objective function. It is shown that such problems may be decomposed into a series of multi-parametric mixed-integer linear problems, of lower dimensionality, that are sequentially solved to obtain the globally optimal solution of the original problem. At each stage, the dynamic programming recursion is reformulated as a convex multi-parametric programming problem, therefore avoiding the need for global optimisation that usually arises in hard constrained problems. The proposed methodology is applied to a problem of mixed-integer linear nature that arises in the context of inventory scheduling. The example also highlights how the complexity of the original problem is reduced by using dynamic programming and multi-parametric programming. (C) 2014 Elsevier Ltd. All rights reserved.

关键词： Dynamic programming Multi-parametric programming mixed-integer linear programming

来源：评论

学校读者我要写书评

暂无评论

Assessment of Energy Storage Operation in Vertically Integrated Utility and Electricity Market

引用

ENERGIES 2017年第5期10卷

作者： Luburic, Zora Pandzic, Hrvoje Plavsic, Tomislav Univ Zagreb Fac Elect Engn & Comp Unska 3 Zagreb 10000 Croatia Croatian Transmiss Syst Operator Ltd Kupska 4 Zagreb 10000 Croatia

The aim of this paper is to compare the operational pattern of an energy storage system (ESS) in a vertically-integrated utility and in a deregulated market environment for different levels of wind integration. As the main feature of a vertically-integrated utility is a centralized decision-making process, all of the investment and operating decisions are made with a single goal of minimizing the overall system operating costs. As a result, an ESS in such an environment is operated in a way that is optimal for the overall system economics. On the other hand, the system operator in a deregulated market has less power over the system resources, and commitment and dispatch decisions are a result of the market clearing procedure. In this setting, the ESS owner aims at maximizing its profit, which might not be in line with minimizing overall system operating costs or maximizing social welfare. To compare the ESS operation in these two environments, we analyze the storage operation in two different settings. The first one is a standard unit commitment model with the addition of centrally-controlled storage. The second one is a bilevel model, where the upper level is a coordinated ESS profit maximization problem, while the lower level a simulated market clearing. The case study is performed on a standardized IEEE RTS-96 system. The results show a reduction in the generation dispatch cost, online generation capacity and wind curtailment for both models. Moreover, ESS significantly increases social welfare in the market-based environment.

关键词： energy storage unit commitment mixed-integer linear programming day-ahead electricity market

来源：评论

学校读者我要写书评

暂无评论

Preventing ergonomic risks with integrated planning on assembly line balancing and parts feeding

引用

INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH 2017年第24期55卷 7452-7472页

作者： Battini, Daria Calzavara, Martina Otto, Alena Sgarbossa, Fabio Univ Padua Dept Management & Engn Vicenza Italy Univ Siegen Chair Management Informat Sci Siegen Germany

In this paper, we advise to perform assembly line balancing simultaneously with decision-making on parts feeding. Such integrated planning may open additional potential to reduce labour costs. Additional planning flexibility gained with the integrated planning may be used to mitigate ergonomic risks at workplaces. We formulate the integrated assembly line balancing and parts feeding planning problem, propose a mixed-integer model and compare integrated planning to a common hierarchical planning approach in a detailed case study on the assembly of a self-priming pump. Our case study illustrates that workplaces with high ergonomic risks may emerge even in productions that involve handling parts and workpieces of low weights and avoid static and awkward postures. We also show that the proposed integrated planning approach may eliminate excessive ergonomic risks and improve productivity indicators simultaneously.

关键词： assembly line balancing part feeding mixed-integer linear programming ergonomic risks case study

来源：评论

学校读者我要写书评

暂无评论

Chance-constrained Scheduling of Variable Generation and Energy Storage in a Multi-Timescale Framework

引用

JOURNAL OF ELECTRICAL ENGINEERING & TECHNOLOGY 2017年第5期12卷 1709-1718页

作者： Tan, Wen-Shan Abdullah, Md Pauzi Shaaban, Mohamed Univ Teknol Malaysia Inst Future Energy Ctr Elect Energy Syst Johor Baharu 81310 Malaysia Univ Malaysia Sarawak Fac Engn Dept Elect & Elect Engn Kota Samarahan 94300 Sarawak Malaysia

This paper presents a hybrid stochastic deterministic multi-timescale scheduling (SDMS) approach for generation scheduling of a power grid. SDMS considers flexible resource options including conventional generation flexibility in a chance-constrained day-ahead scheduling optimization (DASO). The prime objective of the DASO is the minimization of the daily production cost in power systems with high penetration scenarios of variable generation. Furthermore, energy storage is scheduled in an hourly-ahead deterministic real-time scheduling optimization (RTSO). DASO simulation results are used as the base starting-point values in the hour-ahead online rolling RTSO with a 15-minute time interval. RTSO considers energy storage as another source of grid flexibility, to balance out the deviation between predicted and actual net load demand values. Numerical simulations, on the IEEE RTS test system with high wind penetration levels, indicate the effectiveness of the proposed SDMS framework for managing the grid flexibility to meet the net load demand, in both day-ahead and real-time timescales. Results also highlight the adequacy of the framework to adjust the scheduling, in real-time, to cope with large prediction errors of wind forecasting.

关键词： Multi-timescale scheduling Energy storage mixed-integer linear programming Unit commitment Wind generation

来源：评论

学校读者我要写书评

暂无评论

Two-machine flow shop problem with unit-time operations and conflict graph

引用

INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH 2017年第6期55卷 1664-1679页

作者： Tellache, Nour El Houda Boudhar, Mourad USTHB Univ Fac Math RECITS Lab Bab Ezzouar Algeria

This paper addresses the problem of scheduling, on a two-machine flow shop, a set of unit-time operations subject to the constraints that some conflicting jobs cannot be scheduled simultaneously on different machines. In the context of our study, these conflicts are modelled by general graphs. The problem of minimising the maximum completion time (makespan) is known to be NP-hard in the strong sense. We propose a mixed-integer linear programming (MILP) model. Then, we develop a branch and bound algorithm based on new lower and upper bound procedures. We further provide a computer simulation to measure the performance of the proposed approaches. The computational results show that the branch and bound algorithm outperforms the MILP model and can solve instances of size up to 20,000 jobs.

关键词： scheduling flow shop conflict graph mixed-integer linear programming branch and bound

来源：评论

学校读者我要写书评

暂无评论

Robust formulations for production optimization of satellite oil wells

引用

ENGINEERING OPTIMIZATION 2017年第5期49卷 846-863页

作者： Hulse, Eduardo Otte Camponogara, Eduardo Univ Fed Santa Catarina Dept Automat & Syst Engn Florianopolis SC Brazil

In the daily operation of oilfields operators are always seeking for the best operating conditions. In various situations, a drop in processing capacity is incurred by equipment failure, and prediction models are subject to uncertainty, making optimal decisions challenging. Therefore technical works have used mathematical optimization to find the optimal operation in those situations. However, uncertainty has been mostly overlooked and solutions often rely on nominal or average behaviour models. Neglecting the inherent uncertainty can impact the operating practices significantly. To this end, this work reformulates the uncertain production optimization problem as a robust optimization problem following the column-wise and row-wise frameworks, with cardinality-constrained sets. The latter allows the operator to regulate the level of protection of a solution against the uncertain model. The focus is on oilfields producing from satellite wells and with gas-lift systems. The formulations are analysed in a representative oilfield available in simulation software.

关键词： oil production piecewise-linearization robust optimization mixed-integer linear programming

来源：评论

学校读者我要写书评

暂无评论

Minimising work overload in mixed-model assembly lines with different types of operators: a case study from the truck industry

引用

INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH 2017年第21期55卷 6305-6326页

作者： Aroui, Karim Alpan, Gulgun Frein, Yannick Univ Grenoble Alpes CNRS Grenoble INP G SCOP Grenoble France

This paper considers the problem of sequencing mixed-model assembly lines (MMALs). Our goal is to determine the sequence of products to minimise work overload. This problem is known as the MMAL sequencing problem with work overload minimisation: we explicitly use task operation times to find the product sequence. This paper is based on an industrial case study of a truck assembly line. In this industrial context, as a reaction to work overloads, operators at the workstations finish their tasks before the product reaches the next workstation, but at the expense of fatigue. Furthermore, there are different types of operators, each with different task responsibilities. The originality of this work is to model this new way of reacting against work overloads, to integrate three operator types in the sequencing model and to apply the developed methods in a real industrial context. To solve this problem, we propose three meta-heuristic procedures: genetic algorithm, simulated annealing and a combination of these two meta-heuristics. All the methods proposed are tested on industrial data and compared to the solutions obtained using a mixed-integer linear programme. The results show that the proposed methods considerably improve the results of the current procedure used in the case study.

关键词： mixed-model assembly line sequencing problem work overload minimisation mixed-integer linear programming meta-heuristics

来源：评论

学校读者我要写书评

暂无评论

A lexicographic approach to the robust resource-constrained project scheduling problem

引用

INTERNATIONAL TRANSACTIONS IN OPERATIONAL RESEARCH 2017年第1-2期24卷 143-157页

作者： Palacio, Juan D. Larrea, Olga L. Inst Tecnol Metropolitano Fac Ciencias Econ & Adm Dept Calidad & Prod Calle 7376A-354 Medellin Colombia

The resource-constrained project scheduling problem (RCPSP) is one of the most studied problems in the context of project scheduling. Given the NP-hardness nature of the problem, the RCPSP has been solved mainly using heuristics. Moreover, most of the studies consider a single objective for the problem. This paper presents an exact approach based on two mixed-integer linear programming (MILP) models to solve the RCPSP. The first MILP aims to minimize makespan, while the second MILP maximizes the robustness of the schedule. The mathematical formulations are solved using a lexicographic approach. We illustrate the effectiveness of the proposed models by solving standard instances for the RCPSP available in the project scheduling problems library (PSLIB) library. Computational results show that it is possible to find alternate optimal solutions with the maximum robustness subject to the minimum makespan for instances with up to 90 activities.

关键词： project scheduling resource constrained robust scheduling mixed-integer linear programming

来源：评论

学校读者我要写书评

暂无评论

Tracking Multiple Maneuvering Targets Using integer programming and Spline Interpolation

Tracking Multiple Maneuvering Targets Using Integer Programm...

引用

International Conference on Information Fusion

作者： Ketan Date Rakesh Nagi Department of Industrial and Enterprise Systems Engineering University of Illinois at Urbana-Champaign Urbana Illinois USA

In this paper, we propose an integer programming based model for tracking multiple maneuverable targets in a planar region. The objective function of this model uses both pairs and triplets of observations, which offer more accurate representation for constant velocity targets. Triplet scores in this model are calculated using a novel approach based on cubic spline interpolation, while the data association problem is solved using a specialized multi-dimensional assignment formulation. We show that the spline interpolation based scoring model provides more accurate reconstruction of trajectories, when compared to a naive model based on linear interpolation, on various randomly generated trajectories, at the expense of modest increase in computation time. The proposed multi-dimensional assignment formulation has nice structural properties and tight linear programming relaxation bound, which results in small computation times.

关键词： Multi-target tracking Maneuvering targets mixed-integer linear programming Data association Spline interpolation

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：