In this paper, we present a meta-heuristic base on improved shuffled frog leaping algorithm (SFLA) to tackle the multi-objective problem (MOP). The SFLA is suitable to solve the single objective problem. For the multi-objective problem, one main issue is that how to evaluate the quality of two...

By mapping the optimization problems to physical systems, the paper presents a general-purpose stochastic optimization method with extremal dynamics. It is built up with the traveling salesman problem (TSP) being a typical NP-complete problem. As self-organized critical processes of extremal...

It is widely believed that the power-law is a proper probability distribution being effectively applied for evolution in τ-EO (extremal optimization), a general-purpose stochastic local-search approach inspired by self-organized criticality, and its applications in some NP-hard problems,...

Almost all natural, social and man-made-engineered systems can be represented by a complex network to describe their dynamic behaviors. To make a real-world complex network controllable with its desired topology, the study on network controllability has been one of the most critical and...

This paper presents an improved extremal optimization (IEO) algorithm for solving the asymmetric traveling salesman problem (ATSP). At each update step, the IEO algorithm proceeds through two main steps: extremal dynamics and cooperative optimization. As an improvement of extremal optimization...

The adjustable parameters of probability distributions adopted by extremal optimization (EO) and its modified versions play a critical role in controlling their performances. Unlike the traditional static probability distribution based strategy, this paper presents a novel method called...