The Merits of Sharing a Ride

The culture of sharing instead of ownership is sharply increasing in individuals behaviors. Particularly in transportation, concepts of sharing a ride in either carpooling or ridesharing have been recently adopted. An efficient optimization approach to match passengers in real-time is the core of any ridesharing system. In this paper, we model ridesharing as an online matching problem on general graphs such that passengers do not drive private cars and use shared taxis. We propose an optimization algorithm to solve it. The outlined algorithm calculates the optimal waiting time when a passenger arrives. This leads to a matching with minimal overall overheads while maximizing the number of partnerships. To evaluate the behavior of our algorithm, we used NYC taxi real-life data set. Results represent a substantial reduction in overall overheads

Developing an Overbooking Fuzzy-Based Mathematical Optimization Model for Multi-Leg Flights

Overbooking is one of the most vital revenue management practices that is used in the airline industry. Identification of an overbooking level is a challenging task due to the uncertainties associated with external factors, such as demand for tickets, and inappropriate overbooking levels which may cause revenue losses as well as loss of reputation and customer loyalty. Therefore, the aim of this paper is to propose a fuzzy linear programming model and Genetic Algorithms (GAs) to maximize the overall revenue of a large-scale multi-leg flight network by minimizing the number of empty seats and the number of denied passengers. A fuzzy logic technique is used for modeling the fuzzy demand on overbooking flight tickets and a metaheuristics-based GA technique is adopted to solve large-scale multi-leg flights problem. As part of model verification, the proposed GA is applied to solve a small multi-leg flight linear programming model with a fuzzified demand factor. In addition, experimentation with large-scale problems with different input parameters’ settings such as penalty rate, show-up rate and demand level are also conducted to understand the behavior of the developed model. The validation results show that the proposed GA produces almost identical results to those in a small-scale multi-leg flight problem. In addition, the performance of the large-scale multi-leg flight network represented by a number of KPIs including total booking, denied passengers and net-overbooking profit towards changing these input parameters will also be revealed

Cumulative Prospect Theory Based Dynamic Pricing for Shared Mobility on Demand Services

Cumulative Prospect Theory (CPT) is a modeling tool widely used in behavioral economics and cognitive psychology that captures subjective decision making of individuals under risk or uncertainty. In this paper, we propose a dynamic pricing strategy for Shared Mobility on Demand Services (SMoDSs) using a passenger behavioral model based on CPT. This dynamic pricing strategy together with dynamic routing via a constrained optimization algorithm that we have developed earlier, provide a complete solution customized for SMoDS of multi-passenger transportation. The basic principles of CPT and the derivation of the passenger behavioral model in the SMoDS context are described in detail. The implications of CPT on dynamic pricing of the SMoDS are delineated using computational experiments involving passenger preferences. These implications include interpretation of the classic fourfold pattern of risk attitudes, strong risk aversion over mixed prospects, and behavioral preferences of self reference. Overall, it is argued that the use of the CPT framework corresponds to a crucial building block in designing socio-technical systems by allowing quantification of subjective decision making under risk or uncertainty that is perceived to be otherwise qualitative.Comment: 17 pages, 6 figures, and has been accepted for publication at the 58th Annual Conference on Decision and Control, 201

Flight Gate Assignment with a Quantum Annealer

Optimal flight gate assignment is a highly relevant optimization problem from airport management. Among others, an important goal is the minimization of the total transit time of the passengers. The corresponding objective function is quadratic in the binary decision variables encoding the flight-to-gate assignment. Hence, it is a quadratic assignment problem being hard to solve in general. In this work we investigate the solvability of this problem with a D-Wave quantum annealer. These machines are optimizers for quadratic unconstrained optimization problems (QUBO). Therefore the flight gate assignment problem seems to be well suited for these machines. We use real world data from a mid-sized German airport as well as simulation based data to extract typical instances small enough to be amenable to the D-Wave machine. In order to mitigate precision problems, we employ bin packing on the passenger numbers to reduce the precision requirements of the extracted instances. We find that, for the instances we investigated, the bin packing has little effect on the solution quality. Hence, we were able to solve small problem instances extracted from real data with the D-Wave 2000Q quantum annealer.Comment: Updated figure

Testing demand responsive shared transport services via agent-based simulations

Demand Responsive Shared Transport DRST services take advantage of Information and Communication Technologies ICT, to provide on demand transport services booking in real time a ride on a shared vehicle. In this paper, an agent-based model ABM is presented to test different the feasibility of different service configurations in a real context. First results show the impact of route choice strategy on the system performance

Mind the Gap – Passenger Arrival Patterns in Multi-agent Simulations

In most studies mathematical models are developed finding the expected waiting time to be a function of the headway. These models have in common that the proportion of passengers that arrive randomly at a public transport stop is less as headway in-creases. Since there are several factors of influence, such as social demographic or regional aspects, the reliability of public transport service and the level of passenger information, the threshold headway for the transition from random to coordinated passenger arrivals vary from study to study. This study's objective is to investigate if an agent-based model exhibits realistic passenger arrival behavior at transit stops. This objective is approached by exploring the sensitivity of the agents' arrival behavior towards (1) the degree of learning, (2) the reliability of the experienced transit service, and (3) the service headway. The simulation experiments for a simple transit corridor indicate that the applied model is capable of representing the complex passenger arrival behavior observed in reality. (1) For higher degrees of learning, the agents tend to over-optimize, i.e. they try to obtain the latest possible departure time exact to the second. An approach is presented which increases the diversity in the agents' travel alternatives and results in a more realistic behavior. (2) For a less reliable service the agents' time adaptation changes in that a buffer time is added between their arrival at the stop and the actual departure of the vehicle. (3) For the modification of the headway the simulation outcome is consistent with the literature on arrival patterns. Smaller headways yield a more equally distributed arrival pattern whereas larger headways result in more coordinated arrival patterns

Analysis and operational challenges of dynamic ride sharing demand responsive transportation models

There is a wide body of evidence that suggests sustainable mobility is not only a technological question, but that automotive technology will be a part of the solution in becoming a necessary albeit insufficient condition. Sufficiency is emerging as a paradigm shift from car ownership to vehicle usage, which is a consequence of socio-economic changes. Information and Communication Technologies (ICT) now make it possible for a user to access a mobility service to go anywhere at any time. Among the many emerging mobility services, Multiple Passenger Ridesharing and its variants look the most promising. However, challenges arise in implementing these systems while accounting specifically for time dependencies and time windows that reflect users’ needs, specifically in terms of real-time fleet dispatching and dynamic route calculation. On the other hand, we must consider the feasibility and impact analysis of the many factors influencing the behavior of the system – as, for example, service demand, the size of the service fleet, the capacity of the shared vehicles and whether the time window requirements are soft or tight. This paper analyzes - a Decision Support System that computes solutions with ad hoc heuristics applied to variants of Pick Up and Delivery Problems with Time Windows, as well as to Feasibility and Profitability criteria rooted in Dynamic Insertion Heuristics. To evaluate the applications, a Simulation Framework is proposed. It is based on a microscopic simulation model that emulates real-time traffic conditions and a real traffic information system. It also interacts with the Decision Support System by feeding it with the required data for making decisions in the simulation that emulate the behavior of the shared fleet. The proposed simulation framework has been implemented in a model of Barcelona’s Central Business District. The obtained results prove the potential feasibility of the mobility concept.Postprint (published version