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

International Conference on Management Science and Engineering (ICMSE)

作者： Li-hong Shi Transportation Management College Dalian Maritime University China

The medical waste management is of great importance due to its potential environmental hazards and public health risks. Manufacturers have to collect the medical waste and control its recovery or disposal. Medical waste recovery, which encompasses reuse, remanufacturing and materials recycling, requires a specially structured reverse logistic network in order to collect medical waste efficiently. This paper has attempted to apply the basic theories of reverse logistics to improve the effect of medical waste management. We presents a mixed integer linear programming model of reverse logistics networks for returned medical waste. The efficiency and practicability of the proposed model is validated by an application to an illustrative example dealing with medical waste returned from some hospitals to a given medical materials producer.

关键词： mixed integer linear programming Reverse logistics Waste management Waste materials Hazards Public healthcare Manufacturing Waste recovery Recycling Hospitals

来源：评论

学校读者我要写书评

暂无评论

Acceleration of Benders decomposition for mixed integer linear programming

Acceleration of Benders decomposition for mixed integer line...

引用

International Symposium on Advanced Control of Industrial Processes (ADCONIP)

作者： Yu Yang Jong Min Lee Department of Chemical and Materials Engineering University of Alberta Edmonton AB Canada School of Chemical and Biological Engineering Seoul South Korea

This paper presents a novel strategy for speeding-up the classical Benders decomposition for large-scale mixed integer linear programming problems. This method is particularly useful for the cases where the optimality cut is difficult to obtain. The distances between the selected feasible points and feasibility cutting planes, as a metric, determine the tighter constraint, thus improving the convergence rate. The application of this approach in a scheduling problem for multi-product, multi-purpose batch plants show substantial improvement both in the computational time and the number of Benders iterative steps.

关键词： Optimization Inductors Feeds linear programming Convergence Upper bound mixed integer linear programming

来源：评论

学校读者我要写书评

暂无评论

Neural Network-Based Lyapunov Stability Verification for Continuous-Time Nonlinear Systems via mixed integer linear programming

Neural Network-Based Lyapunov Stability Verification for Con...

引用

IEEE International Conference on Control and Robotics Engineering (ICCRE)

作者： Jingya Wang Yongbin Yu Xiangxiang Wang Xiao Feng Xinyi Han Jingye Cai School of Information and Software Engineering University of Electronic Science and Technology of China Chengdu China

ISBN: (数字)9798350372694

ISBN: (纸本)9798350372700

This paper discusses Lyapunov stability verification methods for continuous-time nonlinear systems. Traditional mathematical methods require a lot of manual calculations, which consume a lot of time and energy. To address the problem of the low efficiency in traditional methods, this paper introduces neural networks into the design of the Lyapunov function to achieve independent verification. First, a neural network is used to represent the Lyapunov function. Then, the Lyapunov stability condition is converted into a mixed integer linear programming (MILP) problem, and the solution to the optimization problem is solved through the MILP solver to verify whether the output of the neural network satisfies the Lyapunov stability condition. In addition, this paper gives the training loss function of the Lyapunov neural network, which mainly consists of optimization problems. Finally, a simulation example is given to illustrate the effectiveness of this method.

关键词： Training Deep learning Neural networks Manuals Stability analysis mixed integer linear programming Nonlinear systems

来源：评论

学校读者我要写书评

暂无评论

Trajectory Generation in Relative Velocity Coordinates Using mixed integer linear programming with IHDR Guidance

Trajectory Generation in Relative Velocity Coordinates Using...

引用

IEEE International Conference on Automation Science and Engineering (CASE)

作者： Di Zu Jianda Han Dalong Tan Robotics Laboratory Shenyang Institute of Automation Chinese Academy and Sciences Shenyang China

mixed-integer linear programming (MILP) for trajectory generation of mobile robot suffers from nonlinear constraints due to complex obstacle contours and dynamic environment. In this paper, firstly, we introduce a relative velocity coordinates MILP (RVCs-MILP) for solving the nonlinear constraints problem in the trajectory generation of the target pursuit and multiple-obstacle avoidance (TPMOA). The computational load of the RVCs-MILP does not increase with the complexity of obstacle contour but only relates to the number of the obstacles. It can be applied in real time when the number of the obstacles is small. For the large numbers of obstacles avoidance, further, we propose an IHDR based online learning mechanism. It sets up a "scenario-action mapping" knowledge base by continuously offline training and online updating. For a trajectory generation task, it will search a best match path of the current state in the knowledge base according to the external environments and the state of the robot in real time. Simulations are presented in comparison with the evolution algorithms (EA) and IHDR The former shows significant improvement in a number of aspects. The latter confirms the validation of the proposed IHDR methods.

