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

Chinese Control Conference

作者： Na GENG Xiaolan XIE Shanghai Jiao Tong University Ecole Nationale Superieure des Mines de Saint Etienne

ISBN: (纸本)9781467325813

The timely imaging examinations are most important for stroke patients to have the further appropriate diagnosis and treatment. We have proposed a contract-based Magnetic Resonance Imaging (MRI) reservation process in [1] in order to reduce their waiting time for MRI examinations. Contracted time slots (CTS) are especially reserved for stroke patients. Regular time slots (RTS) assignment policy is to assign some "unlucky" patients to RTS by keeping CTS queue length below a certain threshold. We further propose a reservation process in [2] in order to reduce the waiting time of these "unlucky" patients by utilizing the virtual CTS queue. RTS assignment policy is used to reserve additional RTS instead of assigning specific patients directly to RTS. This paper proposes a new reservation process without the virtual CTS queue. All times slots including CTS and RTS are used on FIFO (First In First Out) order. Computational results show that the improved method can greatly reduce the maximal waiting time and the deviation of average waiting time.

关键词： Reservation process Contracted time slots Regular time slots integer programming model Waiting time CTS stroke patient SLOT integer programming models first-in first-out Magnetic Resonance Imaging Room temperature Queue Stroke Patients

来源：评论

学校读者我要写书评

暂无评论

Optimal Incremental Placement of PMUs for Power System Observability

Optimal Incremental Placement of PMUs for Power System Obser...

引用

IEEE Power and Energy Society General Meeting

作者： F. Wang W. Zhang P. Li Department of Electrical and Electronic Engineering The University of Hong Kong Hong Kong. Guangdong Power Dispatch Center of Guangdong Power Grid Co. Guangzhou Guangdong China.

ISBN: (纸本)9781467327275

This paper presents a series of optimization models for Phasor Measurement Unit (PMU) placement with new considerations. Extended from the formulations based on integer linear programming, issues concerning uncertainty propagation are discussed and an improved model is proposed to alleviate the impact. Furthermore, as it is more valuable in practice with incrementally placing PMUs, a multistage installation framework based on dynamic programming is developed. With a novel index introduced, the presented framework is implemented with uncertainty propagation controlled in a certain level for each stage. Unlike other available approaches, when processing the immediate stage in this paper, current and future installations are simultaneously considered rather than just making decisions from fixed PMU locations. Minimum number of PMUs is guaranteed meanwhile with each installation. In addition, a postprocessing optimization for selection from multiple solutions in integer programming models is also presented. The proposed models are tested in IEEE 14-, 30-, 57-and 118-bus systems. With the results analyzed and discussed, it indicates the improved model can limit the uncertainty propagation in a fixed level, and the proposed multistage framework could be employed as a practical strategy for PMU placement planning.

关键词： Optimal placement PMU state estimation uncertainty propagation observability incremental installation Phasor measurement units Uncertainty Propagation integer programming models placement Installations

来源：评论

学校读者我要写书评

暂无评论

Mandi Electronic Exchange: Orchestrating Indian Agricultural Markets for Maximizing Social Welfare

Mandi Electronic Exchange: Orchestrating Indian Agricultural...

引用

IEEE International Conference on Automation Science and Engineering

作者： N. Viswanadham Sridhar Chidananda Y. Narahari Pankaj Dayama Indian Institute of Science

ISBN: (纸本)9781467304290

In this paper, we discuss the prevailing agricultural marketing system in India and identify the problems and inefficiencies. We propose that the government wholesale market called the Mandi should be transformed into an electronic marketplace (exchange) for agricultural produce. An important function of the electronic exchange is to match the supply of the farmers' produce with the demand from the wholesalers and retailers. We present a mixed integer programming model that the electronic exchange needs to solve in an iterative way to optimally match buyers with sellers. We present a stylized case study to illustrate the functioning of such a Mandi exchange. We believe such a Mandi exchange will have a translational impact on agricultural trading, particularly in India.

关键词： electronic exchange Agricultural markets integer programming models Social Welfare buyer

来源：评论

学校读者我要写书评

暂无评论

Dynamic Reconfiguration of Terminal Airspace During Convective Weather

Dynamic Reconfiguration of Terminal Airspace During Convecti...

