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

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

Journal: :International Journal of Intelligent Information Systems 2014

Journal: :IEE Proceedings C Generation, Transmission and Distribution 1993

Journal: :مهندسی صنایع 0
سید رضا موسوی طباطبائی دانشگاه علم و صنعت ایران احمد ماکویی دانشگاه علم و صنعت ایران

in this paper, we introduce a methodology for safety stock placement in supply chain. the problem has two objectives: minimization of good's delivery time and inventory cost. because the problem belongs to np-hard category, we develop a proper simulated annealing algorithm (sa) for solve the proposed methodology in large scaled problem. for verify the performance and efficiency of the meth...

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 a scheduling problem in a 2-stage supply chain is discussed. suppliers are in the first stage and in the second stage, there are vehicles which carry orders to a manufacturing center. the purpose is to allocate orders to suppliers, sequence the suppliers’ production, allocate orders to transport vehicles and prioritize orders that should be carried by vehicles to minimize the tota...

Journal: :Pattern Recognition 1991
Shokri Z. Selim K. Alsultan

In this paper we discuss the solution of the clustering problem usually solved by the K-means algorithm. The problem is known to have local minimum solutions.A simulated annealing algorithm for the clustering problem. The solution of the clustering problem usually solved by the K-means algorithm.In this paper, we explore the applicability of simulated annealing. Clustering problem is investigat...

2005
Marco Antonio Cruz-Chávez David Juárez-Romero

An algorithm of simulated annealing for the job shop scheduling problem is presented. The proposed algorithm restarts with a new value every time the previous algorithm finishes. To begin the process of annealing, the starting point is a randomly generated schedule with the condition that the initial value of the makespan of the schedule does not surpass a previously established upper bound. Th...

Journal: :journal of computational & applied research in mechanical engineering (jcarme) 2012
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...

One of the most important problems in research and applied fields of production management is a suitable scheduling for different operations. So, there are many approaches for job workshop or job non-workshop scheduling problems. Since job workshop scheduling problems (JSP) belong to NP-Hard class, some metaheuristics methods such as Tabu Search, Simulated Annealing, Genetic Algorithm and Parti...

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

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