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

A maximum expected covering problem for locating and dispatching two classes of military medical evacuation air assets

引用

OPTIMIZATION LETTERS 2015年第8期9卷 1511-1531页

作者： Grannan, Benjamin C. Bastian, Nathaniel D. McLay, Laura A. Virginia Mil Inst Dept Econ & Business Lexington VA 24450 USA Penn State Univ Dept Ind & Mfg Engn State Coll PA 16802 USA Univ Wisconsin Dept Ind & Syst Engn Madison WI 53706 USA

Military medical evacuation (MEDEVAC) systems respond to casualty incidents and transport the most urgent casualties to a medical treatment facility via multiple types of air ambulance assets. Military MEDEVAC systems are subject to an uncertain number of service calls and each service call demands different system operations depending on type and the priority level. Therefore, military medical planners need an air MEDEVAC asset management system that determines how to dispatch multiple types of air assets to prioritized service calls to maintain a high likelihood of survival of the most urgent casualties. To reach this goal, we propose a novel binary linear programming (BLP) model to optimally locate two types of air assets and construct response districts using a dispatch preference list. Additionally, the BLP model balances the workload among assets and enforces contiguity in the first assigned locations for each air asset. The objective of the BLP model is to maximize the proportion of high-priority casualties responded to within a pre-specified time threshold while meeting performance benchmarks to other types of casualties. A spatial queuing approximation model is derived to provide inputs to the BLP model, which thus reflects the underlying queuing dynamics of the system. We illustrate the model and algorithms with a computational example that reflects realistic military data.

关键词： Air MEDEVAC asset management Casualty triage Spatial queuing binary linear programming Military medicine

来源：评论

学校读者我要写书评

暂无评论

Cost minimization for deadline-constrained bag-of-tasks applications in federated hybrid clouds

引用

FUTURE GENERATION COMPUTER SYSTEMS-THE INTERNATIONAL JOURNAL OF ESCIENCE 2017年 71卷 113-128页

作者： Abdi, Somayeh PourKarimi, Latif Ahmadi, Mahmood Zargari, Farzad Islamic Azad Univ Dept Comp Engn Sci & Res Branch Tehran Iran Razi Univ Dept Math Kermanshah Iran Razi Univ Comp Engn & Informat Technol Dept Kermanshah Iran Iran Telecom Res Ctr Informat Technol Fac Tehran Iran

A mathematical programming model is proposed for a resource allocation problem in federated clouds, where bag-of-tasks (BoT) applications are assigned to instance types with different costs and performance levels. The proposed model is a binary linear programming problem containing deadline and resource constraints in the cloud federations and by the objective of minimizing the total cost of applications. These constraints and objective are explicitly expressed using mathematical functions, and the model is solved with the CPLEX solver. This paper also discusses a post-optimality analysis that deals with stability in assignment problems. Numerical results show that the optimal cost and optimal solutions in the cloud federations are lower and more stable, respectively, than those presented by single-provider clouds. In contrast to optimality in single-provider clouds, that in the cloud federations is less sensitive to input data. (C) 2017 Published by Elsevier B.V.

关键词： Federated hybrid clouds Scheduling Bag-of-tasks applications binary linear programming Cost minimization Deadline constrained

来源：评论

学校读者我要写书评

暂无评论

Image super resolution via combination of two dimensional quaternion valued singular spectrum analysis based denoising, empirical mode decomposition based denoising and discrete cosine transform based denoising methods

引用

MULTIMEDIA TOOLS AND APPLICATIONS 2023年第15期82卷 22705-22722页

作者： Cheng, Yingdan Ling, Bingo Wing-Kuen Lin, Yuxin Huang, Ziyin Chan, Yui-Lam Guangdong Univ Technol Fac Informat Engn Guangzhou 510006 Peoples R China Hong Kong Polytech Univ Dept Elect & Informat Engn Hung Hom Hong Kong Peoples R China

This paper formulates the image super resolution problem as various denoising problems. In particular, the discrete cosine transform zero padding approach is used to generate an initial high resolution image. Then, three different time frequency analysis based denoising methods are applied iteratively to improve the quality of the super resolution image. In particular, the two dimensional quaternion valued singular spectrum analysis (2DQSSA) based denoising method, the empirical mode decomposition (EMD) based denoising method and the discrete cosine transform based denoised method are applied. For the 2DQSSA based denoising method, the luminance plane is used as the real part of the quaternion valued image. Since different color planes in the quaternion valued image are fused together via the quaternion valued operation, some high frequency information missing in one color plane can be generated using those in other color planes. On the other hand, for the EMD based denoising method, the selection of the intrinsic mode functions (IMFs) is formulated as a binary linear programming problem. Here, the high frequency components generated by the aliasing are removed by discarding some IMFs. The computer numerical simulation results show that our proposed method can achieve the super resolution performance better than those without performing any one of the above three time frequency analysis based denoising.

关键词： Super resolution image Two dimensional quaternion valued singular spectrum analysis Empirical mode decomposition Discrete cosine transform binary linear programming

