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

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

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

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

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

Metaheuristics are general problem solving algorithms which abstract from the actual problem description. Therefore they can be easily applied to many optimization problems. Simulated annealing is a simple and fast metaheuristic with an analogy to metal processing. As metal particles generate a solid and regular structure when cooling slowing simulated annealing seeks a low-energy solution avoi...

Simulated annealing is a well-studied local search metaheuristic used to address discrete and, to a lesser extent, continuous optimization problems. The key feature of simulated annealing is that it provides a mechanism to escape local optima by allowing hill-climbing moves (i.e., moves which worsen the objective function value) in hopes of finding a global optimum. A brief history of simulated...

Two well known stochastic optimization algorithms, simulated annealing and genetic algorithm are compared when using a sample to minimize an objective function which is the expectation of a random variable. Since they lead to minimum depending on the sample, a weighted version of simulated annealing is proposed in order to reduce this kind of overt bias. The algorithms are implemented on an opt...