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

Multi Criteria Decision Making for the Multi-Satellite Image Acquisition Scheduling Problem

SENSORS 2020年第5期20卷 1242-1242页

作者： Vasegaard, Alex Elkjaer Picard, Mathieu Hennart, Florent Nielsen, Peter Saha, Subrata Aalborg Univ Dept Mat & Prod DK-9220 Aalborg Denmark Airbus Def & Space F-31555 Toulouse France

The multi-satellite image acquisition scheduling problem is traditionally seen as a complex optimization problem containing a generic objective function that represents the priority structure of the satellite operator. However, the majority of literature neglect the collective and contemporary effect of factors associated with the operational goal in the objective function, i.e., uncertainty in cloud cover, customer priority, image quality criteria, etc. Consequently, the focus of the article is to integrate a real-time scoring approach of imaging attempts that considers these aspects. This is accomplished in a multi-satellite planning environment, through the utilization of the multi-criteria decision making (MCDM) models, Elimination and Choice Expressing Reality (ELECTRE-III) and the Technique for Order of Preference by Similarity to Ideal Solution (TOPSIS), and the formulation of a binary linear programming model. The two scoring approaches belong to different model classes of MCDM, respectively an outranking approach and a distance to ideal point approach, and they are compared with a naive approach. Numerical experiments are conducted to validate the models and illustrate the importance of criteria neglected in previous studies. The results demonstrate the customized behaviour allowed by MCDM methods, especially the ELECTRE-III approach.

关键词： earth observing satellite satellite image acquisition scheduling problem image collection multiple-criteria decision making ELECTRE-III TOPSIS binary linear programming

来源：评论

学校读者我要写书评

暂无评论

Estimating in situ conservation costs of Zambian crop wild relatives under alternative conservation goals

引用

LAND USE POLICY 2019年 81卷 632-643页

作者： Wainwright, Warwick Drucker, Adam G. Maxted, Nigel Brehm, Joana Magos Ng'uni, Dickson Moran, Dominic Univ Edinburgh Sch Geosci Grant Inst Kings BldgWest Mains Rd Edinburgh EH9 3JW Midlothian Scotland SRUC Land Econ Environm & Soc Grp Kings BldgWest Mains Rd Edinburgh EH9 3JW Midlothian Scotland Biovers Int Via Tre Denari 472-A I-00057 Rome Italy Univ Birmingham Sch Biosci Birmingham B15 2TT W Midlands England Zambian Agr Res Inst Mt Makulu Cent Res Stn Chilanga Zambia Univ Edinburgh Global Acad Agr & Food Secur Easter Bush Campus Edinburgh EH25 9RG Midlothian Scotland

Crop wild relatives (CWR) are a globally threatened group of plants, harbouring valuable genes that are sometimes used to enhance commercial crop varieties and landraces. A lack of recognition in national planning for biodiversity conservation has resulted in inadequate CWR conservation strategies, particularly in situ. There is little information on in situ conservation costs, and this paper uses a payment for agrobiodiversity conservation services (PACS) approach to estimate the in situ costs of conserving CWR in Zambia, where 30 CWR have been prioritised for conservation (of which nine are present in our sample). Competitive tender bid offers were elicited from farmers willing to accept compensation for providing a CWR conservation service. Using data from 26 communities we determined the on-farm cost of conserving CWR, specifically in field margins/borders. Heterogeneity was evident in farmer bid offers, suggesting discriminatory price mechanisms can potentially deliver cost savings over uniform payment rules. Selection of bid offers under four different conservation goals using a binary linear programming (BLP) model reveals conservation costs ranging from US$ 23 to 91/ha per year. An untargeted area goal provided a least-cost procurement of conservation services ($ 2.3 k per year), followed by a targeted area goal ($ 5.9 k per year). The cost of selecting conservation sites increased when other constraints were added to the BLP model, including those concerning social equity ($ 6.4 k per year), and diversity ($ 9.2 k per year) goals. Overall, the findings suggest the use of competitive tenders, coupled with CWR data and BLP modelling, can potentially add much to improve the efficiency of in situ CWR conservation.

关键词： Crop wild relatives Zambia Competitive tender binary linear programming Payments for ecosystem services Social equity Payments for agrobiodiversity conservation services

来源：评论

学校读者我要写书评

暂无评论

