in this paper, we present a simulated annealing (sa) and a genetic algorithm (ga) based on heuristics for scheduling problem of jobs in virtual cellular manufacturing systems. a virtual manufacturing cell (vmc) is a group of resources that is dedicated to the manufacturing of a part family. although this grouping is not reflected in the physical structure of the manufacturing system, but machin...

This paper presents a simulated annealing algorithm that based on multiple search neighborhoods to solve a special kind of timetable problem. The new algorithm also can solve those problems that can be solved by local search algorithm. Various experimental results show that the new algorithm can actually give more satisfactory solutions than general simulated annealing algorithm can do.

in this paper, we introduce a methodology for safety stock placement in supply chain. the problem has two objectives: minimization of good's delivery time and inventory cost. because the problem belongs to np-hard category, we develop a proper simulated annealing algorithm (sa) for solve the proposed methodology in large scaled problem. for verify the performance and efficiency of the meth...

One fundamental issue for location-based services and applications is solving the location-sensing problem, i.e., determining where a given node is physically located in a network. In a previous paper, we have presented a location-sensing method, called the cell-based positioning method, and its positioning accuracy for the wireless networks with a hexagonal structure and mesh structure. Unfort...

In this paper, a model is presented to locate ambulances, considering backup facility (to increase reliability) and the restriction of ambulance capacity. This model is designed for emergencies. In this model the covered demand for each demand point depends on the number of coverage times and the amount of demand. The demand amount and ambulance coverage radius are considered...

Simulated annealing’s high computational intensity has stimulated researchers to experiment with various parallel and distributed simulated annealing algorithms for shared memory, message-passing, and hybrid-parallel platforms. MapReduce is an emerging distributed computing framework for large-scale data processing on clusters of commodity servers; to our knowledge, MapReduce has not been used ...

This paper investigates scheduling job shop problems with sequence-dependent setup times under minimization of makespan. We develop an effective metaheuristic, simulated annealing with novel operators, to potentially solve the problem. Simulated annealing is a well-recognized algorithm and historically classified as a local-search-based metaheuristic. The performance of simulated annealing crit...

We present an in-depth study of the simulated annealing approach to the scheduling of serial multiproduct batch processes under the assumption of a permutation schedule. Four versions of the simulated annealing algorithm are studied based on two move acceptance criteria, the Metropolis algorithm and the Glauber algorithm, and two annealing schedules, the exponential schedule and the Aarts and v...