关键词： mixed integer linear programming Robot kinematics Robotics and automation Learning systems Image recognition Trajectory Mobile robots Content addressable storage USA Councils Humans

来源：评论

学校读者我要写书评

暂无评论

A mixed integer linear programming based optimal home energy management scheme considering grid-connected microgrids

A mixed integer linear programming based optimal home energy...

引用

International Wireless Communications and Mobile Computing Conference

作者： Sheraz Aslam Nadeem Javaid Muhammad Asif Umar Iqbal Zafar Iqbal Mian Ahmer Sarwar COMSATS Institute of Information Technology Islamabad Pakistan Virtual University of Pakistan PMAS Arid Agriculture University Rawalpindi Pakistan

In this paper, we propose a home energy management (HEM) scheme in the residential area for electricity cost and peak to average ratio (PAR) reduction. Furthermore, reduction in imported electricity from the external grid is also the objective of this study. Our proposed scheme schedules smart appliances as well as electrical vehicles (EVs) charging/discharging optimally according to the consumer preferences. Each consumer has its own grid-connected microgrid for electricity generation;which consists of wind turbine, solar panel, micro gas turbine (MGT) and energy storage system (ESS). Furthermore, the scheduling problem is mathematically formulated and solved by mixed integer linear programming (MILP). We also provide the comparison of the optimal solutions, while considering EVs with and without discharging capabilities. Findings from simulations affirm our proposed scheme in terms of above-mentioned objectives.

关键词： Demand side management Home energy management mixed integer linear programming

来源：评论

学校读者我要写书评

暂无评论

A mixed integer linear programming based hydro unit commitment

A mixed integer linear programming based hydro unit commitme...

引用

IEEE Summer Meeting Power Engineering Society

作者： C.W. Chang J.G. Waight National Chung Cheng University Chiayi Taiwan Siemens Power Systems Control Brooklyn Park MN USA

This paper describes the model and techniques developed to solve hydro unit commitment (HUC) problems. The developed HUC program is used to determine the optimal half-hourly schedules for the available hydro units for a user-definable study period while respecting system and hydraulic constraints. The HUC optimization algorithm uses a mixed integer linear programming (MILP) approach with an optimization package to solve the problem. In order to apply the MILP approach, the HUC problem is expressed as a linear problem with integer variables to include the discreteness of the problem. The usefulness of the proposed algorithm is illustrated by testing the developed program with actual hydro system data. Test results and numerical experience show that the proposed solution algorithm is simple and computationally efficient. The proposed algorithm is also suitable for competitive electricity market applications with hydro-dominant power systems.

关键词： mixed integer linear programming Reservoirs integer linear programming Costs Dynamic programming Power systems Processor scheduling Hydraulic turbines Power system control Power system planning

来源：评论

学校读者我要写书评

暂无评论

Optimization of sewer networks using the mixed-integer linear programming

引用

URBAN WATER JOURNAL 2017年第5期14卷 452-459页

作者： Safavi, Hamidreza Geranmehr, Mohammad A. Isfahan Univ Technol Dept Civil Engn Esfahan Iran

This paper introduces a method for optimizing sewer networks using the mixed-integer linear programming (MILP) for a given layout. The objective function is defined as the sum of the costs for pipe purchase, pipe-laying, and manhole construction expressed in linear terms and subject to minimum and maximum allowable slopes, velocities, and relative depths for both minimum and maximum sewage discharge rates in each pipe. Additionally, provisions are made as constraints or conditions to ensure that a minimum pipe cover is required, that pipe diameters do not decrease in the flow direction, and that pipes maintain a steady elevation at each manhole. All the non-linear constraints are transformed into the linear format. Pipe slope, binary variables accounting for commercial pipe diameters and average implemented depths have also been considered as decision variables. Finally, the performance of the proposed optimization method is evaluated in a benchmark sewer network from the literature.

关键词： Sewer networks optimization mixed integer linear programming

