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

Predictive route control for automated baggage handling systems using mixed-integer linear programming

TRANSPORTATION RESEARCH PART C-EMERGING TECHNOLOGIES 2011年第3期19卷 424-439页

作者： Tarau, A. N. De Schutter, B. Hellendoorn, J. Delft Univ Technol Delft Ctr Syst & Control NL-2628 CD Delft Netherlands

State-of-the-art baggage handling systems transport luggage in an automated way using destination coded vehicles (DCVs). These vehicles transport the bags at high speeds on a network of tracks. In this paper we consider the problem of controlling the route of each DCV in the system. In general this results in a nonlinear, nonconvex, mixed-integer optimization problem, usually very expensive in terms of computational effort. Therefore, we present an alternative approach for reducing the complexity of the computations by simplifying and approximating the nonlinear optimization problem by a mixed-integer linear programming (MILP) problem. The advantage is that for MILP problems solvers are available that allow us to efficiently compute the global optimal solution. The solution of the MILP problem can then be used as a good initial starting point for the original nonlinear optimization problem. We use model predictive control (MPC) for solving the route choice problem. To assess the performance of the proposed (nonlinear and MILP) formulations of the MPC optimization problem, we consider a benchmark case study, the results being compared for several scenarios. (C) 2010 Elsevier Ltd. All rights reserved.

关键词： Baggage handling systems Route choice control mixed-integer linear programming

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

A bi-level programming approach to locate capacitated electric vehicle charging stations 6

A bi-level programming approach to locate capacitated electr...

引用

6th International Conference on Control, Decision and Information Technologies (CoDIT)

作者： Makhlouf, Walid Kchaou-Boujelben, Mouna Gicquel, Celine Univ Paris Sud Lab Rech Informat Orsay France United Arab Emirates Univ Coll Business & Econ Al Ain U Arab Emirates

ISBN: (纸本)9781728105215

We consider the design of a charging infrastructure based on fast-charging capacitated stations to enable electric vehicles to carry out long-distance trips. We focus on taking into account the impact of the non-system-optimal drivers' behavior on the station capacity consumption in the modeling of the facility location problem. This leads to the formulation of a bi-level optimization model. In this bi-level program, the upper level represents the station location problem faced by the charging infrastructure provider and the lower level represents the selfish behavior of EV drivers who will seek to use the charging stations opened by the infrastructure provider to carry out their trips with a minimum number of stops. We propose a solution approach based on the reformulation of the bi-level program into a mixed-integer linear program thanks to the use of the primal-dual optimality conditions of linear programming. Our preliminary computational experiments carried out on small instances show the impact on the global system performance of ignoring the selfish drivers' behavior and the potential benefit from using a bi-level programming model.

关键词： Electric vehicles facility location capacitated stations bi-level programming mixed-integer linear programming

来源：评论

学校读者我要写书评

暂无评论

Large-scale Multi-dimensional Assignment: Problem Formulations and GPU Accelerated Solutions 22

Large-scale Multi-dimensional Assignment: Problem Formulatio...

引用

22nd International Conference on Information Fusion (FUSION)

作者： Reynen, Olivia Vadrevu, Samhita Nagi, Rakesh LeGrand, Keith Univ Illinois Dept Ind & Enterprise Syst Engn Urbana IL 61801 USA Sandia Natl Labs POB 5800 Albuquerque NM 87185 USA

ISBN: (纸本)9780996452786

In this paper, we present alternate integer programming formulations for the multi-dimensional assignment problem, which is typically employed for multi-sensor fusion, multi-target tracking (MTT) or data association in general. The first formulation is the Axial Multidimensional Assignment Problem with Decomposable Costs (MDADC). The decomposable costs comes from the fact that there are only pairwise costs between stages or scans of a target tracking problem or corpuses of a data association context. The difficulty with this formulation is the large number of transitivity or triangularity constraints that ensure if entity A is associated to entity B and entity B is associated with entity C, then it must also be that entity A is associated to entity C. The second formulation uses both pairs and triplets of observations, which offer more accurate representation for kinematic tracking of targets. This formulation avoids the large number of transitivity constraints but significantly increases the number of variables due to triples. Solution to large-scale problems has alluded researchers and practitioners alike. We present solution methods based on Lagrangian Relaxation and massively parallel algorithms that are implemented on Graphics Processing Units (GPUs). We test the problem formulations and solution algorithms on MTT problems. The triples formulation tends to be more accurate for tracking measures and the MDADC solver can solve much larger problems in reasonable computational time.

