4,349 research outputs found
Generalizing backdoors
Abstract. A powerful intuition in the design of search methods is that one wants to proactively select variables that simplify the problem instance as much as possible when these variables are assigned values. The notion of “Backdoor ” variables follows this intuition. In this work we generalize Backdoors in such a way to allow more general classes of sub-solvers, both complete and heuristic. In order to do so, Pseudo-Backdoors and Heuristic-Backdoors are formally introduced and then applied firstly to a simple Multiple Knapsack Problem and secondly to a complex combinatorial optimization problem in the area of stochastic inventory control. Our preliminary computational experience shows the effectiveness of these approaches that are able to produce very low run times and — in the case of Heuristic-Backdoors — high quality solutions by employing very simple heuristic rules such as greedy local search strategies.
Recommended from our members
A survey on portfolio optimisation with metaheuristics.
A portfolio optimisation problem involves allocation
of investment to a number of different assets to maximize return
and minimize risk in a given investment period. The selected
assets in a portfolio not only collectively contribute to its return
but also interactively define its risk as usually measured by a
portfolio variance. This presents a combinatorial optimisation
problem that involves selection of both a number of assets as well
as its quantity (weight or proportion or units). The problem is
extremely complex due to a large number of selectable assets.
Furthermore, the problem is dynamic and stochastic in nature
with a number of constraints presenting a complex model which is
difficult to solve for exact solution. In the last decade research
publications have reported the applications of
metaheuristic-based optimisation methods with some success.,
This paper presents a review of these reported models,
optimisation problem formulations and metaheuristic approaches
for portfolio optimisation
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
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
- …