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

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

Journal: :journal of electrical and computer engineering innovations 0
shahriar minaee jalil imam khomeini international university, qazvin, iran ali khaleghi imam khomeini international university, qazvin, iran

this paper deals with the problem of user-server assignment in online social network systems. online social network applications such as facebook, twitter, or instagram are built on an infrastructure of servers that enables them to communicate with each other. a key factor that determines the facility of communication between the users and the servers is the expected transmission time (ett). a ...

1996
Rutvik Desai Rajendra Patil

Simulated annealing is an established method for global optimization. Perhaps its most salient feature is the statistical promise to deliver a globally optimal solution. In this work, we propose a technique which attempts to combine the robustness of annealing in rugged terrain with the efficiency of local optimization methods in simple search spaces. On a variety of benchmark functions, the pr...

1994
J. M. Voogd P. M. A. Sloot

The research presented here is a comparison of the scalability of the simulated annealing algorithm on a vector super computer (CRAY Y-MP) with the scalability of a parallel implementation on a massively parallel transputer surface (Parsytec GCel with 512 nodes of type T805). Some results of the annealing procedure applied to the crystallization of Lennard-Jones particles on a sphere are presen...

2008
Luke Jostins

The approach of reverse engineering gene networks by fitting models has been highly successful, but increasing model complexity means that more powerful global optimisation techniques are required for model fitting; for this, we require faster parallel algorithms. I examine the modeling of the gap gene network in Drosophila, for which a gene network model, in the form of a set of differential e...

Journal: :Stochastic Processes and their Applications 2001

پایان نامه :وزارت علوم، تحقیقات و فناوری - دانشگاه صنعتی (نوشیروانی) بابل - دانشکده مهندسی مکانیک 1389

due to the limiting workspace of parallel manipulator and regarding to finding the trajectory planning of singularity free at workspace is difficult, so finding a best solution that can develop a technique to determine the singularity-free zones in the workspace of parallel manipulators is highly important. in this thesis a simple and new technique are presented to determine the maximal singula...

Journal: :journal of industrial engineering and management studies 0
e. babaee tirkolaee department of industrial engineering, mazandaran university of science and technology, babol, iran. m. alinaghian department of industrial eengineering, isfahan university of technology, isfahan, iran. m. bakhshi sasi department of industrial eengineering, isfahan university of technology, isfahan, iran. m. m. seyyed esfahani department of industrial engineering, mazandaran university of science and technology, babol, iran.

the urban waste collection is one of the major municipal activities that involves large expenditures and difficult operational problems. also, waste collection and disposal have high expenses such as investment cost (i.e. vehicles fleet) and high operational cost (i.e. fuel, maintenance). in fact, making slight improvements in this issue lead to a huge saving in municipal consumption. some inci...

Journal: :journal of optimization in industrial engineering 2011
mohammad jafar tarokh mehdi yazdani mani sharifi mohammad navid mokhtarian

task assignment problem (tap) involves assigning a number of tasks to a number of processors in distributed computing systems and its objective is to minimize the sum of the total execution and communication costs, subject to all of the resource constraints. tap is a combinatorial optimization problem and np-complete. this paper proposes a hybrid meta-heuristic algorithm for solving tap in a h...

Journal: :journal of optimization in industrial engineering 2013
bahman naderi

this paper investigates the problem of selecting and scheduling a set of projects among available projects. each project consists of several tasks and to perform each one some resource is required. the objective is to maximize total benefit. the paper constructs a mathematical formulation in form of mixed integer linear programming model. three effective metaheuristics in form of the imperialis...

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

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