关键词： Multi-dimensional Assignment Data Association Multi-target tracking mixed-integer linear programming Lagrangian Relaxation GPU computing

来源：评论

学校读者我要写书评

暂无评论

A Constraint programming Approach to Electric Vehicle Routing with Time Windows 1

引用

16th International Conference on the Integration of Constraint programming, Artificial Intelligence, and Operations Research (CPAIOR)

作者： Booth, Kyle E. C. Beck, J. Christopher Univ Toronto Dept Mech & Ind Engn Toronto ON M5S 3G8 Canada

ISBN: (数字)9783030192129

ISBN: (纸本)9783030192129;9783030192112

The Electric Vehicle Routing Problem with Time Windows (EVRPTW) extends traditional vehicle routing to address the recent development of electric vehicles (EVs). In addition to traditional VRP problem components, the problem includes consideration of vehicle battery levels, limited vehicle range due to battery capacity, and the presence of vehicle recharging stations. The problem is related to others in emissions-conscious routing such as the Green Vehicle Routing Problem (GVRP). We propose the first constraint programming (CP) approaches for modeling and solving the EVRPTW and compare them to an existing mixed-integer linear program (MILP). Our initial CP model follows the alternative resource approach previously applied to routing problems, while our second CP model utilizes a single resource transformation. Experimental results on various objectives demonstrate the superiority of the single resource transformation over the alternative resource model, for all problem classes, and over MILP, for the majority of medium-to-large problem classes. We also present a hybrid MILP-CP approach that outperforms the other techniques for distance minimization problems over long scheduling horizons, a class that CP struggles with on its own.

关键词： Electric Vehicle Routing Green Vehicle Routing Constraint programming mixed-integer linear programming Optimization

来源：评论

学校读者我要写书评

暂无评论

Grid Friendly Operation of a PV-Storage System with Profit Maximization and Reliability Enhancement 2

Grid Friendly Operation of a PV-Storage System with Profit M...

引用

2nd International Conference on Smart Energy Systems and Technologies (SEST)

作者： Tziovani, Lysandros Kolios, Panayiotis Hadjidemetriou, Lenos Kyriakides, Elias Univ Cyprus KIOS Res & Innovat Ctr Excellence Nicosia Cyprus Univ Cyprus Dept Elect & Comp Engn Nicosia Cyprus

ISBN: (纸本)9781728111568

The intermittent character of renewable energy sources (RES) creates market potentials for the emerging energy storage technologies. Energy storage systems can be utilized to support the grid, compensate the intense variation of RES production, and create opportunities for prosumers to maximize their profit under a variable electricity pricing scheme. In this paper, an optimal scheduling method is designed for a hybrid photovoltaic-storage system in a non-residential building. The scheduling scheme defines the utilization of a flywheel based storage device to minimize the cost of the electricity bill and simultaneously reduces the peak power exchange with the grid for a smooth power interaction. Further, the method considers the lifetime extension of the hybrid system grid-tied inverter by limiting the maximum output power of the inverter, without any energy shedding of solar power. The proposed optimization problem is solved for the day ahead using predicted input data. Several case studies are examined and useful results are obtained according to the profit and the grid interaction of the prosumer.

关键词： Energy management grid interaction inverter lifetime mixed-integer linear programming optimization

来源：评论

学校读者我要写书评

暂无评论

On the equal substitution of MILP unit commitment subproblems with dynamic programming 16

On the equal substitution of MILP unit commitment subproblem...

引用

16th International Conference on the European Energy Market (EEM)

作者： Schwaeppe, Henrik Nobis, Moritz Mueller, Christoph Rhein Westfal TH Aachen Inst High Voltage Technol Aachen Germany

ISBN: (纸本)9781728112572

By splitting unit commitment into a coupling problem and individual unit commitment subproblems, Lagrangian relaxation is very effective in decreasing the solving time of large scale problems. Consequently, unit commitment subproblems should be solved equally fast. If they have been originally formulated in mixed-integer linear programming, performance advantages can be expected by replacing it with dynamic programming. However, it has not been reported whether a one-to-one reformulation is feasible. We suggest approaches to choose states for dynamic programming that replicate equal solutions as well as measures to reduce memory requirements. Results of the two subproblem models differ only fractionally and for explicable reasons. Subproblem computation time has been reduced by up to 100 times at modest memory requirements.

关键词： Unit commitment dynamic programming mixed-integer linear programming Lagrangian relaxation

来源：评论

学校读者我要写书评

暂无评论

Global optimization method for mixed transportation network design problem: A mixed-integer linear programming approach

