Department of Computer Science | Institute of Theoretical Computer Science | CADMO

Theory of Combinatorial Algorithms

Prof. Emo Welzl and Prof. Bernd Gärtner

Mittagsseminar (in cooperation with A. Steger, D. Steurer and B. Sudakov)

Mittagsseminar Talk Information

Date and Time: Wednesday, May 11, 2005, 12:15 pm

Duration: This information is not available in the database

Location: This information is not available in the database

Speaker: Leonhard Vogt

A Tabu Search Algorithm for the Single Vehicle Routing Allocation Problem

The SVRAP consists in finding an optimal way to serve a subset of customers by a single vehicle. For each customer there are three options: He can be served directly by the vehicle, he can be served indirectly via one other customer or else he is not served at all.

The vehicle tour start and endpoint are given. There are costs given for vehicle movement, for indirect service, and for not serving a client.

A tabu search algorithm is developped and results are on a set of previously exactly solved problems are discussed.

Upcoming talks     |     All previous talks     |     Talks by speaker     |     Upcoming talks in iCal format (beta version!)

Previous talks by year:   2024  2023  2022  2021  2020  2019  2018  2017  2016  2015  2014  2013  2012  2011  2010  2009  2008  2007  2006  2005  2004  2003  2002  2001  2000  1999  1998  1997  1996  

Information for students and suggested topics for student talks

Automatic MiSe System Software Version 1.4803M   |   admin login