|
|
Andrea Rendl |
contact |
Hello everybody!
Since September 2010 I work at the AIT Austrian Institute of Technology in Vienna as a researcher in the Mobility Department where I'm involved in optimizing various transportation and logistics problems. Current projects include for instance CARELOG (home healthcare scheduling) and TRIUMPH (container storage management).
Previously, I've been employed as postdoctoral researcher at the Unversity of St Andrews holding a PhD+ postdoctoral fellowship provided by EPSRC UK. My PhD project was supervised by Ian Miguel and Ian Gent (here's my thesis). I received my Bachelor's and Master's degree in Telematics at Graz University of Technology in Austria and spent several months at KTH Stockholm where I finished my Master Thesis under supervison of Christian Schulte.
I am member of the CP Pod research group and CIRCA.
Academic Activities
- Guest Editor of the Special Issue on Modeling and Reformulation of the Constraints Journal.
- PC member of ICAPS 2012
- Chair of ModRef 2011
- PC member of CP 2011's Doctoral Programme
- PC member of IJCAI 2011
- PC member of CPAIOR 2011
- PC member of ICAPS 2011
- PC member of ModRef 2010.
- Publicity Chair of CP 2010.
Publications
-
The Influence of Accurate Travel Times on a Home Health Care Scheduling Problem
Matthias Prandtstetter, Andrea Rendl and Jakob Puchinger, ODYSSEUS 2012, to appear -
Hybrid Heuristics for Multimodal Homecare Scheduling
Andrea Rendl, Matthias Prandtstetter, Gerhard Hiermann, Jakob Puchinger and Gunther Raidl,
CPAIOR 2012, to appear. -
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, ModRef 2010 -
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, in Proceedings of ModRef 2009, pp. 117-131 -
Common Subexpressions in Constraint Models of Planning Problems
Andrea Rendl, Ian Miguel, Ian P. Gent and Peter Gregory, pp128-135, in SARA 2009, AAAI Press. -
Enhancing Constraint Model Instances during Tailoring
Andrea Rendl, Ian Miguel, Ian P. Gent and Chris Jefferson, pp120-127, in SARA 2009, AAAI Press. - A Constraint Model for the Settlers Planning Domain
Peter Gregory and Andrea Rendl, at PLANSIG 2008, pp41-49, 2008. - Constraint Model Enhancement by Common Subexpression Elimination
Andrea Rendl, Ian P. Gent and Ian Miguel.
Proceedings of the Doctoral Consortium at CP 2008 , pp72-78, 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.
- Reformulation during Automated Constraint Modelling
Andrea Rendl, Ian P. Gent, Ian Miguel. Doctoral Programme of CP 2007, pp139-145, 2007. - Tailoring Solver-independent Constraint Models: A Case Study with Essence' and Minion
Ian P. Gent, Ian Miguel, Andrea Rendl. Proceedings of SARA 2007, pp184-199, 2007.
Software
I've been the developper and maintainer of Tailor,
an interactive modelling tool that compiles and enhances
constraint problems formulated in solver-independent constraint modelling languages to solver
input. More specifically, it translates models formulated in either
Essence'
or XML format XCSP 2.1
to input of the two solvers
Minion (text format)
and Gecode(C++) (translation to the latter is restricted), and
also targets
the low-level language FlatZinc.
In its most recent release, Tailor can execute the target solver in the graphical user
interface, and returns the solutions directly from the solver, which facilitates modelling and
solving, especially for novices to Constraint Programming.
To get started with Tailor, have a look
at Tailor's website that contains an
extensive set of
Essence' examples.
There is also a detailed tutorial [pdf]
(from the ACP Summer School 2008)
on how to use Tailor and model with Essence'.
Tailor is available as Java binary
and can be obtained for free. Tailor's source code has been removed from Minion's public svn repository, but
if you are interested in the source code, then drop me an email.
Activities
- 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: January 19, 2012