Michael Redmond
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Michael Redmond has a total of 11 co-authors. Here are the top co-authors by number of shared publications:
- Ann Melissa Campbell
University of Iowa
2 shared publications - Jan Fabian Ehmke
Department of Business Decisions and Analytics, University of Vienna, Vienna, Austria
2 shared publications Abigail Levin
University of Michigan, Ann Arbor, U.S.A.
1 shared publication- Alex Pham
Creighton University
1 shared publication Ann M. Campbell
Department of Management Sciences University of Iowa Iowa City IA
1 shared publicationJan F. Ehmke
Management Science Group Otto‐von‐Guericke University Magdeburg Magdeburg Germany
1 shared publication
Latest Publications
- 8 October 2024
- Published by Springer Nature in Annals of Operations Research
- Vol. 343 (1) , 153-174
The tradeoff between maximizing expected profit and minimizing the maximum regret in the newsvendor problem
- 8 October 2024
- Published by Springer Nature in Annals of Operations Research
- Vol. 343 (1) , 153-174
The tradeoff between maximizing expected profit and minimizing the maximum regret in the newsvendor problem
- 4 November 2022
- Published by Elsevier in Journal of Air Transport Management
- Vol. 106
Flight reliability during periods of high uncertainty
- 4 November 2022
- Published by Elsevier in Journal of Air Transport Management
- Vol. 106
Flight reliability during periods of high uncertainty
- 1 August 2022
- Published by Elsevier in European Journal of Operational Research
- Vol. 300 (3) , 852-864
Reliability in public transit networks considering backup itineraries
- 1 August 2022
- Published by Elsevier in European Journal of Operational Research
- Vol. 300 (3) , 852-864
Reliability in public transit networks considering backup itineraries
- 2 December 2019
- Published by Springer Nature in Public Transport
- Vol. 12 (1) , 171-205
Data-driven planning of reliable itineraries in multi-modal transit networks
- 2 December 2019
- Published by Springer Nature in Public Transport
- Vol. 12 (1) , 171-205
Data-driven planning of reliable itineraries in multi-modal transit networks
The most reliable flight itinerary problem
Travel itineraries between many origin‐destination (OD) pairs can require multiple legs, such as several trains, shared rides or flights, to arrive at the final destination. Travelers expect transparent reliability information to help improve decision‐making for multi‐leg itineraries. We focus on airline travel and making a priori decisions about flight itineraries based on the reliability of arriving at the destination within the travel time budget. We model the reliability of multi‐leg itineraries and, given publicly available data, create probability distributions of flight arrival and departure times. We use these values in our reliability calculations for the entire itinerary. We implement a stochastic network search algorithm that finds the most reliable flight itinerary (MRFI). We also implement several ideas to improve the efficiency of this network search. Computational experiments help identify characteristics of the MRFI for a diverse set of OD pairs.
The most reliable flight itinerary problem
Travel itineraries between many origin‐destination (OD) pairs can require multiple legs, such as several trains, shared rides or flights, to arrive at the final destination. Travelers expect transparent reliability information to help improve decision‐making for multi‐leg itineraries. We focus on airline travel and making a priori decisions about flight itineraries based on the reliability of arriving at the destination within the travel time budget. We model the reliability of multi‐leg itineraries and, given publicly available data, create probability distributions of flight arrival and departure times. We use these values in our reliability calculations for the entire itinerary. We implement a stochastic network search algorithm that finds the most reliable flight itinerary (MRFI). We also implement several ideas to improve the efficiency of this network search. Computational experiments help identify characteristics of the MRFI for a diverse set of OD pairs.
- 1 January 2013
- Published by Springer Nature
- p. 187-200
Intuitionistic Fuzzy Sets and Political Stability
- 1 January 2013
- Published by Springer Nature
- p. 187-200
Intuitionistic Fuzzy Sets and Political Stability