Integrated operational transportation planning in theory


The preliminaries for the theory of the integrated operational transportation planning problem were established in the late 1980s (for this and in following compare [62]). [110] discusses a generalized traveling salesman problem, where nodes are visited either once or not, and a penalty cost is incurred for each unvisited node. The resulting approach includes the longest-path problem and the shortest-path problem with specified nodes to be visited.


Penalty Cost Price Problem Transportation Planning Vehicle Rout Problem With Time Window Tour Length 
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.


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