2,100 research outputs found
Current Trends in Simheuristics: from smart transportation to agent-based simheuristics
Simheuristics extend metaheuristics by adding a
simulation layer that allows the optimization component to deal
efficiently with scenarios under uncertainty. This presentation
reviews both initial as well as recent applications of simheuristics,
mainly in the area of logistics and transportation. We also discuss
a novel agent-based simheuristic (ABSH) approach that combines simheuristic and multi-agent systems to efficiently solve stochastic combinatorial optimization problems. The presentation is based on papers [1], [2], and [3], which have been already accepted in the prestigious Winter Simulation Conference.Peer ReviewedPostprint (published version
Recommended from our members
Combinatorial optimization and metaheuristics
Today, combinatorial optimization is one of the youngest and most active areas of discrete mathematics. It is a branch of optimization in applied mathematics and computer science, related to operational research, algorithm theory and computational complexity theory. It sits at the intersection of several fields, including artificial intelligence, mathematics and software engineering. Its increasing interest arises for the fact that a large number of scientific and industrial problems can be formulated as abstract combinatorial optimization problems, through graphs and/or (integer) linear programs. Some of these problems have polynomial-time (“efficient”) algorithms, while most of them are NP-hard, i.e. it is not proved that they can be solved in polynomial-time. Mainly, it means that it is not possible to guarantee that an exact solution to the problem can be found and one has to settle for an approximate solution with known performance guarantees. Indeed, the goal of approximate methods is to find “quickly” (reasonable run-times), with “high” probability, provable “good” solutions (low error from the real optimal solution). In the last 20 years, a new kind of algorithm commonly called metaheuristics have emerged in this class, which basically try to combine heuristics in high level frameworks aimed at efficiently and effectively exploring the search space. This report briefly outlines the components, concepts, advantages and disadvantages of different metaheuristic approaches from a conceptual point of view, in order to analyze their similarities and differences. The two very significant forces of intensification and diversification, that mainly determine the behavior of a metaheuristic, will be pointed out. The report concludes by exploring the importance of hybridization and integration methods
A survey on metaheuristics for stochastic combinatorial optimization
Metaheuristics are general algorithmic frameworks, often nature-inspired, designed to solve complex optimization problems, and they are a growing research area since a few decades. In recent years, metaheuristics are emerging as successful alternatives to more classical approaches also for solving optimization problems that include in their mathematical formulation uncertain, stochastic, and dynamic information. In this paper metaheuristics such as Ant Colony Optimization, Evolutionary Computation, Simulated Annealing, Tabu Search and others are introduced, and their applications to the class of Stochastic Combinatorial Optimization Problems (SCOPs) is thoroughly reviewed. Issues common to all metaheuristics, open problems, and possible directions of research are proposed and discussed. In this survey, the reader familiar to metaheuristics finds also pointers to classical algorithmic approaches to optimization under uncertainty, and useful informations to start working on this problem domain, while the reader new to metaheuristics should find a good tutorial in those metaheuristics that are currently being applied to optimization under uncertainty, and motivations for interest in this fiel
A survey on financial applications of metaheuristics
Modern heuristics or metaheuristics are optimization algorithms that have been increasingly used during the last decades to support complex decision-making in a number of fields, such as logistics and transportation, telecommunication networks, bioinformatics, finance, and the like. The continuous increase in computing power, together with advancements in metaheuristics frameworks and parallelization strategies, are empowering these types of algorithms as one of the best alternatives to solve rich and real-life combinatorial optimization problems that arise in a number of financial and banking activities. This article reviews some of the works related to the use of metaheuristics in solving both classical and emergent problems in the finance arena. A non-exhaustive list of examples includes rich portfolio optimization, index tracking, enhanced indexation, credit risk, stock investments, financial project scheduling, option pricing, feature selection, bankruptcy and financial distress prediction, and credit risk assessment. This article also discusses some open opportunities for researchers in the field, and forecast the evolution of metaheuristics to include real-life uncertainty conditions into the optimization problems being considered.This work has been partially supported by the Spanish Ministry of Economy and Competitiveness
(TRA2013-48180-C3-P, TRA2015-71883-REDT), FEDER, and the Universitat Jaume I mobility program
(E-2015-36)
Parallel Hybrid Trajectory Based Metaheuristics for Real-World Problems
G. Luque, E. Alba, Parallel Hybrid Trajectory Based Metaheuristics for Real-World Problems, In Proceedings of Intelligent Networking and Collaborative Systems, pp. 184-191, 2-4 September, 2015, Taipei, Taiwan, IEEE PressThis paper proposes a novel algorithm combining path relinking with a set of cooperating trajectory based parallel algorithms to yield a new metaheuristic of enhanced search features. Algorithms based on the exploration of the neighborhood of a single solution, like simulated annealing (SA), have offered accurate results for a large number of real-world problems in the past. Because of their trajectory based nature, some advanced models such as the cooperative one are competitive in academic problems, but still show many limitations in addressing large scale instances. In addition, the field of parallel models for trajectory methods has not deeply been studied yet (at least in comparison with parallel population based models). In this work, we propose a new hybrid algorithm which improves cooperative single solution techniques by using path relinking, allowing both to reduce the global execution time and to improve the efficacy of the method. We applied here this new model using a large benchmark of instances of two real-world NP-hard problems: DNA fragment assembly and QAP problems, with competitive results.Universidad de Málaga. Campus de Excelencia Internacional Andalucía Tech
Stochastic local search: a state-of-the-art review
The main objective of this paper is to provide a state-of-the-art review, analyze and discuss stochastic local search techniques used for solving hard combinatorial problems. It begins with a short introduction, motivation and some basic notation on combinatorial problems, search paradigms and other relevant features of searching techniques as needed for background. In the following a brief overview of the stochastic local search methods along with an analysis of the state-of-the-art stochastic local search algorithms is given. Finally, the last part of the paper present and discuss some of the most latest trends in application of stochastic local search algorithms in machine learning, data mining and some other areas of science and engineering. We conclude with a discussion on capabilities and limitations of stochastic local search algorithms
Local Optimal Sets and Bounded Archiving on Multi-objective NK-Landscapes with Correlated Objectives
The properties of local optimal solutions in multi-objective combinatorial
optimization problems are crucial for the effectiveness of local search
algorithms, particularly when these algorithms are based on Pareto dominance.
Such local search algorithms typically return a set of mutually nondominated
Pareto local optimal (PLO) solutions, that is, a PLO-set. This paper
investigates two aspects of PLO-sets by means of experiments with Pareto local
search (PLS). First, we examine the impact of several problem characteristics
on the properties of PLO-sets for multi-objective NK-landscapes with correlated
objectives. In particular, we report that either increasing the number of
objectives or decreasing the correlation between objectives leads to an
exponential increment on the size of PLO-sets, whereas the variable correlation
has only a minor effect. Second, we study the running time and the quality
reached when using bounding archiving methods to limit the size of the archive
handled by PLS, and thus, the maximum size of the PLO-set found. We argue that
there is a clear relationship between the running time of PLS and the
difficulty of a problem instance.Comment: appears in Parallel Problem Solving from Nature - PPSN XIII,
Ljubljana : Slovenia (2014
Accelerated Particle Swarm Optimization and Support Vector Machine for Business Optimization and Applications
Business optimization is becoming increasingly important because all business
activities aim to maximize the profit and performance of products and services,
under limited resources and appropriate constraints. Recent developments in
support vector machine and metaheuristics show many advantages of these
techniques. In particular, particle swarm optimization is now widely used in
solving tough optimization problems. In this paper, we use a combination of a
recently developed Accelerated PSO and a nonlinear support vector machine to
form a framework for solving business optimization problems. We first apply the
proposed APSO-SVM to production optimization, and then use it for income
prediction and project scheduling. We also carry out some parametric studies
and discuss the advantages of the proposed metaheuristic SVM.Comment: 12 page
- …