Nurse rostering is a difficult search problem with many constraints. In the literature, a number of approaches have been investigated including penalty function methods to tackle these constraints within genetic algorithm frameworks. In this paper, we investigate an extension of a previously proposed stochastic ranking method, which has demonstrated superior performance to other constraint hand...

This paper investigates the dynamic journey time estimation (DJTE) problem, which can be used to estimate simultaneously the mean and standard deviation (SD) of path journey times in stochastic road networks. In this paper, a bi-level programming model is proposed to solve the DJTE problem. The upper level is to minimize the deviations of the mean and SD between the estimated and observed path ...

We describe a real-time, internet-based S&P futures trading system, including a description of general aspects of internet-mediated interactions with electronic exchanges. Inner-shell stochastic nonlinear dynamic models are developed, and Canonical Momenta Indicators (CMI) are derived from a fitted Lagrangian used by outer-shell trading models dependent on these indicators. Recursive and adapti...

The layout of facilities in a logistics scenario involves not only the working responsible for processing materials but also transport lines transporting materials. traditional facility methods do take into account transportation nor calculate material handling cost by Manhattan distance, thus failing to fulfill actual requirements industrial scenarios. In this paper, algorithm framework MOSA-F...

An automatic placement system with emphasis on technology independent methodology and device matching consideration for analog layout design is presented. A novel optimization approach based on circuit partitioning, simulated annealing and branch-and-bound algorithm is proposed to solve the placement problem. The move set used to generate perturbations for annealing is capable of arriving at an...

Pruning an ensemble of classifiers is one of the most significant and effective issues in ensemble method topic. This paper presents a new ensemble pruning method inspired by upward stochastic walking idea. Our proposed method incorporates simulated annealing algorithm and forward selection method for selecting models through the ensemble according to the probabilistic steps. Experimental compa...

In this paper, we demonstrate how simulated annealing algorithm can be applied to clustering algorithms used in ad hoc networks; specifically our recently proposed weighted clustering algorithm(WCA) is optimized by simulated annealing. As the simulated annealing stands to be a powerful stochastic search method, its usage for combinatorial optimization problems was found to be applicable in our ...

A lot of Metaheuristics for solving dynamic combinatorial facility layout problems have been developed, but still require much computation time when the number of facilities or planning horizon is large. Dynamic facility layout should meet a dynamic change in both product mix and demand quantity of each product over a planning horizon by adjusting facility layout effectively under a given syste...

In this paper we introduce a new kind of immobile Location-Allocation problem that consists in determining the service each facility has to offer in order to maximize the covered demand given the positions of the customers and their service requirements and the positions of the immobile facilities. First, we provide a formalization of the problem and then we tackle the problem using two heurist...