نتایج جستجو برای: metaheuristics
تعداد نتایج: 2114 فیلتر نتایج به سال:
Abstract The most crucial function in drilling wells is the rate of penetration, which modeled by many researchers, and best one Young-Bourgyen model, used this study. Eight factors affecting penetration have been studied approved developing a mathematical equation that shows combined effects these variables on optimization. This paper presents an efficient way to find optimum values for parame...
The multiple depot vehicle scheduling problem (MDVSP) is a well-known and important problem arising in public transport. Although many solution approaches have been published in the literature, algorithms using metaheuristics appeared only very recently (Large Neighborhood Search and Tabu Search). In this paper, we introduce an Iterated Local Search algorithm for the MDVSP, incorporating a neig...
Flexibility has become an important priority in the formulation and implementation of manufacturing strategies. This in turn has opened up a new class of design problems for such systems. Flexible assembly systems (FAS), consisting of a variety of processors and operations, provide the opportunity for improving product manufacturing flexibility, hence gaining competitive advantages. This paper ...
Metaheuristic algorithms are often nature-inspired, and they are becoming very powerful in solving global optimization problems. More than a dozen of major metaheuristic algorithms have been developed over the last three decades, and there exist even more variants and hybrid of metaheuristics. This paper intends to provide an overview of nature-inspired metaheuristic algorithms, from a brief hi...
Electronic embedded systems designers aim at finding a tradeoff between cost and power consumption. As cache memory management has been shown to have a significant impact on power consumption, this paper addresses dynamic memory allocation for embedded systems with a special emphasis on time performance. In this work, time is split into time intervals, into which the application to be implement...
Parallel implementations of metaheuristics appear quite naturally as an effective alternative to speed up the search for approximate solutions of combinatorial optimization problems. They not only allow solving larger problems or finding improved solutions with respect to their sequential counterparts, but they also lead to more robust algorithms. We review some trends in parallel computing and...
In scheduling theory, minimizing the weighted number of late jobs in the general case (non-equal release dates) is an objective function usually used as a performance indicator. This paper presents several approaches for the NP-Hard parallel machine scheduling problem, including two MILP formulations for exact resolution and various heuristics and metaheuristics to solve large size instances. A...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید