andrea.rendl at gmail.com
andrea.rendl at aau.at
I'm a researcher at the University of Klagenfurt in Austria, and work for Satalia, a company specialized in solutions for optimisation problems in
transportation, scheduling and planning.
My main research interest lies in combinatorial optimisation, in particular constraint programming, constraint modelling and reformulation, as well as hybrid (heuristic) optimization approaches.
Previously, I was a researcher in NICTA's
Optimization Group and adjunct research fellow at Monash University in Melbourne, Australia.
Before that, I held a research position at the Austrian Institute of Technology in Vienna, Austria, where I worked
on optimizing real-world applications from transportation and logistics.
I received my PhD in Computer Science from the University of St Andrews, UK in 2010 under supervision of
Ian Miguel and Ian Gent.
Before that, I did my MSc and BSc at Graz, University of Technology, Austria in Telematics and spent
some semesters as an exchange student at KTH Stockholm in Sweden.
I was also a teaching assistant for Pascal van Hentenryck's Coursera course on
Discrete Optimization, as well as for
Peter Stuckey's Coursera course on
Modeling Discrete Optimisation.
- I'm one of the contributing developers of MiniZinc 2.0, a language for modelling and solving
mathematical problems. MiniZinc 2.0 is an open-source C++ library and easy to hook up with
different solvers. Check out MiniZinc's website for more details.
- I'm the main developer of MiniSearch, a meta-search language for MiniZinc.
Check out the MiniSearch webpage at http://www.minizinc.org/minisearch for more details.
- I'm the main developer of Stochastic MiniZinc, an extension of MiniZinc.
Stochastic MiniZinc allows you to formulate and solve optimisation problems with uncertainty.
Currently, there is an alpha release avalaible at: http://www.minizinc.org/stochastic.
- CP approaches for Balancing Bike Sharing Systems (BBSS): Constraint Programming based exact and hybrid
metaheuristics (Ant Colony Optimisation and Large Neighbourhood Search) for solving the BBSS problem using the CP solver Gecode.
Collaboration with Luca di Gaspero and
Tommaso Urli. The resources are available at:
https://bitbucket.org/alt-optimization and includes
- Code of all our approaches for Gecode (in C++)
- Problem instances
- Instance generator
- Tailor is an automated modelling and solving tool for the modelling language Essence' and CP solver Minion. I implemented Tailor during my PhD. It is currently no
longer maintained, but its successor Savile Row is. Check out Hakank's Tailor/Savile Row page with several Essence' examples.
MiniSearch: a solver-independent meta-search language for MiniZinc
Andrea Rendl, Tias Guns, Peter J. Stuckey and Guido Tack.
CP 2015, pp.376-392, pre-print.
Balancing Bike Sharing Systems with Constraint Programming
Luca di Gaspero, Andrea Rendl and Tommaso Urli
accepted at the Constraints Journal in February 2015, pre-print.
Metaheuristics for the Two-Dimensional Container Pre-Marshalling Problem
Alan Tus, Andrea Rendl and Günther R. Raidl
LION 2015, pp.186-201, January 2015, pre-print.
Modelling RTP-based Residential Load Scheduling for Demand Response in Smart Grids
Shan He, Ariel Liebman, Andrea Rendl, Mark Wallace, Campbell Wilson
ModRef-2014, pp.36-51, September 2014, pre-print.
Andrea Rendl, Guido Tack and Peter J. Stuckey
CP 2014, pp.636-645, September 2014, pre-print.
Constraint Models for the Container Pre-Marshaling Problem
Andrea Rendl and Matthias Prandtstetter
in the Proceedings of
ModRef 2013, pp. 44-56.
Constraint-based Approaches for Balancing Bike Sharing Systems
Luca Di Gaspero, Andrea Rendl, and Tommaso Urli
in CP 2013, pp. 758-773.
Metaheuristics for Solving a Multimodal Home-Healthcare Scheduling Problem
Gerhard Hiermann, Matthias Prandtstetter, Andrea Rendl, Jakob Puchinger, Günther R. Raidl
in Central European Journal on Operations Research, accepted
A Hybrid ACO+CP for Balancing Bicycle Sharing Systems
Luca Di Gaspero, Andrea Rendl, and Tommaso Urli
in Hybrid Metaheuristics 2013, pp. 198-212 (pre-print).
Metaheuristics for solving a multimodal home-health care scheduling problem.
Gerhard Hiermann, Andrea Rendl, Matthias Prandtstetter, Jakob Puchinger, and Günther R. Raidl
in Proceedings of the
2nd Workshop on Young Academics' Management Science (YAMS), 2012.
The Influence of Accurate Travel Times on a Home Health Care Scheduling Problem
Matthias Prandtstetter, Andrea Rendl and Jakob Puchinger,
Hybrid Heuristics for Multimodal Homecare Scheduling
Andrea Rendl, Matthias Prandtstetter, Gerhard Hiermann, Jakob Puchinger and Gunther Raidl,
CPAIOR 2012, pp. 339-355 .
Multimodal Home Healthcare Scheduling using a novel CP–VND–DP Approach
Andrea Rendl, Matthias Prandtstetter, Jakob Puchinger
Late Abstract at CPAIOR 2011.
Optimising Quantified Expressions in Constraint Models
Ian Gent, Ian Miguel, Andrea Rendl
Effective Compilation of Constraint Models
Andrea Rendl, PhD Thesis, January 2010
The Cost of Flattening with Common Subexpression Elimination
Andrea Rendl, Ian Miguel and Ian P. Gent
pp. 117-131 in Proceedings of ModRef 2009.
Common Subexpressions in Constraint Models of Planning Problems
Andrea Rendl, Ian Miguel, Ian P. Gent and Peter Gregory
pp. 128-135, in SARA 2009, AAAI Press.
Enhancing Constraint Model Instances during Tailoring
Andrea Rendl, Ian Miguel, Ian P. Gent and Chris Jefferson
pp. 120-127 in SARA 2009, AAAI Press.
A Constraint Model for the Settlers Planning Domain
Peter Gregory and Andrea Rendl
pp. 41-49 in PLANSIG 2008.
Common Subexpression Elimination in Automated Constraint Modelling
Ian P. Gent, Ian Miguel and Andrea Rendl
Proceedings of the
Workshop on Modeling and Solving Problems with Constraints
, pp24-30, 2008.
Tailoring Solver-independent Constraint Models: A Case Study with Essence' and Minion
Ian P. Gent, Ian Miguel, Andrea Rendl
pp. 184-199 in Proceedings of
- CP 2014, September 2014, Lyon, France.
- CP 2013, September 2013, Uppsala, Sweden.
- ORP3 2012, July 2012, Linz, Austria.
- CPAIOR 2012, May 2012, Nantes, France.
- CP 2011
September 2011, Perugia, Italy.
- CPAIOR 2011
May 2011, Berlin, Germany.
- CP 2010
16th Conference on Principles and Practice of Constraint Programming, September 2010, St Andrews, UK.
- CP 2009
15th Conference on Principles and Practice of Constraint Programming, September 2009, Lisbon, Portugal.
- SARA 2009,
8th Symposium on Abstraction, Reformulation and Approximation, July 2009, Lake Arrowhead, California.
- PLANSIG 2008,
The 27th Workshop on Planning and Scheduling Special Interest Group
December 2008, Edinburgh, UK
- CP 2008
14th Conference on Principles and Practice of Constraint Programming, September 2008, Sydney, Australia
- ECAI 2008
18th European Conference on Artificial Intelligence, July 2008, Patras, Greece
- ACP Summer School 2008
July 2008, St Andrews, UK
- CP 2007
13th Conference on Principles and Practice of Constraint Programming, September 2007, Providence, USA
- AAAI 2007
22nd Conference on Artificial Intelligence, July 2007, Vancouver, Canada
- SARA 2007
7th Symposium on Abstraction, Reformulation and Approximation, July 2007, Whistler, Canada
- ACP Summer School
Third International Summer School on Constraint Programming, June 2007, Lloret del Mar, Spain
- International Symmetry Conference
January 2007, Edinburgh, UK
- CP 2006
12th Conference on Principles and Practice of Constraint Programming, September 2006, Nantes, France
last modified: November 17, 2016