DistOpt: A software framework for modeling and evaluating optimization problem solutions in distributed environments

被引:10
作者
Contreras, J [1 ]
Losi, A
Russo, M
Wu, FF
机构
[1] Univ Castilla La Mancha, Escuela Tecn Super Ingenieros Ind, E-13071 Ciudad Real, Spain
[2] Univ Cassino, Dipartimento Ingn Ind, I-03043 Cassino, Italy
[3] Univ Hong Kong, Dept Elect & Elect Engn, Hong Kong, Hong Kong, Peoples R China
关键词
D O I
10.1006/jpdc.2000.1626
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
We present a flexible software environment, named DistOpt, which is useful in building coarse-grain algorithms for solving optimization problems and simulating the solution of the resulting subproblems in multicomputer systems. It is based on a decomposition-coordination approach. by which large optimization problems can be split into subproblems, which are then easier to solve and can be solved in parallel. The object-oriented methodology on which DistOpt is based, and its graphical user interface, are well suited to modify, interface, and extend existing software modules with minimal impact. DistOpt is a flexible and innovative software environment that can be customized by the user in a short development time. (C) 2000 Academic Press.
引用
收藏
页码:741 / 763
页数:23
相关论文
共 23 条
[1]  
Bertsekas Dimitri P., 1989, PARALLEL DISTRIBUTED
[2]  
BOVET DP, 1996, INT WORKSH SOLV COMB, P7
[3]   AUXILIARY PROBLEM PRINCIPLE AND DECOMPOSITION OF OPTIMIZATION PROBLEMS [J].
COHEN, G .
JOURNAL OF OPTIMIZATION THEORY AND APPLICATIONS, 1980, 32 (03) :277-305
[4]   Scalable 2D convex hull and triangulation algorithms for coarse grained multicomputers [J].
Diallo, M ;
Ferreira, A ;
Rau-Chaplin, A ;
Ubeda, S .
JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING, 1999, 56 (01) :47-70
[5]   PARALLEL BRANCH-AND-BOUND ALGORITHMS - SURVEY AND SYNTHESIS [J].
GENDRON, B ;
CRAINIC, TG .
OPERATIONS RESEARCH, 1994, 42 (06) :1042-1066
[6]  
GRACE A, 1994, MATHWORKS
[7]  
LASDON LS, 1965, P JOINT AUT CONTR C
[8]  
LASDON LS, 1979, DESIGN IMPLEMENTATIO, V3
[9]  
LAWRENCE C, 1995, USERS GUIDE CFSQP VE
[10]  
LOSI A, 1999, USERS GUIDE SGRA VER