来源：评论

学校读者我要写书评

暂无评论

Placement of SDN controllers based on network setup cost and latency of control packets

引用

COMPUTER COMMUNICATIONS 2023年 208卷 15-28页

作者： Naseri, Abdullah Ahmadi, Mahmood PourKarimi, Latif Razi Univ Comp Engn & Informat Technol Dept Kermanshah Iran Razi Univ Dept Math Kermanshah Iran

Software-defined networking (SDN) was developed to simplify the management of computer networks. In the SDN architecture, the control layer is completely decoupled from the data layer. Moreover, network software configuration is also possible. To setup an SDN, you need a device called controller, which is not available in traditional networks. In the control layer, there are several controllers that control the data layer switches. The type, number and place of these controllers directly affect the cost and average latency of control packets. Since achieving the lowest setup cost and the minimum latency of the control packets (between switches and controllers, and among controllers) is of great importance at the same time, in this paper, a binary linear programming model is proposed to achieve the trade-off between them in wide area networks(WAN). The model determines the type, place and minimum number of required controllers by receiving the place of the switches, the amount of processing capacity of the controllers and the setup cost of each controller. Accordingly, it reduces the setup cost, average latency between switches and controllers as well as average latency among controllers in comparison with previous methods. The results of the study show that the model has the lowest setup cost and the minimum average latency of control packets (switch-to-controller and controller-to-controller) in controllers placement compared to the previous methods.

关键词： SDN-WAN SDN controller Controller placement problem Latency binary linear programming

来源：评论

学校读者我要写书评

暂无评论

A New Method on Inshore Ship Detection in High-Resolution Satellite Images Using Shape and Context Information

引用

IEEE GEOSCIENCE AND REMOTE SENSING LETTERS 2014年第3期11卷 617-621页

作者： Liu, Ge Zhang, Yasen Zheng, Xinwei Sun, Xian Fu, Kun Wang, Hongqi Chinese Acad Sci Inst Elect Key Lab Technol Geospatial Informat Proc & Applic Beijing 100190 Peoples R China

In this letter, we present a new method to detect inshore ships using shape and context information. We first propose a new energy function based on an active contour model to segment water and land and minimize it with an iterative global optimization method. The proposed energy performs well on the different intensity distributions between water and land and produces a result that can be well used in shape and context analyses. In the segmented image, ships are detected with successive shape analysis, including shape analysis in the localization of ship head and region growing in computing the width and length of ship. Finally, to locate ships accurately and remove the false alarms, we unify them with a binary linear programming problem by utilizing the context information. Experiments on QuickBird images show the robustness and precision of our method.

关键词： Active contour model binary linear programming context information inshore ship detection shape analysis

来源：评论

学校读者我要写书评

暂无评论

DCA based algorithms for multiple sequence alignment (MSA)

引用

CENTRAL EUROPEAN JOURNAL OF OPERATIONS RESEARCH 2014年第3期22卷 501-524页

作者： Hoai An Le Thi Tao Pham Dinh Belghiti, Moulay Univ Lorraine Lab Theoret & Appl Comp Sci UFR MIM F-57045 Metz France Natl Inst Appl Sci Rouen Math Lab F-76801 St Etienne France

In the last years many techniques in bioinformatics have been developed for the central and complex problem of optimally aligning biological sequences. In this paper we propose a new optimization approach based on DC (Difference of Convex functions) programming and DC Algorithm (DCA) for the multiple sequence alignment in its equivalent binary linear program, called "Maximum Weight Trace" problem. This problem is beforehand recast as a polyhedral DC program with the help of exact penalty techniques in DC programming. Our customized DCA, requiring solution of a few linear programs, is original because it converges after finitely many iterations to a binary solution while it works in a continuous domain. To scale-up large-scale (MSA), a constraint generation technique is introduced in DCA. Preliminary computational experiments on benchmark data show the efficiency of the proposed algorithm DCAMSA, which generally outperforms some standard algorithms.

关键词： Multiple sequence alignment Maximum weight trace Exact penalty binary linear programming DC programming DCA Constraint generation

来源：评论

学校读者我要写书评

暂无评论

A new model for the integrated vehicle-crew-rostering problem and a computational study on rosters

引用

JOURNAL OF SCHEDULING 2011年第4期14卷 319-334页

作者： Mesquita, Marta Moz, Margarida Paias, Ana Paixao, Jose Pato, Margarida Respicio, Ana Univ Tecn Lisboa Dept Matemat Inst Super Agron P-1349017 Lisbon Portugal Univ Tecn Lisboa Dept Matemat Inst Super Econ & Gestao P-1200781 Lisbon Portugal Univ Lisbon Fac Ciencias DEIO P-1749016 Lisbon Portugal Univ Lisbon Fac Ciencias DI P-1749016 Lisbon Portugal Ctr Invest Operac FCUL Lisbon Portugal

