An explanation of ordinal optimization: Soft computing for hard problems

被引：70

作者：

Ho, YC ^{[1
]}

机构：

[1] Harvard Univ, Cambridge, MA 02138 USA

来源：

INFORMATION SCIENCES | 1999年 / 113卷 / 3-4期

基金：

美国国家科学基金会;

关键词：

D O I：

10.1016/S0020-0255(98)10056-7

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

This tutorial explains the fundamentals of ordinal optimization, a tool for computationally intensive system performance evaluation and optimization problems. We argue its inclusion as a complementary tool in the arsenal of soft computing techniques. (C) 1999 Elsevier Science Inc. All rights reserved.

引用

页码：169 / 192

页数：24

共 24 条

[1]

[Anonymous], 1997, FUZZY NEURAL NETWORK

[2]

CHEN CH, 1995, THESIS HARVARD U

[3]

CHEN CH, 1996, P IEEE C ROB AUT

[4] Convergence properties of ordinal comparison in the simulation of discrete event dynamic systems [J].

Dai, L .

JOURNAL OF OPTIMIZATION THEORY AND APPLICATIONS, 1996, 91 (02) :363-388

[5]

DAI LY, 1997, J OPTIMIZATION THEOR, V94

[6]

DENG M, 1999, IN PRESS AUTOMATICA

[7]

DENG M, 1992, P 1992 WINT SIM C, P466

[8]

GANZ A, 1994, IEEE ACM T NETWORKIN, V2

[9]

Ho Y.-C., 1992, Discrete Event Dynamic Systems, V2, P61

[10] HEURISTICS, RULES OF THUMB, AND THE 80/20 PROPOSITION [J].

HO, YC .

IEEE TRANSACTIONS ON AUTOMATIC CONTROL, 1994, 39 (05) :1025-1027

← 1 2 3 →