Memory-based heuristic search and optimal structural design

被引:0
|
作者
Bland, JA [1 ]
机构
[1] Nottingham Trent Univ, Dept Math Stat & Operat Res, Nottingham NG1 4BU, England
来源
SOFT COMPUTING TECHNIQUES AND APPLICATIONS | 2000年
关键词
D O I
暂无
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Tabu search is a recent memory-based combinatorial optimisation technique that has the ability to avoid entrapment by local optima and hence search for a global optimum. The aims of this paper are to present an implementation of tabu search in a structural design context and to show how it may be applied to a sufficiently difficult optimal design problem.
引用
收藏
页码:141 / 145
页数:5
相关论文
共 50 条
  • [41] Memory-based approaches and beyond
    Sanford, AJ
    Garrod, SC
    DISCOURSE PROCESSES, 2005, 39 (2-3) : 205 - 224
  • [42] Memory-Based Language Processing
    Stroppa, Nicolas
    MACHINE TRANSLATION, 2006, 20 (02) : 143 - 145
  • [43] Memory-Based Language Processing
    Yvon, Francois
    TRAITEMENT AUTOMATIQUE DES LANGUES, 2006, 47 (02): : 259 - 262
  • [44] Memory-based Extractive Summarization
    Feng, Chong
    Pan, Zhiqiang
    Zheng, Jianming
    Xu, Ying
    2018 3RD INTERNATIONAL CONFERENCE ON MECHANICAL, CONTROL AND COMPUTER ENGINEERING (ICMCCE), 2018, : 549 - 552
  • [45] Memory-based language processing
    Kubler, Sandra
    COMPUTATIONAL LINGUISTICS, 2006, 32 (04) : 559 - 561
  • [46] Artificial memory-based optimization
    1600, Systems Engineering Society of China (34):
  • [47] Memory-based modes of presentation
    François Recanati
    Synthese, 203
  • [48] Memory-based motion simulation
    Park, W
    Chaffin, DB
    Martin, BJ
    DIGITAL HUMAN MODELING CONFERENCE, 2002, 1675 : 255 - 270
  • [49] Design of an efficient memory-based channel decoder DVB-T
    Chang, YN
    2005 IEEE INTERNATIONAL SYMPOSIUM ON CIRCUITS AND SYSTEMS (ISCAS), VOLS 1-6, CONFERENCE PROCEEDINGS, 2005, : 5019 - 5022
  • [50] Optimal retrieval in puzzle-based storage with heuristic search and tabulation
    Rosenfeld, Ariel
    NETWORKS, 2022, 79 (03) : 390 - 402