نتایج جستجو برای: population based simulated annealing algorithm
تعداد نتایج: 3912412 فیلتر نتایج به سال:
A simulated annealing based algorithm is presented for the determination of optimal ship routes through the minimization of a cost function. This cost function is a weighted sum of the time of voyage and the voyage comfort (safety is taken into account too). The latter is dependent on both the wind speed and direction and the wave height and direction. The algorithm first discretizes an initial...
In this paper scatter search algorithm has been hybridized with simulated annealing algorithm. Scatter search algorithm has some disadvantages which will be solved by using concepts of simulated annealing algorithm. Simulated annealing algorithm will provide scatter search algorithm with more of exploration for problem search space, this will increase ratio of getting optimal solutions. The hyb...
Distributed generation (DG) based on oilfield associated gas has the characteristics of dispersive and small capacity. According to load control type, DG is treated as PQ point in power flow calculation. A distribution network reconfiguration algorithm based on simulated annealing and immune is proposed in this paper. Boltzmann simulated annealing operator is used in selection operation, and me...
In some industries as foundries, it is not technically feasible to interrupt a processor between jobs. This restriction gives rise to a scheduling problem called no-idle scheduling. This paper deals with scheduling of no-idle open shops to minimize maximum completion time of jobs, called makespan. The problem is first mathematically formulated by three different mixed integer linear programming...
Optimization of emergency vehicles routing is a complicated system engineering that is influenced by multitudinous factors. To improve efficiency of emergency rescuing, the optimization model of emergency vehicles routing have also been built, And on that basis, and optimization algorithm have also been put forward based on simulated annealing algorithm. Finally, in order to testify validity, o...
A design problem of cross-docking distribution networks is addressed as a new research area in logistics management. This paper presents a new mathematical model for the location of cross-docking facilities and vehicle routing scheduling problems in distribution networks. For this purpose, a two-phase mixed-integer programming (MIP) is formulated. Then, a new heuristic-based simulated annealing...
The layout design problem is a kind of nesting problems that is naturally NP-hard and very difficult to solve. Layout designing of machine is even more difficult because of its nesting items are actually machine parts that have both irregular shapes and complex constraints. A feasible way to solve machine layout problem is to employ ameliorative algorithms, such as simulated annealing algorithm...
The flexible architecture of evolutionary algorithms allows specialised models to be obtained with the aim of performing as other search methods do, but more satisfactorily. In fact, there exist several evolutionary proposals in the literature that play the role of local search methods. In this paper, we make a step forward presenting a specialised evolutionary approach that carries out a search
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید