Combinatorial Optimization Problems and Metaheuristics: Review, Challenges, Design, and Development

نویسندگان

چکیده

In the past few decades, metaheuristics have demonstrated their suitability in addressing complex problems over different domains. This success drives scientific community towards definition of new and better-performing heuristics results an increased interest this research field. Nevertheless, studies been focused on developing algorithms without providing consolidation existing knowledge. Furthermore, absence rigor formalism to classify, design, develop combinatorial optimization represents a challenge field’s progress. study discusses main concepts challenges area proposes code metaheuristics. We believe these contributions may support progress field increase maturity as problem solvers analogous other machine learning algorithms.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Metaheuristics for dynamic combinatorial optimization problems

Many real-world optimization problems are combinatorial optimization problems subject to dynamic environments. In such dynamic combinatorial optimization problems (DCOPs), the objective, decision variables and/or constraints may change over time, and so solving DCOPs is a challenging task. Metaheuristics are a good choice of tools to tackle DCOPs because many metaheuristics are inspired by natu...

متن کامل

Solving Combinatorial Optimization Problems via Reformulation and Adaptive Memory Metaheuristics

Metaheuristics — general search procedures whose principles allow them to escape the trap of local optimality using heuristic designs — have been successfully employed to address a variety of important optimization problems over the past few years. Particular gains have been achieved in obtaining high quality solutions to problems that classical exact methods (which guarantee convergence) have ...

متن کامل

Metaheuristics in Combinatorial Optimization

The emergence of metaheuristics for solving diÆcult combinatorial optimization problems is one of the most notable achievements of the last two decades in operations research. This paper provides an account of the most recent developments in the eld and identi es some common issues and trends. Examples of applications are also reported for vehicle routing and scheduling problems.

متن کامل

Hybrid metaheuristics in combinatorial optimization: A survey

Research inmetaheuristics for combinatorial optimizationproblemshas lately experienced anoteworthy shift towards the hybridization of metaheuristics with other techniques for optimization. At the same time, the focus of research has changed from being rather algorithm-oriented to being more problemoriented. Nowadays the focus is on solving the problem at hand in the best way possible, rather th...

متن کامل

Metaheuristics in Stochastic Combinatorial Optimization: a Survey

Metaheuristics such as Ant Colony Optimization, Evolutionary Computation, Simulated Annealing, Tabu Search and Stochastic Partitioning Methods are introduced, and their recent applications to a wide class of combinatorial optimization problems under uncertainty are reviewed. The flexibility of metaheuristics in being adapted to different modeling approaches and problem formulations emerges clea...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Applied sciences

سال: 2021

ISSN: ['2076-3417']

DOI: https://doi.org/10.3390/app11146449