نتایج جستجو برای: cloud based simulated annealing algorithm

تعداد نتایج: 3480795  

2012
Mohammed Salah Ibrahim Ahmed T. Sadiq Ali M. Sagheer

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

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

2013
Qingrong Wang Zhanting Yuan Qiuyu Zhang Chunlin Liu

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

2007
Nan LI Jianzhong CHA Gang LI Yiping

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

Journal: :Appl. Soft Comput. 2012
Carlos García-Martínez Manuel Lozano Francisco Javier Rodriguez-Diaz

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

2014
Qi Xu Jun Mao Zhihong Jin

As the “first service station” for ships in the whole port logistics system, the tugboat operation system is one of the most important systems in port logistics. This paper formulated the tugboat scheduling problem as a multiprocessor task scheduling problem MTSP after analyzing the characteristics of tugboat operation. The model considers factors of multianchorage bases, different operation mo...

Ali Nazemi Ashkan Hafezalkotob Seyed Hosein Mousavi

With the formation of the competitive electricity markets in the world, optimization of bidding strategies has become one of the main discussions in studies related to market designing. Market design is challenged by multiple objectives that need to be satisfied. The solution of those multi-objective problems is searched often over the combined strategy space, and thus requires the simultaneous...

2012
Maninder Kaur Kawaljeet Singh

The paper presents a new algorithm for circuit partitioning that exploits some of the latest innovations of evolutionary approaches. The proposed algorithm based on swarm intelligence technique hybrids discrete version of artificial bee colony algorithm with Inver over operator along with simulated annealing technique for local improvement of solution. The algorithm is tested on small UCLA inst...

H. Z. Aashtiani and B. Hejazi,

Bus network design is an important problem in public transportation. A main step to this design is determining the number of required terminals and their locations. This is a special type of facility location problem, which is a time-consuming, large scale, combinatorial problem. In a previous attempt by the authors, this problem had been solved by GAMS, based on a branch and bound algorithm. ...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید