Advertisement

Solving the integrated operational transportation planning problem

Abstract

The integrated operational transportation planning problem is NP-hard [87]. Solving this complex problem requires massive computational effort even for small problem instances. Thus, algorithms guaranteeing the optimality of the generated solutions are not available. Instead, the application of the tabu search heuristic is proposed in order to find a high quality solution to the problem. Section 5.1 presents the general theoretical aspects of this heuristic. In Section 5.2 the specification of the applied tabu search is shown.

Keywords

Tabu Search Tabu List High Quality Solution Vehicle Route Tabu Search Heuristic 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Betriebswirtschaftlicher Verlag Dr. Th. Gabler | GWV Fachverlage GmbH, Wiesbaden 2008

Personalised recommendations