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

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

2011
Jonathan Warrell Philip H. S. Torr

Traditional approaches to Multiple-Instance Learning (MIL) operate under the assumption that the instances of a bag are generated independently, and therefore typically learn an instance-level classifier which does not take into account possible dependencies between instances. This assumption is particularly inappropriate in visual data, where spatial dependencies are the norm. We introduce her...

پایان نامه :وزارت علوم، تحقیقات و فناوری - دانشگاه تربیت مدرس 1380

در این مطالعه ابتدا نقش فن آوری اطلاعات و تجارت الکترونیک بر مدیریت زنجیره تامین مورد بررسی قرار می گیرد. سپس پس از بررسی مدیریت موجودی در مدیریت زنجیره تامین، الگوریتمی بر مبنای مدلی که توسط آقای گریوز graves توسعه داده شده است ، به وسیله روش فوق ابتکاری simulated annealing ابداع گردیده، که بواسطه آن می توان پیکره بندی بهینه زنجیره تامین را با رویکرد کمینه نمودن هزینه موجودی و سطح سرویس بالا ب...

Journal: :CoRR 2007
Lester Ingber

Real Options for Project Schedules (ROPS) has three recursive sampling/optimization shells. An outer Adaptive Simulated Annealing (ASA) optimization shell optimizes parameters of strategic Plans containing multiple Projects containing ordered Tasks. A middle shell samples probability distributions of durations of Tasks. An inner shell samples probability distributions of costs of Tasks. PATHTRE...

H. Shakouri G K. Shojaee G M.B . Menhaj

It is a long time that the Simulated Annealing (SA) procedure has been introduced as a model-free optimization for solving NP-hard problems. Improvements from the standard SA in the recent decade mostly concentrate on combining its original algorithm with some heuristic methods. These modifications are rarely happened to the initial condition selection methods from which the annealing schedules...

Journal: :Academic Journal on Computing, Engineering and Applied Mathematics 2020

Journal: :journal of optimization in industrial engineering 2010
parviz fattahi mohammad saidi mehrabad

in this paper, a new approach to overlapping operations in job shop scheduling is presented. in many job shops, a customer demand can be met in more than one way for each job, where demand determines the quantity of each finished job ordered by a customer. in each job, embedded operations can be performed due to overlapping considerations in which each operation may be overlapped with the other...

Journal: :journal of optimization in industrial engineering 2012
nima zoraghi amir abbas najafi seyed taghi akhavan niaki

this study aims to deal with a more realistic combined problem of project scheduling and material ordering. the goal is to minimize the total material holding and ordering costs by determining the starting time of activities along with material ordering schedules subject to some constraints. the problem is first mathematically modelled. then a hybrid simulated annealing and genetic algorithm is...

Journal: :journal of optimization in industrial engineering 2012
mehrnoosh taherkhani mehdi seifbarghy

this study aims to minimize the total cost of a four-echelon supply chain including suppliers, an assembler, distributers, and retailers. the total cost consists of purchasing raw materials from the suppliers by the assembler, assembling the final product, materials transportation from the suppliers to the assembler, product transportation from the assembler to the distributors, product transpo...

Journal: :international journal of advanced biological and biomedical research 2013
marzieh mohammadi gholam-abass barani kourosh qaderi

earth dam is a structure as homogeneous or non-homogeneous forms for raising water level or water supply. earth dam consist of different parts that one of the main parts is clay core. choosing an optimal non permeable core which causes reduction of seepage through dam body and also being stable is necessary. the objective of this research is to optimize the geometry of earth dam clay core such ...

2012
Liudmila Cheremisinova Irina Loginova

In the paper the programmable logic array (PLA) topological optimization problem is dealt with using folding techniques. A PLA folding algorithm based on the method of simulated annealing is presented. A simulated-annealing PLA folding algorithm is presented for multiple unconstrained folding. Then, the algorithm is extended to handle constrained folding. In this way, simple folding is consider...

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

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