引用

2010 49th IEEE Conference on Decision and Control

作者： Diana Michalek Hamsa Balakrishnan Operations Research Center at Massachusetts Institute of Technology Cambridge MA USA department of Aeronautics and Astronautics at the Massachusetts Institute of Technology

ISBN: (纸本)9781424477456

Dynamic airspace configuration (DAC) algorithms strive to restructure the U.S. National Airspace System (NAS) in ways that allow air traffic control to better manage aircraft flows. Although past research has largely focused on enroute airspace in clear weather conditions, the principle of better matching airspace structure to ambient conditions has potential to benefit airport terminal areas, which are often impacted by congestion due to convective weather, especially during summer months when travel demand is high. This paper studies the problem of dynamic airspace configuration in the terminal area given a stochastic model of route availability during convective weather conditions. An integer programming model is proposed for the dynamic reconfiguration of the terminal area. This model recommends small changes to airspace structure that alleviate airspace congestion, while limiting disruptions to air traffic control procedures. The model is tested against actual weather scenarios, and shows promising benefits to operations.

关键词： dynamic reconfiguration terminal area integer programming models airspace structure Travel demand Weather Air Traffic Control Stochastic models

来源：评论

学校读者我要写书评

暂无评论

integer programming models for deployment of airport baggage screening security devices

引用

OPTIMIZATION AND ENGINEERING 2005年第3期6卷 339-359页

作者： Jacobson, SH McLay, LA Virta, JL Kobza, JE Univ Illinois Dept Mech & Ind Engn Simulat & Optimizat Lab Urbana IL 61801 USA Texas Tech Univ Dept Ind Engn Lubbock TX 79409 USA

Aviation security is an important problem of national interest and concern. Baggage screening security devices and operations at airports throughout the United States provide an important defense against terrorist actions targeted at commercial aircraft. Determining where to deploy such devices, and how to best use them can be quite challenging. This paper presents NP-complete decision problems concerning the deployment and utilization of baggage screening security devices. These problems incorporate three different deployment performance measures: uncovered baggage segments, uncovered flight segments, and uncovered passenger segments. integer programming models are formulated to address optimization versions of these problems and to identify optimal baggage screening security device deployments (i.e., determine the number and type of baggage screening security devices that should be placed at different airports, and determining which baggage should be screened with such devices). The models are illustrated with an example that incorporates data extracted from the Official Airline Guide (OAG).

关键词： aviation security homeland security NP-completeness integer programming models cost analysis

来源：评论

学校读者我要写书评

暂无评论

integer programming models and algorithms for molecular classification of cancer from microarray data 05

Integer programming models and algorithms for molecular clas...

引用

Australasian Computer Science Conference

作者： Regina Berretta Alexandre Mendes Pablo Moscato University of Newcastle Callaghan NSW Australia

ISBN: (纸本)9781920682200

Novel, high-throughput technologies are challenging the core of algorithmic methods available in Computer Science. Microarray technologies give Life Sciences researchers the opportunity to simultaneously measure thousands of gene expression levels under different conditions or coming from different cell lines. With appropriate data mining models and algorithms, this would lead to a systematic exploration of molecular classification of cancer, just one among many other exciting applications. The aim of this paper is to present a unified mathematical formalization for different feature selection problems and investigate their performance in classification of cancer cell-lines. We also present some results using the NCI60 dataset.

关键词： feature selection Feature extraction integer programming models algorithms Taxonomy Microarray Cell Line

来源：评论

学校读者我要写书评

暂无评论

New integer programming formulations and an exact algorithm for the ordered cutting stock problem

引用

JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY 2008年第11期59卷 1520-1531页

作者： Alves, C. Valerio de Carvalho, J. M. Univ Minho Dept Prod & Sistemas Escola Engn P-471057 Braga Portugal

Apart from trim loss minimization, there are many other issues concerning cutting processes that arise in real production systems. One of these is related to the number of stacks that need to be opened near the cutting machines. Many researchers have worked in the last years on cutting stock problems with additional constraints on the number of open stacks. In this paper, we address a related problem: the Ordered Cutting Stock Problem (OCSP). In this case, a stack is opened for every new client's order, and it is closed only when all the items of that order are cut. The OSCP has been introduced recently in the literature. Our aim is to provide further insight into this problem. This paper describes three new integer programming formulations for solving it, and an exact algorithm based on column generation, branch-and-bound and cutting planes. We report on computational experiments on a set of random instances. The results show that good lower bounds can be computed quickly, and that optimal solutions can be found in a reasonable amount of time.