引用

TRANSPORTATION RESEARCH PART B-METHODOLOGICAL 2011年第5期45卷 808-827页

作者： Luathep, Paramet Sumalee, Agachai Lam, William H. K. Li, Zhi-Chun Lo, Hong K. Hong Kong Polytech Univ Dept Civil & Struct Engn Kowloon Hong Kong Peoples R China Prince Songkla Univ Fac Engn Dept Civil Engn Hat Yai Songkhla Thailand Huazhong Univ Sci & Technol Sch Management Wuhan 430074 Peoples R China Hong Kong Univ Sci & Technol Dept Civil & Environm Engn Hong Kong Hong Kong Peoples R China

This paper proposes a global optimization algorithm for solving a mixed (continuous/discrete) transportation network design problem (MNDP), which is generally expressed as a mathematical programming with equilibrium constraint (MPEC). The upper level of the MNDP aims to optimize the network performance via both expansion of existing links and addition of new candidate links, whereas the lower level is a traditional Wardrop user equilibrium CUE) problem. In this paper, we first formulate the UE condition as a variational inequality (VI) problem, which is defined from a finite number of extreme points of a link-low feasible region. The MNDP is approximated as a piecewise-linear programming (P-LP) problem, which is then transformed into a mixed-integer linear programming (MILP) problem. A global optimization algorithm based on a cutting constraint method is developed for solving the MILP problem. Numerical examples are given to demonstrate the efficiency of the proposed method and to compare the results with alternative algorithms reported in the literature. (C) 2011 Elsevier Ltd. All rights reserved.

关键词： Network design problem Discrete network design mixed network design mixed-integer linear programming Global optimization

来源：评论

学校读者我要写书评

暂无评论

Inventory Replenishment Policy for Medicines with Non-Stationary Stochastic Demand: The Case of a Newly Opened Hospital in Thailand

Inventory Replenishment Policy for Medicines with Non-Statio...

引用

IEEE International Conference on Industrial Engineering and Engineering Management (IEEM)

作者： Hasachoo, N. Sirisawat, P. Kaewket, T. Mae Fah Luang Univ Sch Management Logist & Supply Chain Management Programrt Chiang Rai Thailand

ISBN: (纸本)9781728138046

Inventory and replenishment planning of medicines play a vital role in hospital management. A large replenishment quantity can lower the percentage of medicine shortage, which might be critical for a patient's life, but somehow needed to be traded off with high inventory cost from excessive stock. Especially for a vital medicine with non-stationary stochastic demand e.g., antivenom serum or adrenaline, demand for these medicines found to be intermittent since it's an unpredictable event, but a shortage of these medicines when needed will result in a serious loss. Adequate recorded data allow the pharmacist a better decide on its replenishment policy. However, this case study is not yet existed since a hospital has just opened for four months. Hence, the objective of this paper is to propose a replenishment policy (R-n,S-n) for this type of medicine including optimal order-up-to level and period with lowest expected total cost using Tarim and Kingsman's MILP. A newly opened hospital in Thailand was selected as a case study. The results were compared with current policy and now being cited as its reference order-up-to level.

关键词： Inventory planning hospital logistics optimization mixed-integer linear programming intermittent demand

来源：评论

学校读者我要写书评

暂无评论

A Comparison of MILP and Metaheuristic Approaches for Implementation of a Home Energy Management System under Dynamic Tariffs 2

A Comparison of MILP and Metaheuristic Approaches for Implem...

引用

2nd International Conference on Smart Energy Systems and Technologies (SEST)

作者： Rasouli, Vahid Goncalves, Ivo Antunes, Carlos Henggeler Gomes, Alvaro Univ Coimbra INESC Coimbra DEEC Coimbra Portugal

ISBN: (纸本)9781728111568

This paper compares two different methodological approaches - a mixed-integer linear programing (MILP) model and a metaheuristic (a genetic algorithm, GA) - to be embedded in a Home Energy Management System (HEMS) with the aim to make the integrated optimization of energy resources under dynamic tariffs. Different types of demand-side resources, including shiftable, interruptible and thermostatically controlled loads as well as local generation and storage, have been considered. The objective is to minimize the electricity cost including the monetization of the dissatisfaction of end-users with possible changes of load operation. Since these two objectives are in conflict, a compromise solution is sought according to the end-user's profile. Different end-users' preferences are considered embodying different sensitivity levels of end-users to the cost and the energy service satisfaction.

关键词： Energy management system mixed-integer linear programming genetic algorithm demand-side flexibility smart grid dynamic tariffs

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：