返回
Branch-and-price algorithm for fuzzy integer programming problems with block angular structure
DOI:10.1016/j.fss.2015.09.020.png)
摘要
En 中文
This paper deals with fuzzy integer linear programming problems with block angular structure in which the fuzzy constraints are simplified by using possibility and necessity relations. This main fuzzy problem is efficiently decomposed and is solved by a branch-and-price algorithm. In the nodes of the branch-and-price tree, the linear relaxation of the problem is solved by applying a column generation method. Also, the relationship between the optimal solutions of this problem under possibility and necessity relations is derived. To show the validation of the proposed algorithm, some results are proved. In addition, the application of this algorithm is illustrated on fuzzy multicommodity flow problem. For this case, a new branching scheme is proposed to preserve the network structure of the subproblems which are produced in the column generation method. Some examples are solved and their results are compared with the previous works. Also, the results of the proposed algorithm are reported on some large-scale benchmark instances. (C) 2015 Elsevier B.V. All rights reserved.
Keyword:
Fuzzy optimization
Branch-and-price algorithm
Branching rule
Column generation
Integer multicommodity flow problem
Possibility and necessity relations
AI总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
2.7
论文数:
7.7K
被引数:
1.7W
机构
引用论文
Decomposition's Dantzig-Wolfe applied to fuzzy multicommodity flow problems分解的dantzig-wolfe应用于模糊多商品流问题

