Designing optimal autonomous vehicle sharing and reservation systems: A linear programming approach

Autonomous vehicle (AV) technology holds great promise for improving the efficiency of traditional vehicle sharing systems. In this paper, we investigate a new vehicle sharing system using AVs, referred to as autonomous vehicle sharing and reservation (AVSR). In such a system, travelers can request AV trips ahead of time and the AVSR system operator will optimally arrange AV pickup and delivery schedules and AV trip chains based on these requests. A linear programming model is proposed to efficiently solve for optimal solutions for AV trip chains and required fleet size through constructed AVSR networks. Case studies show that AVSR can significantly increase vehicle use rate (VUR) and consequentially reduce vehicle ownership significantly. In the meantime, it is found that the actual vehicle miles traveled (VMT) in AVSR systems is not significantly more than that of conventional taxis, despite inevitable empty hauls for vehicle relocation in AVSR systems. The results imply huge potential benefits from AVSR systems on improving mobility and sustainability of our current transportation systems.     

A disjunctive convex programming approach to the pollution-routing problem

The pollution-routing problem (PRP) aims to determine a set of routes and speed over each leg of the routes simultaneously to minimize the total operational and environmental costs. A common approach to solve the PRP exactly is through speed discretization, i.e., assuming that speed over each arc is chosen from a prescribed set of values. In this paper, we keep speed as a continuous decision variable within an interval and propose new formulations for the PRP. In particular, we build two mixed-integer convex optimization models for the PRP, by employing tools from disjunctive convex programming. These are the first arc-based formulations for the PRP with continuous speed. We also derive several families of valid inequalities to further strengthen both models. We test the proposed formulations on benchmark instances. Some instances are solved to optimality for the first time.     

Global optimization method for mixed transportation network design problem: A mixed-integer linear programming approach

This paper proposes a global optimization algorithm for solving a mixed (continuous/discrete) transportation network design problem (MNDP), which is generally expressed as a mathematical programming with equilibrium constraint (MPEC). The upper level of the MNDP aims to optimize the network performance via both expansion of existing links and addition of new candidate links, whereas the lower level is a traditional Wardrop user equilibrium (UE) problem. In this paper, we first formulate the UE condition as a variational inequality (VI) problem, which is defined from a finite number of extreme points of a link-flow feasible region. The MNDP is approximated as a piecewise-linear programming (P-LP) problem, which is then transformed into a mixed-integer linear programming (MILP) problem. A global optimization algorithm based on a cutting constraint method is developed for solving the MILP problem. Numerical examples are given to demonstrate the efficiency of the proposed method and to compare the results with alternative algorithms reported in the literature.     

A discrete-convex programming approach to the simultaneous optimization of land use and transportation

Three design problems are discussed in this article. First, it is shown that the network design problem with congestion reduces to an all-or nothing traffic assignment problem under some assumptions on the congestion function and the investment cost function. Second, the land use design problem is formulated as an extension of the Koopmans-Beckmann problem and a heuristic is proposed to solve this problem. Third, it is shown that the seemingly more complex problem of designing jointly a land-use plan and a transportation network reduces to a pure land-use design problem. All that is needed to solve the joint optimization problem is a shortest path algorithm and a heuristic to solve the land use design problem. Computational experience is reported for each algorithm.     

A general bilevel linear programming formulation of the network design problem

A formulation of the network design problem as a bilevel linear program is presented which admits both the convex and concave investment functions. It also allows a more general representation of travel cost functions than a previous formulation by LeBlanc and Boyce (1986).     

A bi-objective dynamic programming approach for airline green fleet planning

