Skip to main content

Integrated operational transportation planning in theory

  • Chapter
  • 538 Accesses

Abstract

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.

This is a preview of subscription content, log in via an institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Rights and permissions

Reprints and permissions

Copyright information

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

About this chapter

Cite this chapter

(2008). Integrated operational transportation planning in theory. In: Potentials for Efficiency Increase in Modern Freight Forwarding. Gabler. https://doi.org/10.1007/978-3-8349-9623-7_3

Download citation

Publish with us

Policies and ethics