As multiobjective optimization problems have many solutions, evolutionary algorithms have been widely used for complex multiobjective problems instead of simulated annealing. However, simulated annealing also has favorable characteristics in the multimodal search. We developed several simulated annealing schemes for the multiobjective optimization based on this fact. Simulated annealing and evo...

The multilevel thresholding problem is often treated as a problem of optimization of an objective function. This paper presents both adaptation and comparison of six meta-heuristic techniques to solve the multilevel thresholding problem: a genetic algorithm, particle swarm optimization, differential evolution, ant colony, simulated annealing and tabu search. Experiments results show that the ge...

In this paper, a hybrid gradient simulated annealing algorithm is guided to solve the constrained optimization problem. trying problems using deterministic, stochastic methods or hybridization between them, penalty function are most popular approach due their simplicity and ease of implementation. There many approaches handling existence constraints in The simulated-annealing (SA) one successfu...

In this paper, we examine crane scheduling for ports. This important component of port operations management is studied when the non-crossing spatial constraint, which is common to crane operations, are considered. Our objective is to minimize the latest completion time for all jobs, which is a widely used criteria in practice. We provide the proof that this problem is NP-complete and design a ...

Solving large combinatorial optimisation problems is often time consuming, and thus there is interest in accelerating current algorithms by building application specific computers. This paper focuses on accelerating general local search meta-heuristics, such as simulated annealing and tabu search, and presents an architecture for this class of algorithms. As a design case study we describe a sp...

In this paper, Reporting Cell Planning Problem of Location Management in mobile computing system is addressed. In reporting cell planning, some cells in the network are designated as reporting cells and other cells are non-reporting cells. Mobile terminals update information about its current location in a database when it enters into a new reporting cell. The goal of the reporting cell plannin...

abstract the muskingum method is frequently used to route floods in hydrology. however, application of the model is still difficult because of the parameter estimation’s. recently, some of heuristic methods have been used in order to estimate the nonlinear muskingum model. this paper presents a efficient heuristic algorithm, simulated annealing, which has been used to estimate the three paramet...

in this paper, a mixed-integer linearized programming (minlp) model is presented to design a group layout (gl) of a cellular manufacturing system (cms) in a dynamic environment with considering production planning (pp) decisions. this model incorporates with an extensive coverage of important manufacturing features used in the design of cmss. there are also some features that make the presented...

scheduling for job shop is very important in both fields of production management and combinatorial op-timization. however, it is quite difficult to achieve an optimal solution to this problem with traditional opti-mization approaches owing to the high computational complexity. the combination of several optimization criteria induces additional complexity and new problems. in this paper, we pro...