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

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

来源：评论

学校读者我要写书评

暂无评论

Capacity planning for batch and perfusion bioprocesses across multiple biopharmaceutical facilities

引用

BIOTECHNOLOGY PROGRESS 2014年第3期30卷 594-606页

作者： Siganporia, Cyrus C. Ghosh, Soumitra Daszkowski, Thomas Papageorgiou, Lazaros G. Farid, Suzanne S. UCL Dept Biochem Engn London WC1E 7JE England Bayer Healthcare Biotechnol Controlling Berkeley CA USA Bayer AG Proc Dev & Optimisat Leverkusen Germany UCL Ctr Proc Syst Engn Dept Chem Engn London WC1E 7JE England

Production planning for biopharmaceutical portfolios becomes more complex when products switch between fed-batch and continuous perfusion culture processes. This article describes the development of a discrete-time mixed integer linear programming (MILP) model to optimize capacity plans for multiple biopharmaceutical products, with either batch or perfusion bioprocesses, across multiple facilities to meet quarterly demands. The model comprised specific features to account for products with fed-batch or perfusion culture processes such as sequence-dependent changeover times, continuous culture constraints, and decoupled upstream and downstream operations that permit independent scheduling of each. Strategic inventory levels were accounted for by applying cost penalties when they were not met. A rolling time horizon methodology was utilized in conjunction with the MILP model and was shown to obtain solutions with greater optimality in less computational time than the full-scale model. The model was applied to an industrial case study to illustrate how the framework aids decisions regarding outsourcing capacity to third party manufacturers or building new facilities. The impact of variations on key parameters such as demand or titres on the optimal production plans and costs was captured. The analysis identified the critical ratio of in-house to contract manufacturing organization (CMO) manufacturing costs that led the optimization results to favor building a future facility over using a CMO. The tool predicted that if titres were higher than expected then the optimal solution would allocate more production to in-house facilities, where manufacturing costs were lower. Utilization graphs indicated when capacity expansion should be considered. (c) 2013 The Authors Biotechnology Progress published by Wiley Periodicals, Inc. on behalf of American Institute of Chemical Engineers Biotechnol. Prog., 30:594-606, 2014

关键词： capacity planning scheduling business decision-making mixed integer linear programming rolling time horizon

来源：评论

学校读者我要写书评

暂无评论

Composite generation and transmission expansion planning considering distributed generation

引用

INTERNATIONAL JOURNAL OF ELECTRICAL POWER & ENERGY SYSTEMS 2014年 62卷 792-805页

作者： Rouhani, Ahmad Hosseini, Seyyed Hadi Raoofat, Mahdi Islamic Azad Univ Beyza Branch Young Researchers & Elite Club Beyza Iran Zanjan Univ Dept Elect Engn Zanjan Iran Shiraz Univ Sch Elect & Comp Engn Dept Power & Control Engn Shiraz Iran

This paper presents a model for use in the problem of composite generation and transmission expansion planning considering distributed generation. Generation expansion planning is defined as the problem of determining what capacity, which, and when new generating units should be constructed over a long range planning horizon, to satisfy the expected energy demand using single nodal generation planning model. Then, the place of every planned generating units and distributed generation is determined simultaneous with transmission expansion planning considering nonuniform geographical fuel supply cost and potential of distributed generation technology. The problem is formulated as a mixed-integer linear programming. By allocating the overall generation capacity among the grid nodes and determining the new transmission element additions along the planning horizon, the overall cost of the system is minimized. To assess the capabilities of the proposed approach, the Iranian Power Grid as a large scale system is considered. The effectiveness of the proposed modifications is illustrated in detail. (C) 2014 Elsevier Ltd. All rights reserved.

关键词： Composite expansion planning Distributed generation Generation expansion planning mixed integer linear programming Transmission expansion planning

来源：评论

学校读者我要写书评

暂无评论

The train platforming problem: The infrastructure management company perspective

引用

TRANSPORTATION RESEARCH PART B-METHODOLOGICAL 2014年 61卷 55-72页

作者： Sels, P. Vansteenwegen, P. Dewilde, T. Cattrysse, D. Waquet, B. Joubert, A. Katholieke Univ Leuven Ctr Ind Management Traff & Infrastruct B-3001 Heverlee Belgium Log Yours BVBA B-2100 Antwerp Belgium Infrabel Dept Rail Access B-1070 Brussels Belgium ICTRA B-1070 Brussels Belgium

