Dennis Weyland

IDSIA - Istituto Dalle Molle di Studi sull'Intelligenza Artificiale
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 Roberto Montemanni.
    My main research interests are stochastic combinatorial optimization, randomized search heuristics and computational complexity.

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): Heuristics for the Probabilistic Traveling Salesman Problem with Deadlines based on quasi-parallel Monte Carlo Sampling. Computers and Operations Research, to appear
  • Dennis Weyland, Matteo Salani, Roberto Montemanni, Luca Maria Gambardella (2013): Vehicle Routing for Exhausted Oil Collection. Journal of Traffic and Logistics Engineering, volume 1(1), pages 5-8
  • Dennis Weyland, Roberto Montemanni, Luca Maria Gambardella (2013): 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, volume 73(1), pages 74-85
  • Luca Maria Gambardella, Roberto Montemanni, Dennis Weyland (2012): Coupling Ant Colony Systems with strong Local Searches. European Journal of Operational Research, volume 220(3), pages 831-843.
  • 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), pages 50-60. [pdf document]
  • Thomas Jansen and Dennis Weyland (2010): Analysis of Evolutionary Algorithms for the Longest Common Subsequence Problem. Algorithmica, volume 57(1), pages 170-186.

Conference Proceedings

  • Dennis Weyland, Roberto Montemanni and Luca Maria Gambardella (2013): An Improved Heuristic for the Probabilistic Traveling Salesman Problem with Deadlines based on GPGPU. 14th International Conference on Computer Aided Systems Theory (Eurocast 2013). Lecture Notes in Computer Science, to appear.
  • Dennis Weyland, Roberto Montemanni and Luca Maria Gambardella (2013): Convergence Results for Vehicle Routing Problems with Stochastic Demands. 3rd Annual International Conference on Operations Research and Statistics (ORS 2013), to appear.
  • Dennis Weyland, Roberto Montemanni, Luca Maria Gambardella (2012): An Enhanced Ant Colony System for the Probabilistic Traveling Salesman Problem. Proceedings of Bionetics 2012, to appear
  • Dennis Weyland, Roberto Montemanni, Luca Maria Gambardella (2012): Hardness Results for the Probabilistic Traveling Salesman Problem with Deadlines. Proceedings of ISCO 2012 - The 2nd International Symposium on Combinatorial Optimization, pages 392-403.
  • 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.

Dissertation

  • Dennis Weyland (2013): Stochastic Vehicle Routing - From Theory to Practice. University of Lugano, Switzerland.

Diploma Thesis

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

Research Results / Supplementary Data