Solving the integrated operational transportation planning problem
The integrated operational transportation planning problem is NP-hard . 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.
KeywordsTabu Search Tabu List High Quality Solution Vehicle Route Tabu Search Heuristic
Unable to display preview. Download preview PDF.