If railway companies ask for station capacity numbers, their underlying question is in fact one about the platformability of extra trains. Train platformability depends not only on the infrastructure, buffer times, and the desired departure and arrival times of the trains, but also on route durations, which depend on train speeds and lengths, as well as on conflicts between routes at any given time. We consider all these factors in this paper. We assume a current train set and a future one, where the second is based on the expected traffic increase through the station considered. The platforming problem is about assigning a platform to each train, together with suitable in-and out-routes. Route choices lead to different route durations and imply different in-route-begin and out-route-end times. Our module platforms the maximum possible weighted sum of trains in the current and future train set. The resulting number of trains can be seen as the realistic capacity consumption of the schedule. Our goal function allows for current trains to be preferably allocated to their current platforms. Our module is able to deal with real stations and train sets in a few seconds and has been fully integrated by Infrabel, the Belgian Infrastructure Management Company, in their application called Ocapi, which is now used to platform existing and projected train sets and to determine the capacity consumption. (C) 2014 Elsevier Ltd. All rights reserved.

关键词： Train platforming problem mixed integer linear programming Train station capacity

来源：评论

学校读者我要写书评

暂无评论

Minimal counterexamples for linear-time probabilistic verification

引用

THEORETICAL COMPUTER SCIENCE 2014年第C期549卷 61-100页

作者： Wimmer, Ralf Jansen, Nils Abraham, Erika Katoen, Joost-Pieter Becker, Bernd Univ Freiburg Chair Comp Architecture D-79110 Freiburg Germany Rhein Westfal TH Aachen Chairfor Software Modeling & Verificat Aachen Germany Rhein Westfal TH Aachen Aachen Germany

Counterexamples for property violations have a number of important applications like supporting the debugging of erroneous systems and verifying large systems via counterexample-guided abstraction refinement. In this paper, we propose the usage of minimal critical subsystems of discrete-time Markov chains and Markov decision processes as counterexamples for violated omega-regular properties. Minimality can thereby be defined in terms of the number of states or transitions. This problem is known to be NP-complete for Markov decision processes. We show how to compute such subsystems using mixed integer linear programming and evaluate the practical applicability in a number of experiments. They show that our method yields substantially smaller counterexample than using existing techniques. (C) 2014 Elsevier B.V. All rights reserved.

关键词： Markov chain Markov decision process Counterexample omega-Regular property mixed integer linear programming SAT-modulo-theories

来源：评论

学校读者我要写书评

暂无评论

Models and strategies for efficiently determining an optimal vertical alignment of roads

引用

COMPUTERS & OPERATIONS RESEARCH 2014年 44卷 161-173页

作者： Hare, Warren Hossain, Shahadat Lucet, Yves Rahman, Faisal Univ British Columbia Kelowna BC Canada Softree Tech Syst Inc Vancouver BC Canada

Selecting an optimal vertical alignment while satisfying safety and design constraints is an important task during road construction. The amount of earthwork operations depends on the design of the vertical alignment, so a good vertical alignment can have a profound impact on final construction costs. In this research, we improve the performance of a previous mixed-integer linear programming model, and we propose a new quasi-network flow model. Both models use a piecewise quadratic curve to compute the minimum cost vertical alignment and take earthwork operations into account. The models consider several features such as side-slopes, and physical blocks in the terrain. In addition to improving the precision, we propose several techniques that speed up the search for a solution, so that it is possible to make interactive design tools. We report numerical tests that validate the accuracy of the models, and reduce the calculation time. (C) 2013 Elsevier Ltd. All rights reserved.

关键词： Road design Highway alignment optimization Vertical alignment mixed integer linear programming

来源：评论

学校读者我要写书评

暂无评论

Effective Real-Time Unmanned Air Vehicle Path Planning in Presence of Threat Netting

引用

JOURNAL OF AEROSPACE INFORMATION SYSTEMS 2014年第4期11卷 170-177页

作者： Fu Xiaowei Gao Xiaoguang Northwestern Polytech Univ Xian 710072 Shaanxi Peoples R China

A method of real-time path planning for unmanned air vehicles in a radar-guided surface-to-air missile (SAM) netting environment was proposed. First, a simplified threat netting model is established based on the probability of an UAV being detected by threats;then, the model of threat netting is integrated with models of SAMs. The first step in the path planning algorithm based on MPC is to construct a UAV state-space model. In the threat netting situation, a SAM may receive target information from other SAMs via a communication network. The completeness of transmitted information depends on the connective probability of the communication network, which depends on the network topology and capacity. The path planning problem is formulated as a model predictive control problem. Simulation results and the present analysis indicate that the presented threat netting model and path planning algorithm can compensate for the increase in the lethality of a particular threat.

