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

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

2004
Miloš Ohlídal Josef Schwarz

This paper deals with a new algorithm of a parallel simulated annealing HGSA which includes genetic crossover operations. The genetic crossover is used as an enhancement of the origin parallel simulated annealing PSA which allows to recombine solutions produced by individual simulate annealing processes at fixed time intervals. It is found that the proposed algorithm can speed—up the search the...

1999
George E. Nasr A. Harb G. Meghabghab

The problem of multiprocessor scheduling can be stated as scheduling a general task graph on a multiprocessor system such that a set of performance criteria will be optimized. This study investigates the use of near optimal scheduling strategies in multiprocessor scheduling problem. The multiprocessor scheduling problem is modeled and simulated using five different simulated annealing algorithm...

Journal: :journal of optimization in industrial engineering 2012
ragheb rahmaniani abdosalam ghaderi mohammad saidi mehrabad

in this study, we discuss the capacitated facility location-allocation problem with uncertain parameters in which the uncertainty is characterized by given finite numbers of scenarios. in this model, the objective function minimizes the total expected costs of transportation and opening facilities subject to the robustness constraint. to tackle the problem efficiently and effectively, an effici...

Journal: :journal of optimization in industrial engineering 2010
mehrzad abdi khalife babak abbasi amirhossein kamali dolat abadi

in this paper, we considered solving approaches to flexible job shop problems. makespan is not a good evaluation criterion with overlapping in operations assumption. accordingly, in addition to makespan, we used total machine work loading time and critical machine work loading time as evaluation criteria. as overlapping in operations is a practical assumption in chemical, petrochemical, and gla...

N. Balaji N. Jawahar

This paper deals with a multi-period fixed charge production-distribution problem associated with backorder and inventories. The objective is to determine the size of the shipments from each supplier and backorder and inventories at each period, so that the total cost incurred during the entire period towards production, transportation, backorder and inventories is minimised. A 0-1 mixed intege...

امامی میبدی, لیلا, زارع مهرجردی, یحیی, فریدونی, سفیده ,

Since the determination of efficient scheduling plans in sequencing problems with various criterions is considered an important problem, hence in this article a single machine sequencing problem with the minimization type delay and the total weighted lateness objectives are being studied. In this article, the applications of new optimization techniques in sequencing problems and scheduling are ...

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

Journal: :مهندسی صنایع 0
محمد جعفر تارخ دانشگاه صنعتی خواجه نصیر الدین طوسی امیر ناصری کارشناسی ارشد مهندسی صنایع

in this paper, the distribution network for multi-level supply chain has been studied. products produced in factories are sent to customers through warehouses and distribution centers based on specific demands. warehouses as holding inventory facilities are located close to factories and the distribution centers are placed in the most accessible locations for services near customers. each item ...

1989
Lester Ingber

An algorithm is developed to statistically find the best global fit of a nonlinear non-convex cost-function over a D-dimensional space. It is argued that this algorithm permits an annealing schedule for ''temperature'' T decreasing exponentially in annealing-time k, T = T 0 exp(−ck 1/D). The introduction of re-annealing also permits adaptation to changing sensitivities in the multi-dimensional ...

2016
Mohamed Abdel-Baset Ibrahim Hezam G. Wang L. Guo H. Duan L. Liu H. Wang F. Wang X. He L. Luo Abdullah S. Deris M. S. Mohamad A. A. El-Sawy E. M. Zaki

Flower pollination algorithm (FP) is a new nature-inspired algorithm, based on the characteristics of flowering plants. Combining with the features of flower pollination algorithm, an improved simulated annealing algorithm is proposed in this paper (FPSA). It can improve the speed of annealing. The initial state of simulated annealing and new solutions are generated by flower pollination. There...

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

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