This book treats three planning problems arising in public railway transportation planning: line planning, timetabling, and delay management, with the objective to minimize passengers' travel time. While many optimization approaches simplify these problems by assuming that passengers' route choice is independent of the solution, this book focuses on models which take into account that passengers will adapt their travel route to the implemented planning solution. That is, a planning solution and passengers' routes are determined and evaluated simultaneously.
This work is technically deep, with insightful finding regarding complexity and algorithmic approaches to public transportation problems with integrated passenger routing. It is intended for researchers in the fields of mathematics, computer science, or operations research, working in the field of public transportation from an optimization standpoint. It is also ideal for students who want to gain intuition and experience in doing complexity proofs and designing polynomial-time algorithms for network problems.
The book models line planning, timetabling and delay management as combined design and routing problems on networks. In a complexity analysis, the border between NP-hard and polynomially solvable problems is illustrated. Based on that, the insights gained are used to develop solution approaches for the considered problems. Besides integer programming formulations, a heuristic method iterating planning and routing step is proposed to solve the problems.
"Sinopsis" puede pertenecer a otra edición de este libro.
This book treats three planning problems arising in public railway transportation planning: line planning, timetabling, and delay management, with the objective to minimize passengers’ travel time. While many optimization approaches simplify these problems by assuming that passengers’ route choice is independent of the solution, this book focuses on models which take into account that passengers will adapt their travel route to the implemented planning solution. That is, a planning solution and passengers’ routes are determined and evaluated simultaneously.
This work is technically deep, with insightful findings regarding complexity and algorithmic approaches to public transportation problems with integrated passenger routing. It is intended for researchers in the fields of mathematics, computer science, or operations research, working in the field of public transportation from an optimization standpoint. It is also ideal for students who want to gain intuition and experience in doing complexity proofs and designing polynomial-time algorithms for network problems.
The book models line planning, timetabling, and delay management as combined design and routing problems on networks. In a complexity analysis, the border between NP-hard and polynomially solvable problems is illustrated. Based on that, the insights gained are used to develop solution approaches for the considered problems. Besides integer programming formulations, a heuristic method iterating planning and routing steps is proposed to solve the problems.
"Sobre este título" puede pertenecer a otra edición de este libro.
Librería: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Alemania
Buch. Condición: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -This book treats three planning problems arising in public railway transportation planning: line planning, timetabling, and delay management, with the objective to minimize passengers' travel time. While many optimization approaches simplify these problems by assuming that passengers' route choice is independent of the solution, this book focuses on models which take into account that passengers will adapt their travel route to the implemented planning solution. That is, a planning solution and passengers' routes are determined and evaluated simultaneously.This work is technically deep, with insightful finding regarding complexity and algorithmic approaches to public transportation problems with integrated passenger routing. It is intended for researchers in the fields of mathematics, computer science, or operations research, working in the field of public transportation from an optimization standpoint. It is also ideal for students who want to gain intuition and experience in doing complexity proofs and designing polynomial-time algorithms for network problems.The book models line planning, timetabling and delay management as combined design and routing problems on networks. In a complexity analysis, the border between NP-hard and polynomially solvable problems is illustrated. Based on that, the insights gained are used to develop solution approaches for the considered problems. Besides integer programming formulations, a heuristic method iterating planning and routing step is proposed to solve the problems. 240 pp. Englisch. Nº de ref. del artículo: 9781461495659
Cantidad disponible: 2 disponibles
Librería: Brook Bookstore On Demand, Napoli, NA, Italia
Condición: new. Questo è un articolo print on demand. Nº de ref. del artículo: b7f1064d9b480813d67c8986877687a1
Cantidad disponible: Más de 20 disponibles
Librería: Books Puddle, Woodside, NY, Estados Unidos de America
Condición: New. pp. 240. Nº de ref. del artículo: 2697790191
Cantidad disponible: 4 disponibles
Librería: Majestic Books, Hounslow, Reino Unido
Condición: New. pp. 240 23 Illus. Nº de ref. del artículo: 94607152
Cantidad disponible: 4 disponibles
Librería: Biblios, Frankfurt am main, HESSE, Alemania
Condición: New. pp. 240. Nº de ref. del artículo: 1897790181
Cantidad disponible: 4 disponibles
Librería: Basi6 International, Irving, TX, Estados Unidos de America
Condición: Brand New. New. US edition. Expediting shipping for all USA and Europe orders excluding PO Box. Excellent Customer Service. Nº de ref. del artículo: ABEOCT25-164692
Cantidad disponible: 1 disponibles
Librería: Romtrade Corp., STERLING HEIGHTS, MI, Estados Unidos de America
Condición: New. This is a Brand-new US Edition. This Item may be shipped from US or any other country as we have multiple locations worldwide. Nº de ref. del artículo: ABBB-62094
Cantidad disponible: 2 disponibles
Librería: SMASS Sellers, IRVING, TX, Estados Unidos de America
Condición: New. Brand New Original US Edition. Customer service! Satisfaction Guaranteed. Nº de ref. del artículo: SNTA-62094
Cantidad disponible: 2 disponibles
Librería: moluna, Greven, Alemania
Condición: New. Nº de ref. del artículo: 4200034
Cantidad disponible: Más de 20 disponibles
Librería: AHA-BUCH GmbH, Einbeck, Alemania
Buch. Condición: Neu. Druck auf Anfrage Neuware - Printed after ordering - This book treats three planning problems arising in public railway transportation planning: line planning, timetabling, and delay management, with the objective to minimize passengers' travel time. While many optimization approaches simplify these problems by assuming that passengers' route choice is independent of the solution, this book focuses on models which take into account that passengers will adapt their travel route to the implemented planning solution. That is, a planning solution and passengers' routes are determined and evaluated simultaneously.This work is technically deep, with insightful finding regarding complexity and algorithmic approaches to public transportation problems with integrated passenger routing. It is intended for researchers in the fields of mathematics, computer science, or operations research, working in the field of public transportation from an optimization standpoint. It is also ideal for students who want to gain intuition and experience in doing complexity proofs and designing polynomial-time algorithms for network problems.The book models line planning, timetabling and delay management as combined design and routing problems on networks. In a complexity analysis, the border between NP-hard and polynomially solvable problems is illustrated. Based on that, the insights gained are used to develop solution approaches for the considered problems. Besides integer programming formulations, a heuristic method iterating planning and routing step is proposed to solve the problems. Nº de ref. del artículo: 9781461495659
Cantidad disponible: 1 disponibles