Staff assignment with lexicographically ordered acceptance levels

引用

JOURNAL OF SCHEDULING 2018年第2期21卷 167-189页

作者： Rihm, Tom Baumann, Philipp Univ Bern Dept Business Adm Schutzenmattstr 14 CH-3012 Bern Switzerland

Staff assignment is a compelling exercise that affects most companies and organizations in the service industries. Here, we introduce a new real-world staff assignment problem that was reported to us by a Swiss provider of commercial employee scheduling software. The problem consists of assigning employees to work shifts subject to a large variety of critical and noncritical requests, including employees' personal preferences. Each request has a target value, and deviations from the target value are associated with integer acceptance levels. These acceptance levels reflect the relative severity of possible deviations, e.g., for the request of an employee to have at least two weekends off, having one weekend off is preferable to having no weekend off and thus receives a higher acceptance level. The objective is to minimize the total number of deviations in lexicographical order of the acceptance levels. Staff assignment approaches from the literature are not applicable to this problem. We provide a binary linear programming formulation and propose a matheuristic for large-scale instances. The matheuristic employs effective strategies to determine the subproblems and focuses on finding good feasible solutions to the subproblems rather than proving their optimality. Our computational analysis based on real-world data shows that the matheuristic scales well and outperforms commercial employee scheduling software.

关键词： Employee scheduling Staff assignment Real-world problem Goal programming binary linear programming Matheuristic

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Green Design of Wireless Local Area Networks by Multiband Robust Optimization

引用

Electronic Notes in Discrete Mathematics 2018年 64卷 225-234页

作者： Garroppo, Rosario Giuseppe Scutellà, Maria Grazia Sorbonne Universités Université de Technologie de Compiègne CNRS Heudiasyc UMR 7253 CS 60203 Compiègne 60319 France Dipartimento di Ingegneria dell'Informazione Università di Pisa Via G. Caruso 16 Pisa 56122 Italy Dipartimento di Informatica Università di Pisa Largo B. Pontecorvo 3 Pisa 56127 Italy

We consider the problem of designing a wireless local area network according to a green paradigm, i.e. serving users with a telecommunication service while minimizing power consumption. To protect against fluctuations in data rate transmission that naturally affect the problem, because of unpredictable user mobility and wireless propagation conditions, we propose a new Multiband Robust Optimization model, and assess its performance on realistic network instances. The preliminary computational experience confirms the effectiveness of the new model in terms of power savings and resiliency against large variations of mobile user positions. © 2018 Elsevier B.V.

关键词： binary linear programming Robust Optimization User Mobility Uncertainty Wireless Network Design

来源：评论

学校读者我要写书评

暂无评论

Drug Effect Prediction by Integrating L1000 Genomic and Proteomic Big Data

Drug Effect Prediction by Integrating L1000 Genomic and Prot...

引用

作者： Wei Chen Xiaobo Zhou

The library of integrated Network-Based Cellular Signatures (LINCS) project aims to create a network-based understanding of biology by cataloging changes in gene expression and signal transduction. Gene expression and proteomic data in LINCS L1000 are cataloged for human cancer cells treated with compounds and genetic reagents. For understanding the related cell pathways and facilitating drug discovery, we developed binary linear programming (BLP) to infer cell-specific pathways and identify compounds’ effects using L1000 gene expression and phosphoproteomics data. A generic pathway map for the MCF7 breast cancer cell line was built. Within them, BLP extracted the cell-specific pathways, which reliably predicted the compounds’ effects. In this way, the potential drug effects are revealed by our models. less

关键词： MATLAB PC-3 PC-3 [Human Lung Carcinoma] LINCS L1000 binary linear programming Drug effect Cell-specific pathway

来源：评论

学校读者我要写书评

暂无评论

On the energy cost of robustness for green virtual network function placement in 5G virtualized infrastructures

引用

COMPUTER NETWORKS 2017年 125卷 64-75页

作者： Marotta, Antonio D'Andreagiovanni, Fabio Kassler, Andreas Zola, Enrica Karlstad Univ Univ Gatan 2 S-65188 Karlstad Sweden Sorbonne Univ Univ Technol Compiegne CNRS Heudiasyc UMR 7253 CS 60319 F-60203 Compiegne France Univ Politecn Cataluna C Jordi Girona 1-3 ES-08034 Barcelona Spain

