Uncertain Time-Varying Shortest Path Problems
(Sprache: Englisch)
In this book, we consider the time-varying shortest path problem with one objective or multi-objectives. In these problems, transit and waiting costs are not necessarily known in each time steps. We survey the time-varying shortest path, regarding to...
Leider schon ausverkauft
versandkostenfrei
Buch
39.90 €
Produktdetails
Produktinformationen zu „Uncertain Time-Varying Shortest Path Problems “
Klappentext zu „Uncertain Time-Varying Shortest Path Problems “
In this book, we consider the time-varying shortest path problem with one objective or multi-objectives. In these problems, transit and waiting costs are not necessarily known in each time steps. We survey the time-varying shortest path, regarding to waiting times at vertices. Moreover, the time-varying shortest path problem with arbitrary waiting times at vertices is considered, where transit costs and waiting costs are fuzzy numbers or possibly belong to some intervals. Then, two new algorithms for solving the time-varying shortest path with uncertain costs are proposed. Afterwards, we consider the shortest path problem on a time-varying network with multi-objectives functions to optimize. These K-objectives are associated with K attributes, which cannot combine together. The problem is to find the efficient path P from a source vertex to a target vertex such that the cost of path is minimized, where the total time of path is at most time horizon. Then, the maximum capacity path problem in a time-varying network is presented, where waiting at vertices is not allowable. Furthermore, the capacities are considered the fuzzy numbers.
Bibliographische Angaben
- Autoren: Hassan Rezapour , Gholamhassan Shirdel
- 2016, 92 Seiten, Maße: 22 cm, Kartoniert (TB), Englisch
- Verlag: LAP Lambert Academic Publishing
- ISBN-10: 3330002018
- ISBN-13: 9783330002012
Sprache:
Englisch
Kommentar zu "Uncertain Time-Varying Shortest Path Problems"
0 Gebrauchte Artikel zu „Uncertain Time-Varying Shortest Path Problems“
Zustand | Preis | Porto | Zahlung | Verkäufer | Rating |
---|
Schreiben Sie einen Kommentar zu "Uncertain Time-Varying Shortest Path Problems".
Kommentar verfassen