#### Filter Results:

- Full text PDF available (33)

#### Publication Year

2004

2017

- This year (1)
- Last 5 years (6)
- Last 10 years (26)

#### Publication Type

#### Co-author

#### Publication Venue

#### Key Phrases

Learn More

- Christian Blum, Jakob Puchinger, Günther R. Raidl, Andrea Roli
- Appl. Soft Comput.
- 2011

Research in metaheuristics for combinatorial optimization problems has lately experienced a noteworthy 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 problem-oriented. Nowadays the focus is on solving the problem… (More)

- Jakob Puchinger, Günther R. Raidl
- IWINAC
- 2005

In this survey we discuss different state-of-the-art approaches of combining exact algorithms and metaheuristics to solve combinatorial optimization problems. Some of these hybrids mainly aim at providing optimal solutions in shorter time, while others primarily focus on getting better heuristic solutions. The two main categories in which we divide the… (More)

- Jakob Puchinger, Günther R. Raidl, Gabriele Koller
- EvoCOP
- 2004

We consider the problem of finding two-dimensional cutting patterns for glass sheets in order to produce rectangular elements requested by customers. The number of needed sheets, and therefore the waste, is to be minimized. The cutting facility requires three-staged guil-lotineable cutting patterns, and in addition, a plan for loading produced elements on… (More)

- Jakob Puchinger, Günther R. Raidl, Ulrich Pferschy
- INFORMS Journal on Computing
- 2010

We study the multidimensional knapsack problem, present some theoretical and empirical results about its structure, and evaluate different Integer Linear Programming (ILP) based, metaheuristic, and collaborative approaches for it. We start by considering the distances between optimal solutions to the LP-relaxation and the original problem and then introduce… (More)

- Gerhard Hiermann, Jakob Puchinger, Stefan Ropke, Richard F. Hartl
- European Journal of Operational Research
- 2016

Due to new regulations and further technological progress in the field of electric vehicles, the research community faces the new challenge of incorporating the electric energy based restrictions into vehicle routing problems. One of these restrictions is the limited battery capacity which makes detours to recharging stations necessary, thus requiring… (More)

- Univ, Günther Raidl, Ao Univ, Ulrich Pferschy, Jakob Puchinger, Ii Kurzfassung

The main topic of this thesis is the combination of metaheuristics and integer programming based algorithms for solving two different cutting and packing problems, belonging to the class of N P-hard combinatorial optimization problems: A problem originating from the glass cutting industry, three-stage two-dimensional bin packing (2BP), and a problem first… (More)

The combination of components from different algorithms is currently one of the most successful trends in optimization. The hybridization of metaheuristics such as ant colony optimization, evolutionary algorithms, and variable neighborhood search with techniques from operations research and artificial intelligence plays hereby an important role. The… (More)

- Jakob Puchinger, Günther R. Raidl, Ulrich Pferschy
- EvoCOP
- 2006

We present the newly developed core concept for the Mul-tidimensional Knapsack Problem (MKP) which is an extension of the classical concept for the one-dimensional case. The core for the mul-tidimensional problem is defined in dependence of a chosen efficiency function of the items, since no single obvious efficiency measure is available for MKP. An… (More)

- Jakob Puchinger, Günther R. Raidl
- European Journal of Operational Research
- 2007

We consider the three-stage two-dimensional bin packing problem (2BP) which occurs in real-world applications such as glass, paper, or steel cutting. We present new integer linear programming formulations: Models for a restricted version and the original version of the problem are developed. Both involve polynomial numbers of variables and constraints only… (More)

- Günther R. Raidl, Jakob Puchinger
- Hybrid Metaheuristics
- 2008

Several different ways exist for approaching hard optimization problems. Mathematical programming techniques, including (integer) linear programming based methods, and metaheuristic approaches are two highly successful streams for combinatorial problems. These two have been established by different communities more or less in isolation from each other. Only… (More)