نتایج جستجو برای: metaheuristic

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

2014
S. Kazemzadeh Azad O. Hasançebi

Computational cost of metaheuristic based optimum design algorithms grows excessively with structure size. This results in computational inefficiency of modern metaheuristic algorithms in tackling optimum design problems of large scale structural systems. This paper attempts to provide a computationally efficient optimization tool for optimum design of large scale steel frame structures to AISC...

2004
Mauro Birattari

This paper discusses the problem of estimating, on the basis of a given number of say N experiments, the expected performance of a metaheuristic on a class I of benchmark problem instances. The problem of the empirical estimation of the expected behavior of a stochastic optimization algorithm has great relevance both in academic studies and in practical applications. This is particularly true f...

2013
Olivier Sobrie Vincent Mousseau Marc Pirlot

Learning the parameters of a Majority Rule Sorting model (MR-Sort) through linear programming requires to use binary variables. In the context of preference learning where large sets of alternatives and numerous attributes are involved, such an approach is not an option in view of the large computing times implied. Therefore, we propose a new metaheuristic designed to learn the parameters of an...

2012
Maria P. Tzamtzi Fotis N. Koumboulis

We propose a control design scheme that aims to prevent undesirable liquid outpouring and suppress sloshing during the forward and backward tilting phases of the pouring process, for the case of liquid containers carried by manipulators. The proposed scheme combines a partial inverse dynamics controller with a PID controller, tuned with the use of a “metaheuristic” search algorithm. The “metahe...

Journal: :journal of optimization in industrial engineering 2010
majid khalili mohammad jafar tarokh bahman naderi

this paper studies the multi-stage supply chain system (msscm) controlled by the kanban mechanism. in the kanban system, decision making is based on the number of kanbans as well as batch sizes. a kanban mechanism is employed to assist in linking different production processes in a supply chain system in order to implement the scope of just-in-time (jit) philosophy. for a msscm, a mixed-integer...

This paper studies the multi-stage supply chain system (MSSCM) controlled by the kanban mechanism. In the kanban system, decision making is based on the number of kanbans as well as batch sizes. A kanban mechanism is employed to assist in linking different production processes in a supply chain system in order to implement the scope of just-in-time (JIT) philosophy. For a MSSCM, a mixed-integer...

2013
Yuksel Celik Erkan Ulker

Marriage in honey bees optimization (MBO) is a metaheuristic optimization algorithm developed by inspiration of the mating and fertilization process of honey bees and is a kind of swarm intelligence optimizations. In this study we propose improved marriage in honey bees optimization (IMBO) by adding Levy flight algorithm for queen mating flight and neighboring for worker drone improving. The IM...

1997
Bernd Bullnheimer Richard F. Hartl Christine Strauss

The Ant System is a distributed metaheuristic that combines an adaptive memory with a local heuristic function to repeatedly construct solutions of hard combina-torial optimization problems. We present in this paper an improved ant system algorithm for the Vehicle Routing Problem with one central depot and identical vehicles. Computational results on fourteen benchmark problems from the literat...

2014
Ali Kaveh Seyed Mohammad Javadi

In this paper a metaheuristic algorithm composed of particle swarm, ray optimization, and harmony search (HRPSO) is presented for optimal design of truss structures. This algorithm is based on the particle swarm ray origin making is used to update the positions of the particles, and for enhancing the exploitation of the algorithm the harmony search is utilized. Numerical results demonstrate the...

2009
Zhipeng Lü Fred Glover Jin-Kao Hao

Using the Unconstrained Binary Quadratic Programming (UBQP) problem as a case study, we present an experimental analysis of neighborhood combinations for local search based metaheuristic algorithms. In this work, we use one-flip and two-flip moves and investigate combined neighborhoods with these two moves within two metaheuristic algorithms. The goal of the analysis is to help understand why a...

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

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