scheduling for job shop is very important in both fields of production management and combinatorial op-timization. however, it is quite difficult to achieve an optimal solution to this problem with traditional opti-mization approaches owing to the high computational complexity. the combination of several optimization criteria induces additional complexity and new problems. in this paper, we pro...

The cycle basis of a graph arises in a wide range of engineering problems and has a variety of applications. Minimal and optimal cycle bases reduce the time and memory required for most of such applications. One of the important applications of cycle basis in civil engineering is its use in the force method to frame analysis to generate sparse flexibility matrices, which is needed for optimal a...

In global models of the atmosphere convection is parameterised, since the typical scale of this process is smaller than the model resolution. Here we address some of the uncertainties arising from the selection of different algorithms to simulate this process. Four different parameterisations for atmospheric convection, all used in state-of-the-art models, are implemented in the model system EC...

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

SAGRAD (Simulated Annealing GRADient), a Fortran 77 program for computing neural networks for classification using batch learning, is discussed. Neural network training in SAGRAD is based on a combination of simulated annealing and Møller's scaled conjugate gradient algorithm, the latter a variation of the traditional conjugate gradient method, better suited for the nonquadratic nature of neura...

While many models have investigated the role of competitive mate selection processes in human marriage, few have addressed the potential for assortative processes to explain the observed demographics, as well as simultaneously investigating divorce. To explore the possibility that assortative mate selection processes may explain patterns of both marriage and divorce, we developed an agent-based...

We applied simulated annealing algorithm to nurse scheduling problem. For time complexity problem of simulated annealing, we suggested an efficient transition rule using cost matrix for simulated annealing. The experimental results showed that the suggested method generated a nurse scheduling faster in time and better in quality compared to traditional simulated annealing.