It is a long time that the Simulated Annealing (SA) procedure has been introduced as a model-free optimization for solving NP-hard problems. Improvements from the standard SA in the recent decade mostly concentrate on combining its original algorithm with some heuristic methods. These modifications are rarely happened to the initial condition selection methods from which the annealing schedules...

This paper studies the parallel machine scheduling problem subject to machine and job deterioration in a batched delivery system. By the machine deterioration effect, we mean that each machine deteriorates over time, at a different rate. Moreover, job processing times are increasing functions of their starting times and follow a simple linear deterioration. The objective functions are minimizin...

سخن سردبیر Editorial مجله دانشگاه علوم پزشکی رفسنجان دوره هجدهم، شهریور 1398، 513-514     مطالعات مورد – همگذری (Case Crossover Studies)   محسن رضائیان[1]   M. Rezaeian   مطالعات مورد - همگذری (Case Crossover Studies) به ویژه برای مشخص کردن تأثیر زودگذر مواجهه بر روی رخداد یک بیماری حاد، مناسب است. در این طراحی، به جای آن‌که یک گروه مجزا برای کنترل انتخاب  شود، هر مورد در نقش کنترل ...

It is a long time that the Simulated Annealing (SA) procedure is introduced as a model-free optimization for solving NP-hard problems. Improvements from the standard SA in the recent decade mostly concentrate on combining its original algorithm with some heuristic methods. These modifications are rarely happened to the initial condition selection methods from which the annealing schedules start...

It is a long time that the Simulated Annealing (SA) procedure is introduced as a model-free optimization for solving NP-hard problems. Improvements from the standard SA in the recent decade mostly concentrate on combining its original algorithm with some heuristic methods. These modifications are rarely happened to the initial condition selection methods from which the annealing schedules start...

The problem of teacher placement in a school is faced by Magelang Regency. success determined the minimum total distance between and school, with aim that performance maintained. In computer science this an NP-hard takes very long time to achieve optimal results when done conventional methods. Another approach solve use heuristic algorithms, one which using genetic algorithms. To further improv...

Polycube-maps are used as base-complexes in various fields of computational geometry, including the generation regular all-hexahedral meshes free internal singularities. However, strict alignment constraints behind polycube-based methods make their computation challenging for CAD models numerical simulation via finite element method (FEM). We propose a novel approach based on an evolutionary al...

The colored traveling salesmen problem is a node routing with multiple salesmen, where the cities are divided into m exclusive city sets and one shared set. objective to minimize total distance of Hamiltonian circuits (routes) under following constraints: each be visited by corresponding salesman, while can any salesman. In this work, we present first grouping memetic algorithm for solving chal...