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 ...

The goal of this work is to develop an improved procedure for the solution of the lexicographic bottleneck variant of the assembly line balancing problem (LB-ALBP). The objective of the LB-ALBP is to minimize the workload of the most heavily loaded workstation, followed by the workload of the second most heavily loaded workstation and so on. This problem —recently introduced to the literature (...

To achieve efficient and objective search tasks in an unknown environment, a cooperative search strategy for distributed autonomous mobile robots is developed using a behavior-based control framework with individual and group behaviors. The sensing information of each mobile robot activates the individual behaviors to facilitate autonomous search tasks to avoid obstacles. An 802.15.4 ZigBee wir...

We present an interactive multi-criteria procedure that uses user defined tradeoff-cutting planes to identify promising feasible solution search space. New solutions in the promising feasible solution search space are constructed using combination of scatter and random search. The procedure of identifying tradeoff-cutting planes and scatter search continues for either a predetermined fixed numb...

the robust coloring problem (rcp) is a generalization of the well-known graph coloring problem where we seek for a solution that remains valid when extra edges are added. the rcp is used in scheduling of events with possible last-minute changes and study frequency assignments of the electromagnetic spectrum. this problem has been proved as np-hard and in instances larger than 30 vertices, meta-...

The Robust Coloring Problem (RCP) is a generalization of the well-known Graph Coloring Problem where we seek for a solution that remains valid when extra edges are added. The RCP is used in scheduling of events with possible last-minute changes and study frequency assignments of the electromagnetic spectrum. This problem has been proved as NP-hard and in instances larger than 30 vertices, meta-...

In this paper, a new hybrid metaheuristic algorithm based on the scatter search approach is developed to solve the well-known resource-constrained project scheduling problem. This algorithm combines two solutions from scatter search to build a set of precedence feasible activity lists and select some of them as children for the new population. We use the idea presented in the iN forward/backwar...

OBJECTIVE We present a novel intensity-based algorithm for medical image registration (IR). METHODS AND MATERIALS The IR problem is formulated as a continuous optimization task, and our work focuses on the development of the optimization component. Our method is designed over an advanced scatter search template, and it uses a combination of restart and dynamic boundary mechanisms integrated w...

1. Biochemical Preliminaries and Problem Formulation DNA sequencing is one of the most important problems in computational molecular biology. The goal is to determine a sequence of nucleotides of a DNA fragment. Such a fragment is usually written as a sequence of the letters A, C, G, and T, representing four nucleotides composing the fragment, i.e., adenine, cytosine, guanine, and thymine, resp...

We study the problem of minimizing the profile of a network and develop a solution method by following the tenets of scatter search. Our procedure exploits the structure of the problem and includes strategies that produce and agile search with computational efficiencies. Among several mechanisms, our search includes path relinking as the basis for combining solutions to generate new ones. The p...