most citedRandomised Variable Neighbourhood Search for Multi Objective Optimisation

44 citations · 74 across the 10 of their papers we have counts for

collaborators
Showing cs.AIShow all

10 papers · 1 filter

cs.AI20081 cited

Variable Neighborhood Search for the University Lecturer-Student Assignment Problem

Martin Josef Geiger, Wolf Wenger

The paper presents a study of local search heuristics in general and variable neighborhood search in particular for the resolution of an assignment problem studied in the practical…

cs.AI20081 cited

MOOPPS: An Optimization System for Multi Objective Scheduling

Martin Josef Geiger

In the current paper, we present an optimization system solving multi objective production scheduling problems (MOOPPS). The identification of Pareto optimal alternatives or at lea…

cs.AI200811 cited

An application of the Threshold Accepting metaheuristic for curriculum based course timetabling

Martin Josef Geiger

The article presents a local search approach for the solution of timetabling problems in general, with a particular implementation for competition track 3 of the International Time…

cs.AI200810 cited

Bin Packing Under Multiple Objectives - a Heuristic Approximation Approach

Martin Josef Geiger

The article proposes a heuristic approximation approach to the bin packing problem under multiple objectives. In addition to the traditional objective of minimizing the number of b…

cs.AI20081 cited

Proposition of the Interactive Pareto Iterated Local Search Procedure - Elements and Initial Experiments

Martin Josef Geiger

The article presents an approach to interactively solve multi-objective optimization problems. While the identification of efficient solutions is supported by computational intelli…

cs.AI2008

Improving Local Search for Fuzzy Scheduling Problems

Martin Josef Geiger, Sanja Petrovic

The integration of fuzzy set theory and fuzzy logic into scheduling is a rather new aspect with growing importance for manufacturing applications, resulting in various unsolved asp…