Dennis Weyland IDSIA - Room F205 Galleria 2 6928 Manno - Lugano Switzerland - CH   Email: dennis (at) idsia.ch

About me

Since August 2008 I am a PhD student at IDSIA working on the project New sampling-based Metaheuristics for Stochastic Vehicle Routing Problems. My supervisors are Luca Maria Gambardella and Leonora Bianchi.

My main research interests are randomised search heuristics and complexity theory.

Short CV

• Since 08/08: PhD student at IDSIA
• 01/07 - 07/08: Scientific staff member / Research assistant at the FernUniversitaet in Hagen
• Since 10/04: Mathematics studies at the University of Dortmund / FernUniversitaet in Hagen
• 10/02 - 11/06: Computer Science Diploma at the University of Dortmund

Publications

Journal Articles

• Dennis Weyland, Roberto Montemanni, Luca Maria Gambardella (to appear): A Metaheuristic Framework for Stochastic Combinatorial Optimization Problems based on GPGPU with a Case Study on the Probabilistic Traveling Salesman Problem with Deadlines. Journal of Parallel and Distributed Computing
• Luca Maria Gambardella, Roberto Montemanni, Dennis Weyland (to appear): Coupling Ant Colony Systems with strong Local Searches. European Journal of Operational Research, to appear.
• Dennis Weyland (2010): A Rigorous Analysis of the Harmony Search Algorithm - How the Research Community can be misled by a "novel" Methodology. International Journal of Applied Metaheuristic Computing, volume 1-2, April-June 2010, pages 50-60. [pdf document]
• Thomas Jansen and Dennis Weyland: Analysis of Evolutionary Algorithms for the Longest Common Subsequence Problem. Algorithmica (2010), volume 57-1, pages 170-186.

Conference Papers

• Dennis Weyland, Roberto Montemanni, Luca Maria Gambardella (to appear): Hardness Results for the Probabilistic Traveling Salesman Problem with Deadlines. Proceedings of ISCO 2012 - The 2nd International Symposium on Combinatorial Optimization, to appear.
• Dennis Weyland, Roberto Montemanni, Luca Maria Gambardella (2011): Using Statistical Tests for improving state-of-the-art Heuristics for the Probabilistic Traveling Salesman Problem with Deadlines. 13th International Conference on Computer Aided Systems Theory (Eurocast 2011). Lecture Notes in Computer Science, volume 6927, pages 448-455.
• Roberto Montemanni, Dennis Weyland and Luca Maria Gambardella (2011): An Enhanced Ant Colony System for the Team Orienteering Problem with Time Windows. Proceedings of IEEE ISCCS 2011 - The 2011 International Symposium on Computer Science and Society, pages 381-384.
• Luca Maria Gambardella, Roberto Montemanni, Dennis Weyland (2011): An Enhanced Ant Colony System for the Sequential Ordering Problem. Proceedings of OR 2011 - International Conference on Operations Research, Zurich, Switzerland.
• Dennis Weyland, Leonora Bianchi and Luca Maria Gambardella (2009): New Heuristics for the Probabilistic Traveling Salesman Problem. Proceedings of the VIII Metaheuristic International Conference (MIC 2009). To appear. [pdf document, results for the local search algorithms, results for the rrls/ils algorithms]
• Dennis Weyland, Leonora Bianchi and Luca Maria Gambardella (2009): New Approximation-based Local Search Algorithms for the Probabilistic Traveling Salesman Problem. 12th International Conference on Computer Aided Systems Theory (Eurocast 2009). Lecture Notes in Computer Science, volume 5717, pages 681-688. [pdf document, results for the local search algorithms]
• Dennis Weyland (2008): Simulated Annealing, its Parameter Settings and the Longest Common Subsequence Problem. Proceedings of the Genetic and Evolutionary Computation Conference (GECCO 2008). ACM Press, New York, NY, pages 803-810.
• Thomas Jansen and Dennis Weyland (2007): Analysis of Evolutionary Algorithms for the Longest Common Subsequence Problem. Proceedings of the Genetic and Evolutionary Computation Conference (GECCO 2007). ACM Press, New York, NY, pages 939-946.

Diploma Thesis

• Dennis Weyland (2006): Analyse von Evolutionaeren Algorithmen fuer das Longest Common Subsequence Problem. University of Dortmund