In this paper, we study the over-constrained airport gate assignment problem where the objectives are to minimize the number of ungated 4ights and total walking distances or connection times. We 7rst use a greedy algorithm to minimize ungated 4ights. Exchange moves are employed to facilitate the use of heuristics. Simulated annealing and a hybrid of simulated annealing and tabu search are used....

We present a parallel simulated annealing algorithm for crystallization of N-body systems. The implementation uses systolic simulated annealing with additional parallel cost function evaluation. We have a hybrid topology which consists of a systolic ring and attached to each ring processor a tree of processors. Our research topic is crystallization of particles on a spherical surface. Some resu...

Software testing is an important stage in the software development process, which key to ensure quality and improve reliability. fault localization most part of testing. In this paper, problem modeled as a combinatorial optimization problem, using function call path starting point. A heuristic search algorithm based on hybrid genetic simulated annealing used locate defects. Experimental results...

mutual information (mi) is a widely used similarity metric for multimodality image registration. however, it involves an extremely high computational time especially when it is applied to volume images. moreover, its robustness is affected by existence of local maxima. the multi-resolution pyramid approaches have been proposed to speed up the registration process and increase the accuracy of th...

We develop a hybrid type of quantum annealing in which we control temperature and quantum field simultaneously. We study the efficiency of proposed quantum annealing and find a good schedule of changing thermal fluctuation and quantum fluctuation. In this paper, we focus on clustering problems which are important topics in information science and engineering. We obtain the better solution of th...

In this paper we present a hybrid strategy developed using genetic algorithms (GAs), simulated annealing (SA), and quantum simulated annealing techniques (QSA) for the discrete time–cost trade-off problem (DTCTP). In the hybrid algorithm (HA), SA is used to improve hill-climbing ability of GA. In addition to SA, the hybrid strategy includes QSA to achieve enhanced local search capability. The H...

Circles packing problem is an NP-hard problem and is difficult to solve. In this paper, a hybrid search strategy for circles packing problem is discussed. A way of generating new configuration is presented by simulating the moving of elastic objects, which can avoid the blindness of simulated annealing search and make iteration process converge fast. Inspired by the life experiences of people, ...

In this paper, a multi-objective project scheduling problem is addressed. This problem considers two conflicting, priority optimization objectives for project managers. One of these objectives is to minimize the project makespan. The other objective is to assign the most effective set of human resources to each project activity. To solve the problem, a multi-objective hybrid search and optimiza...

This paper proposes a mixed integer programming model to solve a non-identical parallel machine (NIPM) scheduling with sequence-dependent set-up times and human resiliency engineering. The presented mathematical model is formulated to consider human factors including Learning, Teamwork and Awareness. Moreover, processing time of jobs are assumed to be non-deterministic and dependent to their st...