Time-Varying Network Optimization (eBook)

Dan Sha, C. K. Wong (Autoren)

eBook Download: PDF

2007 | 1. Auflage
XVI, 264 Seiten
Springer US (Verlag)
978-0-387-71215-4 (ISBN)

Infos

The express purpose of Time-Varying Network Optimization is to describe, in a unified and self-contained manner, a series of models, propositions, and algorithms developed in recent years on time-varying networks. References and discussions on relevant problems and studies that have appeared in the literature are integrated in the book. The book consists of eight chapters, in which the following problems are formulated and examined: (1) the shortest path problem, (2) minimum-spanning tree problem, (3) maximum flow problem, (4) minimum cost flow problem, (5) maximum capacity path problem, (6) quickest path problem, (7) multi-criteria problem, and (8) the generalized flow problem. The time-varying traveling salesman problem and the Chinese postman problem are presented in a chapter together with the time-varying generalized problem. While these topics will be described all within the framework of time-varying networks, our plan is to make each chapter relatively self-contained so that each can be read separately.

---

Network ?ow optimization problems may arise in a wide variety of important ?elds, such as transportation, telecommunication, computer networking, ?nancial planning, logistics and supply chain management, energy systems, etc. Signi?cant and elegant results have been achieved onthetheory,algorithms,andapplications,ofnetwork?owoptimization in the past few decades; See, for example, the seminal books written by Ahuja, Magnanti and Orlin (1993), Bazaraa, Jarvis and Sherali (1990), Bertsekas (1998), Ford and Fulkerson (1962), Gupta (1985), Iri (1969), Jensen and Barnes (1980), Lawler (1976), and Minieka (1978). Most network optimization problems that have been studied up to date are, however, static in nature, in the sense that it is assumed that it takes zero time to traverse any arc in a network and that all attributes of the network are constant without change at any time. Networks in the real world are, nevertheless, time-varying in essence, in which any ?ow must take a certain amount of time to traverse an arc and the network structure and parameters (such as arc and node capacities) may change over time. In such a problem, how to plan and control the transmission of ?ow becomes very important, since waiting at a node, or travelling along a particular arc with di?erent speed, may allow one to catch the best timing along his path, and therefore achieve his overall objective, such as a minimum overall cost or a minimum travel time from the origin to the destination.

Inhalt

Time-Varying Shortest Path Problems.- Time-Varying Minimum Spanning Trees.- Time-Varying Universal Maximum Flow Problems.- Time-Varying Minimum Cost Flow Problems.- Time-Varying Maximum Capacity Path Problems.- The Quickest Path Problem.- Finding the Best Path with Multi-Criteria.- Generalized Flows and Other Network Problems.

Produkt-Details

• Erscheint lt. Verlag: 5.5.2007
• Sprache: englisch
• Themenwelt: Mathematik / Informatik ► Informatik ► Datenbanken
• Themenwelt: Mathematik / Informatik ► Informatik ► Netzwerke
• Themenwelt: Informatik ► Weitere Themen ► Hardware
• Themenwelt: Mathematik / Informatik ► Mathematik ► Angewandte Mathematik
• Themenwelt: Mathematik / Informatik ► Mathematik ► Finanz- / Wirtschaftsmathematik
• Themenwelt: Technik
• Themenwelt: Wirtschaft ► Allgemeines / Lexika
• Themenwelt: Wirtschaft ► Betriebswirtschaft / Management ► Unternehmensführung / Management
• Schlagworte: Chinese postman problem • computer network • Host • maximum capacity path • maximum/ minimum cost flow • minimum spanning tree • Network Optimization • Optimization • shortest path • Traveling Salesman Problem
• ISBN-10: 0-387-71215-1 / 0387712151
• ISBN-13: 978-0-387-71215-4 / 9780387712154