نتایج جستجو برای: meta heuristic search

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

The problem of the distribution of dairy products, which is classified as a combinatorial optimization problem, cannot be solved in polynomial time. In this paper, an algorithm based on Ant Colony Hybrid meta-heuristic system and Geographic Information System (GIS) was used to find a near-optimal solution to this problem. Using the former method, the nearest neighbor heuristic algorithm was use...

Journal: :European Journal of Operational Research 2001
E. Hopper B. C. H. Turton

In this paper we consider the two-dimensional rectangular packing problem, where a fixed set of items have to be allocated on a single object. Two heuristics, which belong to the class of packing procedures that preserve bottom-left stability, are hybridised with three meta-heuristic algorithms (genetic algorithms, simulated annealing, naïve evolution) and local search heuristic (hill-climbing)...

Journal: :Journal of advances in mathematics and computer science 2021

Meta-heuristic techniques are important as they used to find solutions computationally intractable problems. Simplistic methods such exhaustive search become expensive and unreliable the solution space for algorithms increase. As no method is guaranteed perform better than all others in classes of optimization problems, there a need constantly new and/or adapt old algorithms. This research prop...

A. Kaveh, N. Khodadadi, S. Talatahari,

In this article, an Advanced Charged System Search (ACSS) algorithm is applied for the optimum design of steel structures. ACSS uses the idea of Opposition-based Learning and Levy flight to enhance the optimization abilities of the standard CSS. It also utilizes the information of the position of each charged particle in the subsequent search process to increase the convergence speed. The objec...

2003
Gareth Beddoe Sanja Petrovic

Classical meta-heuristic methods for solving rostering problems focus on defining measures of roster quality. Here we present a new case-based reasoning approach to generating repairs of hard constraint violations using expert-human experience. This approach is used to guide heuristic constraint satisfaction algorithms, eliminating the need to explicitly define search objectives.

A. Foroughi-Asl, S. Delir, S. Talatahari,

Water distribution networks are one of the important and costly infrastructures of cities and many meta-heuristic algorithms in standard or hybrid forms were used for optimizing water distribution networks. These algorithms require a large amount of computational cost. Therefore, the converging speed of algorithms toward the optimization goal is as important as the goal itself. In this paper, a...

Optimization of the complete manufacturing and supply process has become a critical ingredient for gaining a competitive advantage. This article provides a unified mathematical framework for modeling manufacturing cell configuration and raw material supplier selection in a two-level supply chain network. The commonly used manufacturing design parameters along with supplier selection and a subco...

E. Salajegheh, R. Kamyab ,

This paper presents an efficient meta-heuristic algorithm for optimization of double-layer scallop domes subjected to earthquake loading. The optimization is performed by a combination of harmony search (HS) and firefly algorithm (FA). This new algorithm is called harmony search firefly algorithm (HSFA). The optimization task is achieved by taking into account geometrical and material nonlinear...

ژورنال: محاسبات نرم 2013
رحیمی نسب, مجید, رضایی نژاد, مهدی, موسوی, سید عبدالمجید,

At the present, energy aware routing is one of the most important research topics in wireless sensor networks. Increasing network lifetime is the most challenging need in these networks. In this study, in order to increase network lifetime, we aim to introduce a harmony search algorithm as a successful meta-heuristic algorithm for routing in the wireless sensor networks. In customizing the algo...

2003
Deji Fatiregun Mark Harman Robert M. Hierons

Program Transformations are generally written in order to generate better programs. In transformations, we apply a number of simple transformation axioms to parts of a program source code to obtain a functionally equivalent program. The application of these axioms is treated as a search problem and we apply a meta–heuristic search algorithm such as hill climbing to guide the direction of the se...

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

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