In this paper we compare simulated annealing and tabu search approaches to a single machine common due date assignment and scheduling problem with jobs available at different times. The objective is to minimize the total weighted sum of earliness, tardiness and due date costs.

In this report we want to investigate different methods of Artificial Neural Network optimization. Different local and global methods can be used. Backpropagation is the most common method for optimization. Other methods like genetic algorithm, Tabu search, and simulated annealing can be also used. In this paper we implement GA and BP for ANN.

Metaheuristic approaches based on neighborhood search escape local optimality by applying predefined rules and constraints, such as tabu restrictions (in tabu search), acceptance criteria (in simulated annealing), and shaking (in VNS). We propose a general approach that attempts to learn (offline) the guiding constraints that, when applied online, will result in effective escape directions from...

We propose a model for portfolio optimization extending the Markowitz mean–variance model. Based on cooperation with Standard and Poor s we use five specific objectives related to risk and return and allow consideration of individual preferences through the construction of decision-maker specific utility functions and an additive global utility function. Numerical results using customized local...

Three stochastic search techniques have been used to find the optimal sequence of operations required to restore supply in an electrical distribution system on the occurrence of a fault. The three techniques are the genetic algorithm, simulated annealing and the tabu search. The performance of these techniques has been compared. A large distribution system of over 29 substations, 2500 nodes and...

Metaheuristic parallel search methods { tabu search, simulated annealing and genetic algorithms, essentially { are reviewed, classi ed and examined not according to particular methodological characteristics, but following the unifying approach of the level of parallelization. It is hoped that by examining the commonalities among parallel implementations across the eld of metaheuristics, insight...

In this paper, we propose a metaheuristic to solve the pickup and delivery problem with time windows. Our approach is a tabu-embedded simulated annealing algorithm which restarts a search procedure from the current best solution after several non-improving search iterations. The computational experiments on the six newly-generated different data sets marked our algorithm as the first approach t...

3G Cellular networks typically consist of a group of NodeBs connected to a Radio Network Controller (RNC), and a group of RNCs to a Serving GPRS Support Node (SGSNs) as well as to a Mobile Switching Centre (MSCs). Post deployment planning of such network is to re-plan the connectivity among the above mentioned network elements with an objective to minimize the cost of operation of the network. ...

This work approaches the P-median problem with a partitioning around medoids methodology. This problem has been extensively studied because of the multiple applications and its NP-hard nature; therefore several are the efforts to find optimal solutions. In this paper we consider two case studies: 1) instances from OR-Library and 2) geographical objects from the metropolitan zone of Toluca, Mexi...