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

Quantitative stability analysis for vector problems of 0-1 programming

DISCRETE OPTIMIZATION 2010年第1-2期7卷 48-63页

作者： Emelichev, Vladimir Podkopaev, Dmitry Polish Acad Sci Syst Res Inst PL-01447 Warsaw Poland Belarusian State Univ Fac Mech & Math Minsk 220050 BELARUS

We consider multiple objective 0-1 programming problems in the situation where parameters of objective functions and linear constraints are exposed to independent perturbations. We study quantitative characteristics of stability (stability radii) of problem solutions. An approach to deriving formulae and estimations of stability radii is presented. This approach is applied to stability analysis of the linear 0-1 programming problem and problems with two types of nonlinear objective functions: linear absolute value and quadratic. (C) 2010 Elsevier B.V. All rights reserved.

关键词： 0-1 programming Vector optimization Stability radius

来源：评论

学校读者我要写书评

暂无评论

An interactive fuzzy satisficing method for general multiobjective 0-1 programming problems through genetic algorithms with double strings based on a reference solution

引用

FUZZY SETS AND SYSTEMS 2002年第3期125卷 289-300页

作者： Sakawa, M Kato, K Hiroshima Univ Fac Engn Dept Ind & Syst Engn Higashihiroshima 7398527 Japan

In this paper, focusing on general multiobjective 0-1 programming problems involving positive and negative coefficients, we propose an interactive fuzzy satisficing method by extending our previous genetic algorithms with double strings for multiobjective multidimensional 0-1 knapsack problems. In the extended genetic algorithms, a new decoding algorithm for individuals represented by double strings which maps each individual to a feasible solution is proposed through the introduction of backtracking and individual modification. After examining the feasibility and efficiency of the extended genetic algorithms with double strings using a lot of 0-1 programming problems involving positive and negative coefficients, an illustrative numerical example demonstrated the feasibility and efficiency of the proposed interactive fuzzy satisficing method. (C) 2002 Elsevier Science B.V. All rights reserved.

关键词： multicriteria analysis genetic algorithms 0-1 programming fuzzy programming interactive programming

来源：评论

学校读者我要写书评

暂无评论

Interactive fuzzy stochastic multi-level 0-1 programming using tabu search and probability maximization

引用

EXPERT SYSTEMS WITH APPLICATIONS 2014年第6期41卷 2957-2963页

作者： Sakawa, Masatoshi Matsui, Takeshi Hiroshima Univ Fac Engn Higashihiroshima 7398527 Japan

In this paper, we consider interactive fuzzy programming for multi-level 0-1 programming problems involving random variable coefficients both in objective functions and constraints. Following the probability maximization model together with the concept of chance constraints, the formulated stochastic multi-level 0-1 programming problems are transformed into deterministic ones. Taking into account vagueness of judgments of the decision makers, we present interactive fuzzy programming. In the proposed interactive method, after determining the fuzzy goals of the decision makers at all levels, a satisfactory solution is derived efficiently by updating satisfactory levels of the decision makers with considerations of overall satisfactory balance among all levels. For solving the transformed deterministic problems efficiently, we also introduce novel tabu search for general 0-1 programming problems. A numerical example for a three-level 0-1 programming problem is provided to illustrate the proposed method. (C) 2013 Elsevier Ltd. All rights reserved.

关键词： Multi-level programming Random variables Interactive fuzzy programming Probability maximization Tabu search 0-1 programming

来源：评论

学校读者我要写书评

暂无评论

A class of polynomially solvable 0-1 programming problems and an application

引用

Science China Mathematics 2011年第3期54卷 623-632页

作者： Wang Miao Xie JinXing Xiong HuaChun Tsinghua Univ Dept Math Sci Beijing 100084 Peoples R China

It is well known that general 0-1 programming problems are NP-Complete and their optimal solutions cannot be found with polynomial-time algorithms unless P=NP. In this paper, we identify a specific class of 0-1 programming problems that is polynomially solvable, and propose two polynomial-time algorithms to find its optimal solutions. This class of 0-1 programming problems commits to a wide range of real-world industrial applications. We provide an instance of representative in the field of supply chain management.

关键词： 0-1 programming polynomial-time algorithms supply chain management

来源：评论

学校读者我要写书评

暂无评论

LocalSolver 1.x: a black-box local-search solver for 0-1 programming

引用

4OR-A QUARTERLY JOURNAL OF OPERATIONS RESEARCH 2011年第3期9卷 299-316页

作者： Benoist, Thierry Estellon, Bertrand Gardi, Frederic Megel, Romain Nouioua, Karim Bouygues E Lab Paris France Univ Aix Marseille 2 CNRS UMR 6166 Fac Sci LuminyLab Informat Fondamentale F-13284 Marseille 07 France

This paper introduces LocalSolver 1.x, a black-box local-search solver for general 0-1 programming. This software allows OR practitioners to focus on the modeling of the problem using a simple formalism, and then to defer its actual resolution to a solver based on efficient and reliable local-search techniques. Started in 2007, the goal of the LocalSolver project is to offer a model-and-run approach to combinatorial optimization problems which are out of reach of existing black-box tree-search solvers (integer or constraint programming). Having outlined the modeling formalism and the main technical features behind LocalSolver, its effectiveness is demonstrated through an extensive computational study. The version 1.1 of LocalSolver can be freely downloaded at http://*** and used for educational, research, or commercial purposes.

关键词： Combinatorial optimization 0-1 programming Local search Black-box solver OR software

来源：评论

学校读者我要写书评

暂无评论

4/R/I/T distribution logistics network 0-1 programming model and application

