Weld sequence optimization: The use of surrogate models for solving sequential combinatorial problems

被引:44
|
作者
Voutchkov, I [1 ]
Keane, AJ
Bhaskar, A
Olsen, TM
机构
[1] Univ Southampton, Sch Engn Sci, Highfield SO17 1BJ, England
[2] Volvo Aero Corp, Trollhattan, Sweden
关键词
combinatorial optimization; optimization of sequences; surrogate model; welding;
D O I
10.1016/j.cma.2005.02.003
中图分类号
T [工业技术];
学科分类号
08 ;
摘要
The solution of combinatorial optimization problems usually involves the consideration of many possible design configurations. This often makes such approaches computationally expensive, especially when dealing with complex finite element models. Here a surrogate model is proposed that can be used to reduce substantially the computational expense of sequential combinatorial finite element problems. The model is illustrated by application to a weld path planning problem. (c) 2005 Elsevier B.V. All rights reserved.
引用
收藏
页码:3535 / 3551
页数:17
相关论文
共 47 条
  • [21] CS-PSO: chaotic particle swarm optimization algorithm for solving combinatorial optimization problems
    Xiaolong Xu
    Hanzhong Rong
    Marcello Trovati
    Mark Liptrott
    Nik Bessis
    Soft Computing, 2018, 22 : 783 - 795
  • [22] A general deep reinforcement learning hyperheuristic framework for solving combinatorial optimization problems
    Kallestad, Jakob
    Hasibi, Ramin
    Hemmati, Ahmad
    Soerensen, Kenneth
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2023, 309 (01) : 446 - 468
  • [23] A quantum-inspired Tabu search algorithm for solving combinatorial optimization problems
    Chiang, Hua-Pei
    Chou, Yao-Hsin
    Chiu, Chia-Hui
    Kuo, Shu-Yu
    Huang, Yueh-Min
    SOFT COMPUTING, 2014, 18 (09) : 1771 - 1781
  • [24] A surrogate-assisted multi-objective particle swarm optimization of expensive constrained combinatorial optimization problems
    Gu, Qinghua
    Wang, Qian
    Li, Xuexian
    Li, Xinhong
    KNOWLEDGE-BASED SYSTEMS, 2021, 223
  • [25] Dynamical System-Based Computational Models for Solving Combinatorial Optimization on Hypergraphs
    Bashar, Mohammad Khairul
    Mallick, Antik
    Ghosh, Avik W.
    Shukla, Nikhil
    IEEE JOURNAL ON EXPLORATORY SOLID-STATE COMPUTATIONAL DEVICES AND CIRCUITS, 2023, 9 (01): : 21 - 28
  • [26] Solving constrained combinatorial optimization problems via importance sampling in the grand canonical ensemble
    Zimmermann, KH
    COMPUTER PHYSICS COMMUNICATIONS, 2005, 165 (03) : 243 - 259
  • [27] Knowledge-based approach for dimensionality reduction solving repetitive combinatorial optimization problems
    Wang, Qing
    EXPERT SYSTEMS WITH APPLICATIONS, 2021, 184
  • [28] Genetic Engineering Algorithm (GEA): An Efficient Metaheuristic Algorithm for Solving Combinatorial Optimization Problems
    Sohrabi, Majid
    Fathollahi-Fard, Amir M.
    Gromov, V. A.
    AUTOMATION AND REMOTE CONTROL, 2024, 85 (03) : 252 - 262
  • [29] SOLVING LINEAR CONDITIONAL COMPLETELY COMBINATORIAL OPTIMIZATION PROBLEMS ON PERMUTATIONS BY THE BRANCH AND BOUND METHOD
    Iemets, O. O.
    Yemets, Ye. M.
    Parfionova, T. A.
    Chilikina, T. V.
    CYBERNETICS AND SYSTEMS ANALYSIS, 2013, 49 (02) : 264 - 278
  • [30] Strategies of node selection in search procedures for solving combinatorial optimization problems: A survey and a general formalization
    Rafael Pastor
    Albert Corominas
    Top, 2000, 8 (1) : 111 - 134