Ensuring a fleet of green aircraft is a basic step in mitigating aviation pollution issues that are expected to be worsen in the coming years due to rapid air traffic growth. This study proposed a novel methodology in green fleet planning in which both profit and green performance of airline are considered simultaneously and explicitly. To do this, a Green Fleet Index (GFI) is derived as an indicator to quantify the green performance of airline’s fleet. It measures the degree of airline compliance with a standard requirement in terms of emission, noise, and fuel consumption. A bi-objective dynamic programming model is then formulated to find optimal aircraft acquisition (lease or purchase) decision by minimizing GFI and maximizing profit. Several interesting results are obtained: (1) considering environmental issue as secondary objective yields a greener fleet; (2) airline’s profit is affected, but could be recovered from environmental cost savings; (3) increasing load factor is an effective operational improvement strategy to enhance airline’s green performance and raise profit level. It is anticipated that the framework developed in this study could assist airlines to make a smart decision when considering the need to be green.     

Location privacy preferences: A survey-based analysis of consumer awareness,trade-off and decision-making

With the advent and rapid dissemination of location-sensing information technology, the issue of location information privacy is receiving growing attention. Perhaps of greatest concern is ensuring that potential users of mobile Information and Communications Technologies (e.g., Location-Based Services and Intelligent Transportation Systems) are comfortable with the levels of privacy protection afforded them, as well as with the benefits they will receive in return for providing private location information. This paper explores the concepts of privacy risks, benefits, willingness to trade, and compensation in relationship to mobile and locational technologies using a stated preference survey to ascertain areas of interest in determining the trade-offs that consumers will be willing to make in return for mobility enhancements. Analysis of the survey leads to findings that while respondents believe that sharing data in the mobile environment may pose privacy risks, they do not generally take steps necessary to address these risks; that privacy preferences are impacted by a range of factors, including both personal and contextual considerations (such as factors arising from their specific situation at the time of information seeking); and that willingness to trade private location data is dependent upon a number of factors related to context, personal characteristics, expected benefits and degree of trust in the collecting organization.     

A toll-based bi-level programming approach to managing hazardous materials shipments over an intermodal transportation network

This research proposes a bi-level bi-objective model to regulate the usage of rail intermodal terminals for hazardous materials (hazmat) shipments, where government imposes tolls to deter carriers from using certain terminals. The complexity of the resulting mathematical program motivates the development of a hybrid speed-constrained multi-objective particle swarm optimization algorithm, which is then integrated with CPLEX, to solve the model. Through a real problem instance based on the intermodal service chain of Norfolk Southern in US, the toll-setting model is examined and further compared with a regular network design approach, in which certain terminals are closed to hazmat containers. The computational results show that the toll-setting policy is more practical and efficient, and the two models can be combined as a two-stage strategy in long-term hazmat transportation regulations. Additional managerial insights are derived for different stakeholders.     

A multiple criteria approach to two-stage data envelopment analysis

Two-stage data envelopment analysis (DEA) models are commonly used in the evaluation and benchmarking of sustainable operations and processes across multiple research fields. To date, however, little attention has been given to the unrealistic weight distribution and weak discrimination power in the modeling and evaluation of the two-stage sustainable operations when using two-stage DEA models. In order to overcome this methodological weakness, we use the multiple criteria DEA (MCDEA) approach in the evaluation of the two-stage processes. The outcome is a multiple criteria two-stage DEA model which yields more realistic weights for the inputs and outputs and thus has better discrimination power than traditional two-stage DEA models. The developed model is tested and validated by assessing the sustainable design performances of a sample of car product designs.     

The market potential for plug-in hybrid and battery electric vehicles in Flanders: A choice-based conjoint analysis

This paper considers the market potential for battery electric and plug-in hybrid electric vehicles in Flanders, Belgium. Making use of a large-scale survey conducted in 2011 and applying a choice-based conjoint experiment, it is predicted that by 2020, battery electric vehicles could have a market share of about 5% of new vehicles, and plug-in hybrid electric vehicles could have a share of around 7%. By 2030, these figures could increase to 15% and 29%. The speed of up-take of electric vehicles, however, is sensitive to purchase costs.     

A trade-off analysis between penetration rate and sampling frequency of mobile sensors in traffic state estimation

