Bienvenue chez nous !
Logo Ex Libris
 Laissez-vous inspirer ! 

Time-Varying Network Optimization

  • Couverture cartonnée
  • 244 Nombre de pages
(0) Donner la première évaluation
Évaluations
(0)
(0)
(0)
(0)
(0)
Afficher toutes les évaluations
This text describes a series of models, propositions, and algorithms developed in recent years on time-varying networks. Reference... Lire la suite
CHF 116.00
Impression sur demande - l'exemplaire sera recherché pour vous.
Commande avec livraison dans une succursale

Description

This text describes 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. Its eight chapters consider problems including the shortest path problem, the minimum-spanning tree problem, the maximum flow problem, and many more. 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 are examined within the framework of time-varying networks, each chapter is self-contained so that each can be read - and used - separately.


From the reviews:

"This monograph provides a unified framework for a series of models and algorithms to study flow optimization problems in time-varying networks. the topics covered by this monograph make it useful for graduate students as a textbook and are of interest for engineers and researchers working on time-varying network optimization problems." (Francesc Comellas, Mathematical Reviews, Issue 2009 b)



Texte du rabat

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.



Résumé
Its eight chapters consider problems including the shortest path problem, the minimum-spanning tree problem, the maximum flow problem, and many more. The time-varying traveling salesman problem and the Chinese postman problem are presented in a chapter together with the time-varying generalized problem.

Contenu
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.

Informations sur le produit

Titre: Time-Varying Network Optimization
Auteur:
Code EAN: 9781441943873
ISBN: 1441943870
Format: Couverture cartonnée
Editeur: Springer US
Genre: Généralités et lexiques
nombre de pages: 244
Poids: 376g
Taille: H235mm x B155mm x T13mm
Année: 2010
Auflage: Softcover reprint of hardcover 1st ed. 2007

Autres articles de cette série  "International Series in Operations Research Management Science"