引用

COMPUTERS & INDUSTRIAL ENGINEERING 2008年第2期55卷 365-378页

作者： Wang Zhuan Zhang Qinghua Yang bo He Wenwen Univ Sci & Technol Beijing Sch Mech Engn Beijing 100083 Peoples R China

With the intensification of competition, enterprises pay more and more attention to logistics network construction and improvement. Optimizing logistics network is regarded as the key way to raise supply chain efficiency. This paper focuses on the definition and analysis of 4/R/I/T logistics network structure which is widely used in distribution logistics system, and puts forward 0-1 programming model to minimize logistics cost based oil 4/R/I/T network structure. The model takes into the restriction of service time limit and sole service characteristics account. This optimization model can be solved by Lingo. An example is given in the end, which introduces the application of this model in a medicine distribution logistics network planning. (C) 2008 Elsevier Ltd. All rights reserved.

关键词： Logistics network Logistics center Distribution center Transfer center 0-1 programming

来源：评论

学校读者我要写书评

暂无评论

A Multi-model Fusion Method Based on 0-1 programming and Its Application in Early Warning of Coal Mill Failure 38

A Multi-model Fusion Method Based on 0-1 Programming and Its...

引用

38th Chinese Control Conference (CCC)

作者： Yang, Liu Zhai, Qiaozhu Wu, Yuxiang Xi An Jiao Tong Univ Minist Educ Key Lab Intelligent Networks & Network Secur Xian 710049 Peoples R China

ISBN: (纸本)9789881563972

In practical operation of the thermal power plant, fault on coal mill is one of the principal factors that hinder the power plant from completing the power generating tasks on schedule. Therefore, early warning on coal mill failures is of great significance to guarantee the stability of thermal power plant and reliability of power supply to the grid system. In this paper, a multi-model fusion method based on 0-1 programming for early warning of the coal mill failure is proposed and evaluated. For this method, the background information and main features of the mill failure problems are taken into consideration. and an optimization algorithm is implemented to combine the results of multiple models. In the optimization algorithm, the sum of the false alarm cost and false negative cost is the objective, and whether accept the pre-warning or not is the variable. The method is evaluated in practical situations, and numerical test shows that the total cost of false alarm and false negative of multi-model fusion method is more promising than that of each single model. The validity is proved through the result.

关键词： Coal mill fault early warning multi-model fusion 0-1 programming

来源：评论

学校读者我要写书评

暂无评论

Construction Methods of S-QC-LDPC Based on 0-1 programming Algorithm 14

Construction Methods of S-QC-LDPC Based on 0-1 Programming A...

引用

IEEE International Conference on Computer and Information Technology (CIT 2014)

作者： Shi, Jun Wang, Xia Wang, Yuanshuang Xi An Jiao Tong Univ Sch Elect & Informat Engn Xian Shaanxi Peoples R China

ISBN: (纸本)9781479962396

This paper analyzes the design of Quasi-Cyclic LDPC (QC-LDPC) without length-4 circle firstly. Because of some limits in structures of QC-LDPC such as other rows or columns will be determined with a given row or column and m short circles will appear with a given short circle in the parity check matrix where m is the order of sub matrix, we deal with the problems with the proposed similar S-QC-LDPC (S-QC-LDPC) based on 0-1 programming. The main idea is looking for constraint conditions without length-4 circles. Moreover, in designing the S-QC-LDPC, we find its particular matrix reflecting the check matrix similar to circulant permutation matrix of QC-LDPC. The simulation results show the proposed S-QC-LDPC can significantly improve the BER performance compared with QC-LDPC.

关键词： QC-LDPC 0-1 programming length-4 circle S-QC-LDPC

来源：评论

学校读者我要写书评

暂无评论

REDUCIBILITY OF MINIMAX TO MINISUM 0-1 programming-PROBLEMS

引用

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH 1981年第2期6卷 125-132页

作者： KRARUP, J PRUZAN, PM UNIV COPENHAGEN INST ECONDK-1455 COPENHAGEN KDENMARK

A 0-1 programming problem with a minimax objective function and any set of constraints is studied. Appropriate transformations of its cost coefficients reduces such a minimax problem to a linear minisum problem with the same set of feasible solutions so that an optimal solution to the latter will also solve the original minimax problem. This reducibility applies for any 0-1 programming problem but is particularly applicable for certain locational decision models. One obvious implication is that an algorithm for solving a p-median (minisum) problem in a network will also solve a corresponding p-center (minimax) problem. Due to intrinsic properties of the minimax criterion, the results presented only hold for 0-1 problems.

关键词： 0-1 programming minimax p-center p-median

来源：评论

学校读者我要写书评

暂无评论

Genetic-combinatorial algorithm of 0-1 programming

Genetic-combinatorial algorithm of 0-1 programming

引用

4th International Conference on Parallel and Distributed Computing, Applications and Technologies (PDCAT 2003)

作者： Yan, YS SW Jiaotong Univ Coll Traff & Transportat Chengdu 610031 Peoples R China

ISBN: (纸本)0780378407

Based on the analysis of research progresses on combinatorial algorithm for integer programming, the binary combinatorial algorithm and the genetic algorithm(GA) are discussed. The improving genetic algorithm including the selection of fitness function, the improving of selection operator, the improving of crossover and mutation operator etc. is pointed out. The genetic-combinatorial algorithm including the basic algorithm thought and the basic processing steps is presented at last, which can be used to solve a kind of 0-1 programming efficiently.

关键词： 0-1 programming binary combinatorial algorithm genetic algorithm genetic-combinatorial algorithm

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：