scispace - formally typeset
Search or ask a question
Topic

Extremal optimization

About: Extremal optimization is a research topic. Over the lifetime, 1168 publications have been published within this topic receiving 104943 citations.


Papers
More filters
Journal ArticleDOI
TL;DR: In this article, a comparative study of solar sail trajectory optimization using different control strategies was performed using a Flat Solar Sail (FSS) propulsion system. And the results obtained in this work were compared with previously results that considered constant values of time between maneuvers.

4 citations

Journal ArticleDOI
TL;DR: In CAD/CAM integration system, the problem of the path optimization to be thorough researched, an intelligence fusion algorithm is put forward based on ant colony algorithm and lin-kernighan (LK) algorithm.
Abstract: In CAD/CAM integration system, the problem of the path optimization to be thorough researched Through numerical describe of information elements, by using graph theory of traveling salesman problem,set up the mathematical model of path optimization problem Based on ant colony algorithm and lin-kernighan (LK) algorithm, an intelligence fusion algorithm is put forward With group of holes processing as an example, the group of holes drilling tool path of optimized, and realize the CAD/CAM many features of optimization, which greatly improve the processing precision and efficiency

4 citations

Proceedings ArticleDOI
27 Mar 2015
TL;DR: This paper presents an original 3D layout graph partitioning heuristics implemented with the use of extremal optimization method and the preliminary results show very good performance and stimulate further research.
Abstract: Computer-aided 3D ICs layout design is an NP-hard problem in which an important step is the graph partitioning task If speed is the dominant requirement, the commonly applied Fiduccia-Mattheyses partitioning algorithm is superior to any other local search method However, taking into account other cost function, it often fails to obtain a quasi-optimal solution in 3D spaces This paper presents an original 3D layout graph partitioning heuristics implemented with the use of extremal optimization method The preliminary results show very good performance and stimulate further research

4 citations

Journal ArticleDOI
TL;DR: A comparative study of three recent optimization metaheuristics applied to solve the NP-hard optimization problem called the travelling salesman problem, cuckoo search algorithm, cat swarm optimization algorithm and bat-inspired algorithm is done.
Abstract: this research paper aims to do a comparative study of three recent optimization metaheuristic approaches that had been applied to solve the NP-hard optimization problem called the travelling salesman problem. The three recent metaheuristics in study are cuckoo search algorithm, cat swarm optimization algorithm and bat-inspired algorithm. To compare the performances of these methods, the three metaheuristics are applied to solve some benchmark instances of TSPLIB. The obtained results are collected and the error percentage is calculated. The discussion, will present which method is more efficient to solve the real application based on the travelling salesman problem.

4 citations

Proceedings ArticleDOI
01 Jan 2012

4 citations


Network Information
Related Topics (5)
Genetic algorithm
67.5K papers, 1.2M citations
85% related
Optimization problem
96.4K papers, 2.1M citations
81% related
Artificial neural network
207K papers, 4.5M citations
80% related
Cluster analysis
146.5K papers, 2.9M citations
80% related
Fuzzy logic
151.2K papers, 2.3M citations
78% related
Performance
Metrics
No. of papers in the topic in previous years
YearPapers
20232
202213
20217
20209
201922
201815