关键词： Real Time Path Planning Flight Vehicle Radar Cross Sections Surface to Air Missile Precision Guided Munition Bank Angle Aircraft Dynamics mixed integer linear programming Combat Air Vehicle Optimal Control

来源：评论

学校读者我要写书评

暂无评论

Use of model predictive control for experimental microgrid optimization

引用

APPLIED ENERGY 2014年 115卷 37-46页

作者： Parisio, Alessandra Rikos, Evangelos Tzamalis, George Glielmo, Luigi KTH Royal Inst Technol ACCESS Linnaeus Ctr Stockholm Sweden KTH Royal Inst Technol Sch Elect Engn Automat Control Lab Stockholm Sweden Ctr Renewable Energy Sources & Saving CRES Dept PVs & DERs Syst Athens Greece Ctr Renewable Energy Sources & Saving CRES Dept RES & Hydrogen Technol Athens Greece Univ Sannio Dept Engn Benevento Italy

In this paper we deal with the problem of efficiently optimizing microgrid operations while satisfying a time-varying request and operation constraints. Microgrids are subsystems of the distribution grid comprising sufficient generating resources to operate in isolation from the main grid, in a deliberate and controlled way. The Model Predictive Control (MPC) approach is applied for achieving economic efficiency in microgrid operation management. The method is thus applied to an experimental microgrid located in Athens, Greece: experimental results show the feasibility and the effectiveness of the proposed approach. (C) 2013 Elsevier Ltd. All rights reserved.

关键词： Model predictive control Microgrids Optimization mixed integer linear programming

来源：评论

学校读者我要写书评

暂无评论

A Lagrangian heuristic for sprint planning in agile software development

引用

COMPUTERS & OPERATIONS RESEARCH 2014年第1期43卷 116-128页

作者： Boschetti, Marco A. Golfarelli, Matteo Rizzi, Stefano Turricchia, Elisa Univ Bologna Dept Math I-47521 Cesena Italy Univ Bologna DISI I-40126 Bologna Italy

Agile methods for software development promote iterative design and implementation. Most of them divide a project into functionalities, called user stories;at each iteration, often called a sprint, a subset of user stories are developed. The sprint planning phase is critical to ensure the project success, but it is also a difficult problem because several factors impact on the optimality of a sprint plan, e.g., the estimated complexity, business value, and affinity of the user stories to be included in each sprint. In this paper we present an approach for sprint planning based on an integer linear programming model. Given the estimates made by the project team and a set of development constraints, the optimal solution of the model is a sprint plan that maximizes the business value perceived by users. Solving to optimality the model by a general-purpose MIP solver, such as IBM llog Cplex, takes time and for some instances even finding a feasible solution requires too large computing times for an operational use. For this reason we propose an effective Lagrangian heuristic based on a relaxation of the proposed model and some greedy and exchange algorithms. Computational results on both real and synthetic projects show the effectiveness of the proposed approach. (C) 2013 Elsevier Ltd. All rights reserved.

关键词： mixed integer linear programming Software engineering Agile methods Optimization models Matheuristics Lagrangian heuristics

来源：评论

学校读者我要写书评

暂无评论

Scheduling job families on non-identical parallel machines with time constraints

引用

ANNALS OF OPERATIONS RESEARCH 2014年第1期213卷 221-234页

作者： Obeid, Ali Dauzere-Peres, Stephane Yugma, Claude Ecole Mines St Etienne Ctr Microelect Provence F-13541 Gardanne France

This paper studies the scheduling of lots (jobs) of different product types (job family) on parallel machines, where not all machines are able to process all job families (non-identical machines). A special time constraint, associated to each job family, should be satisfied for a machine to remain qualified for processing a job family. This constraint imposes that the time between the executions of two consecutive jobs of the same family on a qualified machine must not exceed the time threshold of the family. Otherwise, the machine becomes disqualified. This problem comes from semiconductor manufacturing, when Advanced Process Control constraints are considered in scheduling problems. To solve this problem, two mixed integer linear programming models are proposed that use different types of variables. Numerical experiments show that the second model is much more effective, and that there is a trade-off between optimizing the scheduling objective and maximizing the number of machines that remain qualified for the job families. Two heuristics are also presented and studied in the numerical experiments.

关键词： Scheduling Parallel machines Time constraint mixed integer linear programming Heuristics Semiconductor manufacturing

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：