关键词： cutting stock pattern sequencing integer programming models column generation branch-and-bound cutting planes

来源：评论

学校读者我要写书评

暂无评论

A MULTI-CRITERIA DECISION MAKING FOR THE UNRELATED PARALLEL MACHINES SCHEDULING PROBLEM

引用

38th International Conference on Computers and Industrial Engineering

作者： Chang, Weishung Chyu, Chiuhcheng Yuan Ze Univ Dept Ind Engn & Management Tao Yuan Taiwan

ISBN: (纸本)9787121074370

In this paper, we propose a multi-criteria machine-schedules decision making method that can be applied to a production environment involving several unrelated parallel machines and we will focus on three objectives: minimizing make-span, total flow time, and total number of tardy jobs. The decision making method consists of three phases. In the first phase, a mathematical model of a single machine scheduling problem, of which the objective is a weighted sum of the three objectives, is constructed. Such a model will be repeatedly solved by the CPLEX in the proposed multi-objective simulated annealing (MOSA) algorithm. In the second phase, the MOSA that integrates job clustering method, job group scheduling method, and job group - machine assignment method, is employed to obtain a set of non-dominated group schedules. During this phase, CPLEX software and the bipartite weighted matching algorithm are used repeatedly as parts of the MOSA algorithm. In the final phase, the technique of data envelopment analysis is applied to determine the most preferable schedule. A practical example is then presented in order to demonstrate the applicability of the proposed decision making method

关键词： Multi-objective optimization unrelated parallel machines scheduling simulated annealing algorithm integer programming models multi-criteria decision making

来源：评论

学校读者我要写书评

暂无评论

Scheduling the Italian football league: an ILP-based approach

引用

COMPUTERS & OPERATIONS RESEARCH 2006年第7期33卷 1963-1974页

作者： Della Croce, F Oliveri, D Politecn Turin DAI Turin Italy

Scheduling the Italian Major Football League (the so-called "Serie A") consists in finding for that league a double round robin tournament schedule that takes into account both typical requirements such as conditions on home-away matches and specific requests of the Italian Football Association such as twin-schedules for teams belonging to the same home-town. In this paper, we present a solution procedure able to derive feasible schedules that are also balanced with respect to additional cable televisions requirements. This procedure adapts the recent approach by Nemhauser and Trick to schedule a College Basketball Conference that considers however only half of the teams involved here. The proposed procedure is divided into three phases: phase I generates a pattern set respecting the cable televisions requirements and several other constraints;phase 2 produces a feasible round robin schedule compatible with the above pattern set;finally, phase 3 generates the actual calendar assigning the teams to the patterns. The procedure allows to generate within short time several different reasonable calendars satisfying the cable television companies requirements and satisfying various other operational constraints while minimizing the total number of violations on the home-away matches conditions. (c) 2004 Elsevier Ltd. All rights reserved.

关键词： sports scheduling round robin tournaments integer programming models

来源：评论

学校读者我要写书评

暂无评论

Effective heuristics for multiproduct partial shipment models

引用

OPERATIONS RESEARCH 2006年第2期54卷 337-352页

作者： Dawande, M Gavirneni, S Tayur, S Univ Texas Sch Management Richardson TX 75083 USA Cornell Univ Johnson Grad Sch Management Ithaca NY USA Carnegie Mellon Univ Tepper Sch Business Pittsburgh PA 15213 USA

Motivated by real applications, we consider the problem of shipping products to multiple customers from limited inventory. After formulating the optimization problems under different restrictions on partial shipments, we find that commercially available packages, applied directly, are unsatisfactory, as are simple greedy approaches. We develop a scheme of heuristics that enables the user to select a good balance between computation time and effectiveness. A detailed computational study of one- and two-period industrial-sized problems indicates that these heuristics are computationally practical and generate solutions that are, on average, within 3%-4% of the optimum.

关键词： partial shipments integer programming models heuristics

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：