Time-Varying Network Optimization

This document was uploaded by one of our users. The uploader already confirmed that they had the permission to publish it. If you are author/publisher or own the copyright of this documents, please report to us by using this DMCA report form.

Simply click on the Download Book button.

Yes, Book downloads on Ebookily are 100% Free.

Sometimes the book is free on Amazon As well, so go ahead and hit "Search on Amazon"

Network flow optimization analyzes optimization problems on networks; hence, network optimization is reflected in many application fields including transportation, telecommunication, computer networking, financial planning, logistics and supply chain management, energy systems, etc. However, to date, most network optimization problems that have been studied are static network optimization problems. But "real world networks" are time-varying in essence, and therefore any flow within a network must take a certain amount of time to traverse an arc. Moreover, the parameters of "real world networks" may change over time. Problems such as how to plan and control the transmission of flow becomes very important, because waiting at a node, or traveling along a particular arc with different speed, may allow one to catch the best timing along the path; thus, achieving the objective and changing the decision making process. It should be noted that there are a host of decision making problems in practice that should be formulated as optimization models on time-varying networks.

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 read separately.

The book will be useful for researchers, practitioners, graduate students and senior undergraduates, as a unified reference and textbook on time-varying network optimization. While the book describes the structure of the algorithms, the authors also have developed the software that implements the algorithms. This software can be made available for academic study purposes upon request.

Author(s): Xiaoqiang Cai, Dan Sha, C. K. Wong (auth.)
Series: International Series in Operations Research & Management Science 103
Edition: 1
Publisher: Springer US
Year: 2007

Language: English
Pages: 248
City: New York, NY
Tags: Operations Research/Decision Theory; Optimization; Operations Research, Mathematical Programming; Information Systems and Communication Service; Information Systems Applications (incl.Internet); Production/Logistics

Front Matter....Pages i-xvi
Time-Varying Shortest Path Problems....Pages 1-26
Time-Varying Minimum Spanning Trees....Pages 27-67
Time-Varying Universal Maximum Flow Problems....Pages 69-105
Time-Varying Minimum Cost Flow Problems....Pages 107-134
Time-Varying Maximum Capacity Path Problems....Pages 135-149
The Quickest Path Problem....Pages 151-165
Finding the Best Path with Multi-Criteria....Pages 167-174
Generalized Flows and Other Network Problems....Pages 175-206
Back Matter....Pages 207-226