We proposes an improved grasshopper algorithm for global optimization problems. Grasshopper (GOA) is a recently proposed meta-heuristic inspired by the swarming behavior of grasshoppers. The original GOA has some drawbacks, such as slow convergence speed, easily falling into local optimum, and so on. To overcome these shortcomings, we based on logistic Chaos maps opposition-based learning strat...

c © 2006 by John von Neumann Institute for Computing Permission to make digital or hard copies of portions of this work for personal or classroom use is granted provided that the copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. To copy otherwise requires prior specific permission by the publisher ment...

This paper provides a theoretical proof illustrating that for a certain class of functions having the property that the partial derivatives have the same equation with respect to all variables, the optimum value (minimum or maximum) takes place at a point where all the variables have the same value. This information will help the researchers working with high dimensional functions to minimize t...

This paper presents an analysis of optimal impact strategies to deflect potentially dangerous asteroids. In order to compute the increase in the minimum orbit intersection distance of the asteroid due to an impact with a spacecraft, simple analytical formulae are derived from proximal motion equations. The proposed analytical formulation allows for an analysis of the optimal direction of the de...

the analysis of flow in water-distribution networks with several pumps by the content model may be turned into a non-convex optimization uncertain problem with multiple solutions. newton-based methods such as gga are not able to capture a global optimum in these situations. on the other hand, evolutionary methods designed to use the population of individuals may find a global solution even for ...

the traveling salesman problem (tsp) is a well-known combinatorial optimization problem and holds a central place in logistics management. the tsp has received much attention because of its practical applications in industrial problems. many exact, heuristic and metaheuristic approaches have been proposed to solve tsp in recent years. in this paper, a modified ant colony optimization (maco) is ...

the imperialist competitive algorithm (ica) that was recently introduced has shown its good performance in optimization problems. this algorithm is inspired by competition mechanism among imperialists and colonies, in contrast to evolutionary algorithms. this paper presents optimization of bead geometry in welding process using of ica. therefore, two case studies from literature are presented t...

We propose a deterministic global optimization algorithm for mixed-integer nonlinear bilevel problems (MINBP) by generalizing the Branch-and-Sandwich algorithm (Kleniati and Adjiman, J. Global Optim., doi:10.1007/s10898-013-0121-7, 2014). Advances include the removal of regularity assumptions and the extension of the algorithm to mixed-integer problems. The proposed algorithm can solve very gen...