The rapid-growth of smartphones with embedded navigation systems such as GPS modules provides new ways of monitoring traffic. These devices can register and send a great amount of traffic related data, which can be used for traffic state estimation. In such a case, the amount of data collected depends on two variables: the penetration rate of devices in traffic flow (P) and their data sampling frequency (z). Referring to data composition as the way certain number of observations is collected, in terms of P and z, we need to understand the relation between the amount and composition of data collected, and the accuracy achieved in traffic state estimation. This was accomplished through an in-depth analysis of two datasets of vehicle trajectories on freeways. The first dataset consists of trajectories over a real freeway, while the second dataset is obtained through microsimulation. Hypothetical scenarios of data sent by equipped vehicles were created, based on the composition of data collected. Different values of P and z were used, and each unique combination defined a specific scenario. Traffic states were estimated through two simple methods, and a more advanced one that incorporates traffic flow theory. A measure to quantify data to be collected was proposed, based on travel time, number of vehicles, penetration rate and sampling frequency. The error was below 6% for every scenario in each dataset. Also, increasing data reduced variability in data count estimation. The performance of the different estimation methods varied through each dataset and scenario. Since the same number of observations can be gathered with different combinations of P and z, the effect of data composition was analyzed (a trade-off between penetration rate and sampling frequency). Different situations were found. In some, an increase in penetration rate is more effective to reduce estimation error than an increase in sampling frequency, considering an equal increase in observations. In other areas, the opposite relationship was found. Between these areas, an indifference curve was found. In fact, this curve is the solution to the optimization problem of minimizing the error given any fixed number of observations. As a general result, increasing sampling frequency (penetration rate) is more beneficial when the current sampling frequency (penetration rate) is low, independent of the penetration rate (sampling frequency).     

Investigating transit production and performance: a programming approach

Although efficiency and productivity are closely related issues, they have been generally examined separately in the transit literature. Using an extensive panel data set, this analysis extends prior research in two directions. First, efficiency rankings and efficient subsets of transit systems are obtained through data envelopment analysis (DEA), a non-parametric linear programming based methodology. Second, based on the results of the DEA analysis, globally efficient frontier production functions, in the context of transit operations in the United States, are built. The results indicate that when jointly considered, there is an improvement on both the theoretical and empirical aspects of examining efficiency and production in transit systems. Further, the results indicate that efficiency and returns to scale findings differ substantially depending on the evaluation methodology used.     

A linear programming formulation for autonomous intersection control within a dynamic traffic assignment and connected vehicle environment

This paper develops a novel linear programming formulation for autonomous intersection control (LPAIC) accounting for traffic dynamics within a connected vehicle environment. Firstly, a lane based bi-level optimization model is introduced to propagate traffic flows in the network, accounting for dynamic departure time, dynamic route choice, and autonomous intersection control in the context of system optimum network model. Then the bi-level optimization model is transformed to the linear programming formulation by relaxing the nonlinear constraints with a set of linear inequalities. One special feature of the LPAIC formulation is that the entries of the constraint matrix has only {−1, 0, 1} values. Moreover, it is proved that the constraint matrix is totally unimodular, the optimal solution exists and contains only integer values. It is also shown that the traffic flows from different lanes pass through the conflict points of the intersection safely and there are no holding flows in the solution. Three numerical case studies are conducted to demonstrate the properties and effectiveness of the LPAIC formulation to solve autonomous intersection control.     

A fuzzy measure based solution approach to a multimodal analysis problem

This paper discusses the factors that determine the utility of a mode and attempts to suggest and investigate a novel fuzzy measure based solution approach to the problem of multimodal analysis in a multicriteria context. The paper expands on the notions of fuzzy logic and in particular, fuzzy measures. The approach attempts to estimate the probabilities of the “overall system” from a group of eight experts who are experienced in transport planning. The data is used to ascertain the relative utility of various modes in a competitive environment. It explains the application of fuzzy measures to provide guidance information for a transport planning agency.     

A multiobjective hierarchical model for locating public facilities on a transportation network: A goal programming approach