来源：评论

学校读者我要写书评

暂无评论

Determining r-Robustness of Digraphs Using mixed integer linear programming

Determining r-Robustness of Digraphs Using Mixed Integer Lin...

引用

American Control Conference

作者： James Usevitch Dimitra Panagou University of Michigan Ann Arbor

ISBN: (纸本)9781538679012;9781538679265

Convergence guarantees of many resilient consensus algorithms are based on the graph theoretic properties of rand (r, s)-robustness. These algorithms guarantee consensus of normally behaving agents in the presence of a bounded number of arbitrarily misbehaving agents if the values of the integers r and s are sufficiently high. However, determining the largest integer r for which an arbitrary digraph is r-robust is highly nontrivial. This paper introduces a novel method for calculating this value using mixed integer linear programming. The method only requires knowledge of the graph Laplacian matrix, and can be formulated with affine objective and constraints, except for the integer constraint. integer programming methods such as branch-and-bound can allow both lower and upper bounds on r to be iteratively tightened. Simulations suggest the proposed method demonstrates greater efficiency than prior algorithms.

关键词： mixed integer linear programming directed graphs integer Agents Upper bound algorithms

来源：评论

学校读者我要写书评

暂无评论

Scheduling of a consumer goods production plant with intermediate buffer by decomposition and mixed-integer linear programming

引用

IFAC-PapersOnLine 2019年第13期52卷 1837-1842页

作者： Yfantis, Vassilios Corominas, Francesc Engell, Sebastian Process Dynamics and Operations Group Department of Biochemical and Chemical Engineering TU Dortmund University Emil-Figge-Str. 70 Dortmund44227 Germany Procter and Gamble Temselaan 100 Strombeek-Bever1853 Belgium

Varying demands and global competition pose significant challenges in the consumer goods industry. Exploiting market opportunities often leads to the need of an extension of the production capacities of manufacturing plants. This can be achieved by adding new plants or adding production units to existing plants which may require very significant investments. Another option is the reconfiguration of an existing plant layout to achieve higher throughputs at relatively low cost. A potential reconfiguration strategy is the decoupling of production stages by buffers which increases the flexibility and is efficient if the bottlenecks of the process vary over time. In this contribution the scheduling of an industrial consumer goods production plant with two production stages with a buffer in between the stages is discussed. This can be used to assess the benefits of the modified layout and for the later online scheduling of the plant with the buffer. The scheduling algorithm is based on decomposition and mathematical programming. The generated schedules are compared to schedules for the current layout. © 2019, IFAC (International Federation of Automatic Control) Hosting by Elsevier Ltd. All rights reserved.

关键词： integer programming Competition Flexible manufacturing systems Investments Plant layout Scheduling Scheduling algorithms Consumer goods production Industrial consumers Intermediate buffers Manufacturing process Market opportunities mixed integer linear programming Optimization problems Reconfiguration

来源：评论

学校读者我要写书评

暂无评论

Planning of Distribution Systems Using mixed-integer linear programming Models Considering Network Reliability

引用

JOURNAL OF CONTROL AUTOMATION AND ELECTRICAL SYSTEMS 2015年第2期26卷 170-179页

作者： de Souza, Joao Rider, Marcos J. Sanches Mantovani, Jose Roberto Univ Fed Mato Grosso Dept Matemat Cuiaba MT Brazil Univ Estadual Paulista Fac Engn Ilha Solteira Dept Engn Eletr Sao Paulo Brazil

In this paper, a two-stage solution methodology for distribution network planning considering reliability indices improvement is proposed. This methodology comprises optimal distribution network expansion and improves network reliability by allocating sectionalizing switches and interconnection circuits (tie line circuits). The optimal expansion problem of radial aerial distribution systems is formulated as a mixed binary linear programming (MILP) problem aiming to reduce the investment and operational costs, subject to physical and operational constraints. The allocation of controlled sectionalizing switches and interconnection circuits is also formulated as a MILP in order to improve the network reliability indices. A pseudo-dynamic planning method is used to solve planning and reliability models through a heuristic technique that first solves the planning model followed by the solution of the reliability model, in each stage of planning horizon. Numerical results are presented for a 54-bus distribution system from literature.

关键词： Distribution systems planning Reliability indices mixed integer linear programming Mathematical models

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：