Operational planning within public transit companies has been extensively tackled but still remains a challenging area for operations research models and techniques. This phase of the planning process comprises vehicle-scheduling, crew-scheduling and rostering problems. In this paper, a new integer mathematical formulation to describe the integrated vehicle-crew-rostering problem is presented. The method proposed to obtain feasible solutions for this binary non-linear multi-objective optimization problem is a sequential algorithm considered within a preemptive goal programming framework that gives a higher priority to the integrated vehicle-crew-scheduling goal and a lower priority to the driver rostering goals. A heuristic approach is developed where the decision maker can choose from different vehicle-crew schedules and rosters, while respecting as much as possible management's interests and drivers' preferences. An application to real data of a Portuguese bus company shows the influence of vehicle-crew-scheduling optimization on rostering solutions.

关键词： binary linear programming Vehicle scheduling Crew scheduling Driver rostering Multi-objective problems

来源：评论

学校读者我要写书评

暂无评论

Solving the problem of rerostering nurse schedules with hard constraints: New multicommodity flow models

引用

ANNALS OF OPERATIONS RESEARCH 2004年第1-4期128卷 179-197页

作者： Moz, M Pato, MV Univ Tecn Lisboa Inst Econ & Business Adm Dept Math P-1200781 Lisbon Portugal Univ Lisbon Fac Sci Ctr Operat Res P-1699 Lisbon Portugal

The problem of rerostering nurse schedules arises in hospitals when at least one nurse informs that she will be unable to perform the shifts assigned to her on one or more future work days. As a result, the current roster must be rebuilt in accordance with labour contract rules and institutional requirements. All such restraints are regarded as hard constraints. However, major alterations in the previously assigned nurse schedules must be avoided. This paper is based on a case study of a public hospital in Portugal. It presents two new integer multicommodity flow formulations for the rerostering problem, besides a computational experiment performed using real data. The first model is based on a directed multilevel acyclic network. The aggregation of nodes in this network led to the second model. The results obtained show that the second integer multicommodity flow formulation outperforms the first, both in terms of solution quality, as well as in computational time.

关键词： nurse scheduling rerostering integer multicommodity flow problems binary linear programming

来源：评论

学校读者我要写书评

暂无评论

A Cautionary Note on the Use of Benefit Metrics for Cost-Effective Conservation

引用

ENVIRONMENTAL & RESOURCE ECONOMICS 2018年第4期71卷 985-999页

作者： Fooks, Jacob R. Messer, Kent D. Kecinski, Maik Econ Res Serv Conservat & Environm Branch USDA 1400 Independence AveSW Mail Stop 1800 Washington DC 20250 USA Univ Delaware Dept Appl Econ & Stat Newark DE USA Univ Alberta Resource Econ & Environm Sociol Edmonton AB Canada

Cost-effective land conservation techniques, such as optimization, have the potential to contribute substantially to the provision of many important environmental benefits, such as biodiversity protection, flood control, food security, water quality, and reduction of greenhouse gas emissions. There has been a recent push for conservation organizations to adopt project selection optimization approaches such as binary linear programming. The metrics used to measure the benefits of a project however, are often poorly defined in that they do not directly compute a value. These scores represent normalized measurements of underlying values that are likely log-normally distributed. Applying such metrics in optimization will tend to undervalue high-benefit projects and select a suboptimal portfolio of projects relative to simpler approaches. This suboptimal performance can lead to losses in efficiency as high as 30%. We propose a hybrid optimization heuristic that can improve performance and, additionally, provide conservation professionals with more flexibility and freedom to select conservation projects at their discretionpotentially overcoming a substantial real-world adaptation hurdle.

关键词： Conservation optimization binary linear programming Environmental index

来源：评论

学校读者我要写书评

暂无评论

A model and two heuristic approaches for a forage harvester planning problem: a case study

引用

TOP 2010年第1期18卷 122-139页

作者： Carpente, Luisa Casas-Mendez, Balbina Jacome, Cristina Puerto, Justo Univ A Coruna Fac Informat Dept Matemat La Coruna 15071 Spain Univ Santiago de Compostela Dept Estadist & Invest Operat Fac Matemat Santiago De Compostela 15782 Spain Poligono Ind Tambre Oesia Tecnol Santiago De Compostela 15890 Spain Univ Seville Dept Estadist & IO Fac Matemat E-41012 Seville Spain

This work considers a decision problem about orders of owners and routes of smallholdings for a harvester in an agricultural cooperative in which each owner has a proposal about the instant time in which he would like that the machine starts the activity in his land and the different smallholdings of each owner should be processed as a block. A binary linear programming model is introduced in order to reducing costs. Solving the model for actual size instances is computationally burdensome. Hence, we introduce and implement two heuristic algorithms to reduce the computational time. The heuristics are applied to the real case of the cooperative "Os Irmandios" with a large number of owners and smallholdings. The numerical results show that the heuristics can solve large instances effectively with reasonable computational effort.

关键词： Agriculture binary linear programming Heuristic algorithms Local search Tabu search

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：