This paper introduces a Multiobjective Hierarchical Model (MOHLM) for locating public facilities on a transportation network. The proposed model combines the multiobjective nature of the location-allocation problem with the hierarchical character of some public service systems, such as health care delivery. The model examines both maximum and total weighted travel time, facility utilization, and total travel time from the master facility to the attached subordinate facilities. An iterative goal programing algorithm is used to solve the problem. An example related to the location of health care facilities in a rural area of Greece is used to illustrate the application of the proposed model.     

A bayesian dynamic linear model approach for real-time short-term freeway travel time prediction

This paper presents a Bayesian inference-based dynamic linear model (DLM) to predict online short-term travel time on a freeway stretch. The proposed method considers the predicted freeway travel time as the sum of the median of historical travel times, time-varying random variations in travel time, and a model evolution error, where the median is employed to recognize the primary travel time pattern while the variation captures unexpected supply (i.e. capacity) reduction and demand fluctuations. Bayesian forecasting is a learning process that revises sequentially the state of a priori knowledge of travel time based on newly available information. The prediction result is a posterior travel time distribution that can be employed to generate a single-value (typically but not necessarily the mean) travel time as well as a confidence interval representing the uncertainty of travel time prediction. To better track travel time fluctuations during non-recurrent congestion due to unforeseen events (e.g., incidents, accidents, or bad weather), the DLM is integrated into an adaptive control framework that can automatically learn and adjust the system evolution noise level. The experiment results based on the real loop detector data of an I-66 segment in Northern Virginia suggest that the proposed method is able to provide accurate and reliable travel time prediction under both recurrent and non-recurrent traffic conditions.     

Reducing pedestrian exposure to environmental pollutants: A combined noise exposure and air quality analysis approach

This study offers a combined analysis of pedestrian exposure to noise and air pollution within a specific urban setting in Dublin, Ireland. The impact of a recent boardwalk development on reducing pedestrian exposure to air and noise pollution is examined while modelling experiments are undertaken to explore the possibility of achieving further reductions in pollutant exposure through better urban design and planning. The results show that the boardwalk has reduced pedestrian exposure to air and noise pollution and that further reductions may be achieved by more strict segregation of pedestrian and road traffic in urban areas.     

A bi‐level programming approach — Optimal transit fare under line capacity constraints

The fare of a transit line is one of the important decision variables for transit network design. It has been advocated as an efficient means of coordinating the transit passenger flows and of alleviating congestion in the transit network. This paper shows how transit fare can be optimized so as to balance the passenger flow on the transit network and to reduce the overload delays of passengers at transit stops. A bi‐level programming method is developed to optimize the transit fare under line capacity constraints. The upper‐level problem seeks to minimize the total network travel time, while the lower‐level problem is a stochastic user equilibrium transit assignment model with line capacity constraints. A heuristic solution algorithm based on sensitivity analysis is proposed. Numerical example is used to illustrate the application of the proposed model and solution algorithm.     

Principal components analysis and track quality index: A machine learning approach

Track geometry data exhibits classical big data attributes: value, volume, velocity, veracity and variety. Track Quality Indices-TQI are used to obtain average-based assessment of track segments and schedule track maintenance. TQI is expressed in terms of track parameters like gage, cross-level, etc. Though each of these parameters is objectively important but understanding what they collectively convey for a given track segment often becomes challenging. Several railways including passenger and freight have developed single indices that combines different track parameters to assess overall track quality. Some of these railways have selected certain parameters whilst dropping others. Using track geometry data from a sample mile track, we demonstrate how to combine track geometry parameters into a low dimensional form (TQI) that simplifies the track properties without losing much variability in the data. This led us to principal components. To validate the use of principal components as TQI, we employed a two-phase approach. First phase was to identify a classic machine learning technique that works well with track geometry data. The second step was to train the identified machine learning technique on the sample mile-track data using combined TQIs and principal components as defect predictors. The performance of the predictors were compared using true and false positive rates. The results show that three principal components were better at predicting defects and revealing salient characteristics in track geometry data than combined TQIs even though there were some correlations that are potentially useful for track maintenance.