The problem of deciding how to land aircraft approaching an airport involves assigning each aircraft to an appropriate runway, computing a landing sequence for each runway and scheduling the landing time for each aircraft. Runway allocation, sequencing and scheduling for each aircraft must ensure the scheduled landing time lies within a predefined time window and meet separation time requiremen...

This paper considers a project scheduling problem with the objective of minimizing resource availability costs, taking into account a deadline for the project and precedence relations among the activities. Exact methods have been proposed for solving this problem, but we are not aware of existing heuristic methods. Scatter search is used to tackle this problem, and our implementation incorporat...

The techniques for the automatic generation of test cases try to efficiently find a small set of cases that allow a given adequacy criterion to be fulfilled, thus contributing to a reduction in the cost of software testing. In this paper we present and analyze two versions of an approach based on the Scatter Search metaheuristic technique for the automatic generation of software test cases usin...

I this paper, we develop a general-purpose heuristic for permutations problems. The procedure is based on the scatter-search and tabu-search methodologies and treats the objective-function evaluation as a black box, making the search algorithm context-independent. Therefore, our main contribution consists of the development and testing of a procedure that uses no knowledge from the problem cont...

Slab Stack Shuffling (SSS) problem is a kind of warehousing operations management problem abstracted from steel industry. SSS problem is to choose appropriate slabs for hot rolling schedule with the objective of minimizing shuffles during the retrieval process. Different from previous literatures, the substitute of slabs is a set of slabs which satisfy the given order demand. The problem in thi...

This article develops several strategies for the parallelization of the metaheuristic called scatter search, which is a population-based method that constructs solutions by combining others. Three types of parallelization have been proposed to achieve either an increase of efficiency or an increase of exploration. The procedures have been coded in C using OpenMP and compared in a shared memory ...

Efficient network inference is one of the challenges of current-day biology. Its application to the study of development has seen noteworthy success, yet a multicellular context, tissue growth, and cellular rearrangements impose additional computational costs and prohibit a wide application of current methods. Therefore, reducing computational cost and providing quick feedback at intermediate s...

introduction: scattered photon is one of the main defects that degrade the quality and quantitative accuracy of nuclear medicine images. accurate estimation of scatter in projection data of spect is computationally extremely demanding for activity distribution in uniform and non-uniform dense media. methods: the objective of this paper is to develop and validate a scatter correction technique t...

Solving scheduling problems enables more efficient use of production capacity. It involves defining the sequence operations, determining capacity resources, and balancing workloads. Different methods, especially metaheuristics, have been used to solve these problems. This study presents application Scatter Search (SS), Genetic Algorithm (GA), Greedy Randomized Adaptive Procedures (GRASP) for mi...

In this paper we explore the influence of adaptive memory in the performance of heuristic methods when solving a hard combinatorial optimization problem. Specifically, we tackle the adaptation of tabu search and scatter search to the bandwidth minimization problem. It consists of finding a permutation of the rows and columns of a given matrix which keeps the non-zero elements in a band that is ...