Sandro Pirkwieser

Recent Publications

Hybrid Metaheuristics and Matheuristics for Problems in Bioinformatics and Transportation
May 2012, PhD thesis, Vienna University of Technology, Institute of Computer Graphics and Algorithms.
Note: supervised by G.~R.~Raidl and K.~F.~Dörner
A Variable Neighborhood Search Approach for the Two-Echelon Location-Routing Problem
Evolutionary Computation in Combinatorial Optimisation – EvoCOP~2012 (J.-K. Hao and M. Middendorf), volume 7245 of LNCS, pages 13-24, 2012, Springer, Heidelberg.
Improved Packing and Routing of Vehicles with Compartments
Computer Aided Systems Theory – EUROCAST 2011: 13th International Conference, Las Palmas de Gran Canaria, Spain, February 6–11, 2011, Revised Selected Papers, Part I (R. Moreno-Díaz and others), volume 6927 of LNCS, pages 392-399, 2012, Springer.
Improved Packing and Routing of Vehicles with Compartments
Extended Abstracts of EUROCAST 2011 – 13th International Conference on Computer Aided Systems Theory (Alexis Quesada-Arencibia and others), pages 302-304, 2011.
Tackling the Loading Aspect of the Vehicle Routing Problem with Compartments
Proceedings of the 9th Metaheuristics International Conference (Luca Di~Gaspero and Andrea Schaerf and Thomas Stützle), pages 679-681, 2011.
Matheuristics for the Periodic Vehicle Routing Problem with Time Windows
Proceedings of Matheuristics 2010: Third International Workshop on Model-Based Metaheuristics, pages 83-95, 2010.
Multilevel Variable Neighborhood Search for Periodic Routing Problems
Evolutionary Computation in Combinatorial Optimisation – EvoCOP~2010 (Peter Cowling and Peter Merz), volume 6022 of LNCS, pages 226-238, 2010, Springer.
Variable Neighborhood Search Coupled with ILP-based Large Neighborhood Searches for the (Periodic) Location-Routing Problem
Hybrid Metaheuristics, 7th Int. Workshop, HM 2010 (M. J. Blesa and others), volume 6373 of LNCS, pages 174-189, 2010, Springer.
A Column Generation Approach for the Periodic Vehicle Routing Problem with Time Windows
Proceedings of the International Network Optimization Conference 2009 (Maria Grazia Scutellà and others), 2009.
MetaBoosting: Enhancing Integer Programming Techniques by Metaheuristics
Chapter in Matheuristics – Hybridizing Metaheuristics and Mathematical Programming (V. Maniezzo and T. Stützle and S. Voss), volume 10 of Annals of Information Systems, pages 71-102, 2009, Springer.
Note: previous technical report version at r̆lhttps://www.ac.tuwien.ac.at/files/pub/puchinger-09.pdf
A Lagrangian Decomposition/Evolutionary Algorithm Hybrid for the Knapsack Constrained Maximum Spanning Tree Problem
Chapter in Recent Advances in Evolutionary Computation for Combinatorial Optimization (C. Cotta and J. van~Hemert), volume 153 of Studies in Computational Intelligence, pages 69-85, 2008, Springer.
Note: previous technical report version at r̆lhttps://www.ac.tuwien.ac.at/files/pub/pirkwieser-07a.pdf
A Variable Neighborhood Search for the Periodic Vehicle Routing Problem with Time Windows
Proceedings of the 9th EU/MEeting on Metaheuristics for Logistics and Vehicle Routing (Caroline Prodhon and others), 2008.
Exact Methods and Metaheuristic Approaches for Deriving High Quality Fully Resolved Consensus Trees
BIRD'08, 2nd International Conference on Bioinformatics Research and Development, Poster Presentations (J. Küng and K. Schneider and R. Wagner), volume 26 of Schriftenreihe Informatik, pages 115-124, 2008, Trauner Verlag.
Finding Consensus Trees by Evolutionary, Variable Neighborhood Search, and Hybrid Algorithms
GECCO ‘08: Proceedings of the 10th Annual Conference on Genetic and Evolutionary Computation (Maarten Keijzer and others), pages 323-330, 2008, ACM.
A Lagrangian Decomposition/Evolutionary Algorithm Hybrid for the Knapsack Constrained Maximum Spanning Tree Problem
2007, Technical report TR 186-1-07-03, Institute of Computer Graphics and Algorithms, Vienna University of Technology.
Combining Lagrangian Decomposition with an Evolutionary Algorithm for the Knapsack Constrained Maximum Spanning Tree Problem
Evolutionary Computation in Combinatorial Optimization – EvoCOP~2007 (Carlos Cotta and Jano van~Hemert), volume 4446 of LNCS, pages 176-187, 2007, Springer.
A Lagrangian Decomposition Approach Combined with Metaheuristics for the Knapsack Constrained Maximum Spanning Tree Problem
October 2006, Master’s thesis, Vienna University of Technology, Institute of Computer Graphics and Algorithms.
Note: supervised by G.~Raidl and J.~Puchinger