Optimal domain decomposition using the global sensitivity analysis-based metaheuristic algorithm

No abstract is available for this paper.

• Publication year

  2017

• Venue

  Scientia Iranica

• Publication date

  2017-10-03

• Fields of study

  Computer Science, Engineering

• Identifiers
  DOI 10.24200/SCI.2017.4508
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Optimal design of truss structures using a new optimization algorithm based on global sensitivity analysis

  2016cited by this paper
• Optimal domain decomposition using Colliding Bodies Optimization and k-median method

  2015cited by this paper
• Space-partition method for the variance-based sensitivity analysis: Optimal partition scheme and comparative study

  2014cited by this paper
• Computational Structural Analysis and Finite Element Methods

  2013cited by this paper
• Ant colony optimization for finding medians of weighted graphs

  2008cited by this paper
• Optimal domain decomposition via p-median methodology using ACO and hybrid ACGA

  2008cited by this paper
• The directional p-median problem : Definition , complexity , and algorithms

  2006cited by this paper
• Hybrid ant systems for the dynamic facility layout problem

  2006cited by this paper
• Algorithms of Ant System and Simulated Annealing for the p-median Problem

  2004cited by this paper
• An Efficient Genetic Algorithm for the p-Median Problem

  2003cited by this paper
• Óò×øøòø¹¹¹ Blockinøóö Ôôöóüüññøøóò Ððóööøøñ Óö Øøø ¹ñññññò Ôöóóððñ´´üøøòòòò ×øöö Blockinøµ

  1999cited by this paper
• A Bionomic Approach to the Capacitated p-Median Problem

  1998cited by this paper
• Hybrid Genetic Algorithm for Solving the p-Median Problem

  1998cited by this paper
• Domain decomposition for finite element analysis

  1997cited by this paper
• Optimal Structural Analysis

  1997cited by this paper
• Capacitated clustering problems by hybrid simulated annealing and tabu search

  1994cited by this paper
• Automatic partitioning of unstructured meshes for the parallel solution of problems in computational mechanics

  1993cited by this paper
• A simple and efficient automatic fem domain decomposer

  1988cited by this paper
• A tree search algorithm for the p-median problem

  1982cited by this paper
• An Algorithmic Approach to Network Location Problems. I: The p-Centers

  1979cited by this paper

• OPTIMAL DECOMPOSITION OF FINITE ELEMENT MESHES VIA K-MEDIAN METHODOLOGY AND DIFFERENT METAHEURISTICS

  2018cites this paper