نتایج جستجو برای: meta heuristics methods
تعداد نتایج: 2025748 فیلتر نتایج به سال:
The construction of good starting solutions for multi-start local search heuristics is an important, yet not well-studied problem. In these heuristics, randomization methods are usually applied to explore new promising areas and memory mechanisms are incorporated with the main purpose of reinforcing good solutions. Under the template of a typical multi-start metaheuristic, Meta-RaPS (Meta-heuri...
The obvious way to use several admissible heuristics in A∗ is to take their maximum. In this paper we aim to reduce the time spent on computing heuristics. We discuss Lazy A∗, a variant of A∗ where heuristics are evaluated lazily: only when they are essential to a decision to be made in the A∗ search process. We present a new rational meta-reasoning based scheme, rational lazy A∗, which decides...
Combining meta-heuristics with local search methods is one approach that recently has drawn much attention to design more efficient methods for solving continuous global optimization problems. In this paper, a new algorithm called Simplex Coding Genetic Algorithm (SCGA) is proposed by hybridizing genetic algorithm and simplexbased local search method called Nelder-Mead method. In the SCGA, each...
Taking into account competitive markets, manufacturers attend more customer’s personalization. Accordingly, build-to-order systems have been given more attention in recent years. In these systems, the customer is a very important asset for us and has been paid less attention in the previous studies. This paper introduces a new build-to-order problem in the supply chain. This study focuses on bo...
Hyper-heuristics are easy-to-implement emerging search and optimisation strategies which have been used instead of meta-heuristics for providing higher level generalized structures to solve mainly combinatorial optimisation problems. The motivation behind them is generally expressed as raising the level of generality. That is, they are the answers to the following question: How can we create or...
Aggregate production planning (APP) is one of the most important issues carried out in manufacturing environments which seeks efficient planning, scheduling and coordination of all production activities that optimizes the company's objectives. In this paper, we develop a mixed integer linear programming (MILP) model for an integrated aggregate production planning system with closed loop supply ...
The paper presents a simulation study of the usefulness of a number of meta-heuristics used as optimisation methods for TSP problems. The five considered approaches are outlined: Genetic Algorithm, Simulated Annealing, Ant Colony System, Tabu Search and Hopfield Neural Network. Using a purpose-developed computer program, efficiency of the meta-heuritics has been studied and compared. Results ob...
Here, a mixed-integer linear programming model is developed to represent transportation system of students traveling from/to university campus. The concept ridesharing used and the mechanism combinatorial auctions incorporated within routing-based model. mathematical based on vehicle routing problem along with appropriate constraints accommodating features that express auction clearing phase. A...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید