نتایج جستجو برای: heuristics algorithms

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

Journal: :international journal of optimaization in civil engineering 0
a. kaveh y. vazirinia

tower cranes are major and expensive equipment that are extensively used at building construction projects and harbors for lifting heavy objects to demand points. the tower crane locating problem to position a tower crane and supply points in a building construction site for supplying all requests in minimum time, has been raised from more than twenty years ago. this problem has already been so...

2014
David Tolpin Oded Betzalel Ariel Felner Solomon Eyal Shimony

Recent advances in metareasoning for search has shown its usefulness in improving numerous search algorithms. This paper applies rational metareasoning to IDA* when several admissible heuristics are available. The obvious basic approach of taking the maximum of the heuristics is improved upon by lazy evaluation of the heuristics, resulting in a variant known as Lazy IDA*. We introduce a rationa...

2017
Francesco Percassi Alfonso Gerevini Hector Geffner

Admissible heuristics are essential for optimal planning in the context of search algorithms like A*, and they can also be used in the context of suboptimal planning in order to find quality-bounded solutions. In satisfacing planning, on the other hand, admissible heuristics are not exploited by the best-first search algorithms of existing planners even when a time window is available for impro...

2005
Frank Neumann

Randomized search heuristics have widely been applied to complex engineering problems as well as to problems from combinatorial optimization. We investigate the runtime behavior of randomized search heuristics and present runtime bounds for these heuristics on some well-known combinatorial optimization problems. Such analyses can help to understand better the working principle of these algorith...

1994
Jim Blythe

prodigy's planning algorithm uses domain-independent search heuristics. In this paper, we support our belief that there is no single search heuristic that performs more e ciently than others for all problems or in all domains. The paper presents three di erent domain-independent search heuristics of increasing complexity. We run prodigy with these heuristics in a series of arti cial domains (in...

The aim of this paper is to propose a new particle swarm optimization algorithm to solve a hybrid flowshop scheduling with sequence-dependent setup times problem, which is of great importance in the industrial context. This algorithm is called diversified particle swarm optimization algorithm which is a generalization of particle swarm optimization algorithm and inspired by an anarchic society ...

K. N. Nandurkar, , K. V. Chandratre, ,

In today’s economy, manufacturing plants must be able to operate efficiently and respond quickly to changes in the product mix and demand.[1] Layout design has a significant impact on manufacturing efficiency. Initially, it was treated as a static decision but due to improvements in technology, it is possible to rearrange the manufacturing facilities in different scenarios. The Plant layout...

A. Yousefi, M. Shahrouzi ,

Meta-heuristics have already received considerable attention in various engineering optimization fields. As one of the most rewarding tasks, eigenvalue optimization of truss structures is concerned in this study. In the proposed problem formulation the fundamental eigenvalue is to be maximized for a constant structural weight. The optimum is searched using Particle Swarm Optimization, PSO and i...

A. Kaveh, Y. Vazirinia,

Tower cranes are major and expensive equipment that are extensively used at building construction projects and harbors for lifting heavy objects to demand points. The tower crane locating problem to position a tower crane and supply points in a building construction site for supplying all requests in minimum time, has been raised from more than twenty years ago. This problem has already been so...

2013
Marcela Quiroz-Castellanos Laura Cruz Reyes José Torres-Jiménez Claudia Gómez Santillán Héctor J. Fraire H. Patricia Melin

This work tries to promote the application of empirical techniques of analysis within computer science in order to construct models that explain the performance of heuristic algorithms for NP-hard problems. In this paper, we show the application of an experimental approach that combines exploratory data analysis and causal inference with the objective to explain the algorithmic optimization pro...

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

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