Next generation 5G networks will rely on virtualized Data Centers (vDC) to host virtualized network functions on commodity servers. Such Network Function Virtualization (NFV) will lead to significant savings in terms of infrastructure cost and reduced management complexity. However, green strategies for networking and computing inside data centers, such as server consolidation or energy aware routing, should not negatively impact the quality and service level agreements expected from network operators. In this paper, we study how robust strategies that place virtual network functions (VNF) inside vDC impact the energy savings and the protection level against resource demand uncertainty. We propose novel optimization models that allow the minimization of the energy of the computing and network infrastructure which is hosting a set of service chains that implement the VNFs. The model explicitly provides for robustness to unknown or imprecisely formulated resource demand variations, powers down unused routers, switch ports and servers, and calculates the energy optimal VNF placement and network embedding also considering latency constraints on the service chains. We propose both exact and heuristic methods. Our experiments were carried out using the virtualized Evolved Packet Core (vEPC), which allows us to quantitatively assess the trade-off between energy cost, robustness and the protection level of the solutions against demand uncertainty. Our heuristic is able to converge to a good solution in a very short time, in comparison to the exact solver, which is not able to output better results in a longer run as demonstrated by our numerical evaluation. We also study the degree of robustness of a solution for a given protection level and the cost of additional energy needed because of the usage of more computing and network elements. (C) 2017 Elsevier B.V. All rights reserved.

关键词： Virtualization binary linear programming Robust optimization Network function virtualization (NW) EPC 5G

来源：评论

学校读者我要写书评

暂无评论

Graph edit distance contest: Results and future challenges

引用

PATTERN RECOGNITION LETTERS 2017年 100卷 96-103页

作者： Abu-Aisheh, Zeina Gauzere, Benoit Bougleux, Sebastien Ramel, Jean-Yves Brun, Luc Raveaux, Romain Heroux, Pierre Adam, Sebastien Univ Francois Rabelais Tours 64 Ave Jean Portalis F-37200 Tours France Normandie Univ UNIROUEN UNIHAVRE INSA RouenLITIS F-76000 Rouen France Normandie Univ UNICAEN CNRS ENSICAENGREYC UMR 6072 6 Bd Marechal Juin F-14050 Caen France

Graph Distance Contest (GDC) was organized in the context of ICPR 2016. Its main challenge was to inspect and report performances and effectiveness of exact and approximate graph edit distance methods by comparison with a ground truth. This paper presents the context of this competition, the metrics and datasets used for evaluation, and the results obtained by the eight submitted methods. Results are analyzed and discussed in terms of computation time and accuracy. We also highlight the future challenges in graph edit distance regarding both future methods and evaluation metrics. The contest was supported by the Technical Committee on Graph-Based Representations in Pattern Recognition (TC-15) of the International Association of Pattern Recognition (IAPR). (C) 2017 Elsevier B.V. All rights reserved.

关键词： Graph edit distance Pattern Recognition binary linear programming Quadratic assignment Branch-and-bound

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Maximizing benefits in project selection: a hybrid approach

引用

APPLIED ECONOMICS 2017年第40期49卷 4071-4082页

作者： Wu, Shang Toussaint, Jenna Messer, Kent D. Univ Delaware Dept Appl Econ & Stat Newark DE 19716 USA Univ Delaware Dept Econ Newark DE USA

Charitable foundations and government programmes should endeavour to allocate their limited resources to best serve their constituents. Yet, mathematical programming techniques are rarely used despite overwhelming evidence of their superiority in selecting projects that yield higher levels of total benefits. We present a novel hybrid selection model' that combines binary linear programming and heuristic rank-based models applied to two case studies. The first case focuses on providing services to women and shows a hybrid model would have selected the top three signature' projects and maintained an above-average overall project benefit while securing a 180% improvement in the number of projects funded, a 66% improvement in the number of women served and a 132% improvement in the total benefit achieved. In the second case, we apply the hybrid approach to data from the US government's largest forest preservation programme and demonstrate that the hybrid approach could allow the programme to select up to 11 top-scoring projects while still achieving a 97% gain in the total overall benefit compared to their traditional method. These case studies show that the hybrid approach has the potential to be applied in a variety of settings and improve how foundations and programmes achieve their goals.

关键词： binary linear programming charitable donation allocation goal programming hybrid selection model

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：