The joint estimation of respondent-reported certainty and acceptability with choice

In the stated choice literature, increasing attention has been paid to methods that seek to close the gap between the choices from these experiments and the choices experienced in the real world. Attempts to produce model estimates that are truer to real market behaviours are especially important for transportation, where many important policy decisions rely on such experiments. A recent approach that has emerged makes use of a certainty index whereby respondents report how certain they are about each choice they make. Additional literature also posits that when making decisions, people first identify an acceptable set of alternatives (alternative acceptability) such that a consideration set if formed and it is from this reduced set that the ultimate choice is made. This paper presents two models that jointly estimates choice and choice certainty and choice and alternative acceptability. This joint estimation allows the modeller to overcome potential endogeneity that may exist between these responses. In comparing choices of differing certainty, surprisingly little difference in marginal sensitivities are found. This is not the case in the alternative acceptability models however. An important finding of this research is that what could be interpreted as preference heterogeneity may in fact be more closely linked to scale. The ramifications of these results on future research are discussed.     

The influence of attitude towards individuals’ choice for a remotely piloted commercial flight: A latent class logit approach

The Remotely Piloted Commercial Passenger Aircraft Attitude Scale (RPCPAAS) was created to measure positive and negative attitudes towards a new and plausible form of air travel. This information was then used, in combination with a latent class logit model built on data generated from a stated choice experiment to gain insight into the choice behaviour between conventionally piloted aircraft (CPA) with a pilot on-board and remotely piloted aircraft (RPA) with a pilot on the ground. The results revealed that individuals, on-average, if presented a choice between a CPA and a RPA of equivalent attributes, would elect for the CPA option. However, there is variability in the passengers’ sensitivity to various flight attributes, and these sensitivities were influenced by individuals’ attitude towards the new technology (i.e., RPA). From an operational perspective, and assuming that one day passengers of commercial airlines are offered the choice between CPA and RPA, the strategies employed by airlines to encourage the use of the new technology need to be different, based on individuals’ attitude towards RPA.     

New insights on random regret minimization models

This paper develops new methodological insights on Random Regret Minimization (RRM) models. It starts by showing that the classical RRM model is not scale-invariant, and that – as a result – the degree of regret minimization behavior imposed by the classical RRM model depends crucially on the sizes of the estimated taste parameters in combination with the distribution of attribute-values in the data. Motivated by this insight, this paper makes three methodological contributions: (1) it clarifies how the estimated taste parameters and the decision rule are related to one another; (2) it introduces the notion of “profundity of regret”, and presents a formal measure of this concept; and (3) it proposes two new family members of random regret minimization models: the μRRM model, and the Pure-RRM model. These new methodological insights are illustrated by re-analyzing 10 datasets which have been used to compare linear-additive RUM and classical RRM models in recently published papers. Our re-analyses reveal that the degree of regret minimizing behavior imposed by the classical RRM model is generally very limited. This insight explains the small differences in model fit that have previously been reported in the literature between the classical RRM model and the linear-additive RUM model. Furthermore, we find that on 4 out of 10 datasets the μRRM model improves model fit very substantially as compared to the RUM and the classical RRM model.     

Promoting carsharing attractiveness and efficiency: An exploratory analysis

Carsharing has grown significantly over recent years. Understanding factors related to the usage and turnover rate of shared cars will help promote the growth of carsharing programs. This study sets station-based shared car booking requests and turnover rates as learning objectives, by which generalized additive mixed models are employed to examine various effects. The results are: (1) stations with more parking spaces, longer business hours and fewer nearby stations are likely to receive more booking requests and have a higher turnover rate; (2) an area with a higher population density, a higher percentage of adults, a higher percentage of males, a greater road density, or more mixed land use is associated with more car usage and a higher turnover rate; (3) stations nearby transit hubs, colleges, and shopping centers attract more shared car users; (4) shared cars are often oversupplied at transit hubs; (5) both transit proximity and housing price present high degrees of nonlinearity in relation to shared car usage and turnover rates. Findings provide evidence for optimizing the usage and efficiency of carsharing programs: carsharing companies should identify underserved areas to initiate new businesses; carsharing seems more competitive in a distance to a bus stop between 1.2 km and 2.4 km, and carsharing is more effectively served in areas with constraints in accessing metro services; carsharing should be optimally discouraged at transit hubs to avoid the oversupply of shared cars; local authorities should develop a location-based and geographically differentiated quota in managing carsharing programs.     

Robust supply vessel routing and scheduling

We solve the problem of tactical supply vessel planning arising in the upstream offshore petroleum logistics. Supply vessels deliver all the necessary materials and equipment to offshore installations from an onshore supply base according to a delivery schedule. The planning of supply vessels should be done so that their number is minimized and at the same time provide a reliable flow of supplies from the base. The execution of a weekly sailing plan is affected by weather conditions, especially in winter time. Harsh weather conditions increase the number of vessels required to perform the operations as well as the service times at the installations, and thus disrupt the schedule, leading to additional costs and reduced service level. We present a methodology for robust supply vessel planning enabling a trade-off analysis to be made between the schedules’ service level and vessels’ cost. The methodology involves the generation of multiple vessel schedules with different level of robustness using an adaptive large neighbourhood search metaheuristic and a subsequent discrete event simulation procedure for the assessment of the service level. To control the level of robustness we developed a concept of slacks and incorporated it into the metaheuristic algorithm.     

Solving the station-based one-way carsharing network planning problem with relocations and non-linear demand

One-way station-based carsharing systems allow users to return a rented car to any designated station, which could be different from the origin station. Existing research has been mainly focused on the vehicle relocation problem to deal with the travel demand fluctuation over time and demand imbalance in space. However, the strategic planning of the stations’ location and their capacity for one-way carsharing systems has not been well studied yet, especially when considering vehicle relocations simultaneously. This paper presents a Mixed-integer Non-linear Programming (MINLP) model to solve the carsharing station location and capacity problem with vehicle relocations. This entails considering several important components which are for the first time integrated in the same model. Firstly, relocation operations and corresponding relocation costs are taken into consideration to address the imbalance between trip requests and vehicle availability. Secondly, the flexible travel demand at various time steps is taken as the input to the model avoiding deterministic requests. Thirdly, a logit model is constructed to represent the non-linear demand rate by using the ratio of carsharing utility and private car utility. To solve the MINLP model, a customized gradient algorithm is proposed. The application to the SIP network in Suzhou, China, demonstrates that the algorithm can solve a real world large scale problem in reasonable time. The results identify the pricing and parking space rental costs as the key factors influencing the profitability of carsharing operators. Also, the carsharing station location and fleet size impact the vehicle relocation and carsharing patronage.     

Integrated scheduling of m-truck,m-drone,and m-depot constrained by time-window,drop-pickup,and m-visit using constraint programming

The idea of deploying unmanned aerial vehicles, also known as drones, for final-mile delivery in logistics operations has vitalized this new research stream. One conceivable scenario of using a drone in conjunction with a traditional delivery truck to distribute parcels is discussed in earlier literature and termed the parallel drone scheduling traveling salesman problem (PDSTSP). This study extends the problem by considering two different types of drone tasks: drop and pickup. After a drone completes a drop, the drone can either fly back to depot to deliver the next parcels or fly directly to another customer for pickup. Integrated scheduling of multiple depots hosting a fleet of trucks and a fleet of drones is further studied to achieve an operational excellence. A vehicle that travels near the boundary of the coverage area might be more effective to serve customers that belong to the neighboring depot. This problem is uniquely modeled as an unrelated parallel machine scheduling with sequence dependent setup, precedence-relationship, and reentrant, which gives us a framework to effectively consider those operational challenges. A constraint programming approach is proposed and tested with problem instances of m-truck, m-drone, m-depot, and hundred-customer distributed across an 8-mile square region.     

Flexing service schedules: Assessing the potential for demand-adaptive hybrid transit via a stated preference approach

This paper assesses the demand for a flexible, demand-adaptive transit service, using the Chicago region as an example. We designed and implemented a stated-preference survey in order to (1) identify potential users of flexible transit, and (2) inform the service design of the flexible transit mode. Multinomial logit, mixed-logit, and panel mixed-logit choice models were estimated using the data obtained from the survey. The survey instrument employed a d_p-efficient design and the Google Maps API to capture precise origins and destinations in order to create realistic choice scenarios. The stated-preference experiments offered respondents a choice between traditional transit, car, and a hypothetical flexible transit mode. Wait time, access time, travel time, service frequency, cost, and number of transfers varied across the choice scenarios. The choice model results indicate mode-specific values of in-vehicle travel time ranging between $16.3 per hour (car) and $21.1 per hour (flexible transit). The estimated value of walking time to transit is $25.9 per hour. The estimated value of waiting time at one’s point of origin for a flexible transit vehicle is $11.3 per hour; this value is significantly lower than the disutility typically associated with waiting at a transit stop/station indicating that the ‘at-home’ pick-up option of flexible transit is a highly desirable feature. The choice model results also indicate that respondents who use active-transport modes or public transit for their current commute trip, or are bikeshare members, were significantly more likely to choose flexible and traditional transit than car commuters in the choice experiments. The implications of these and other relevant model results for the design and delivery of flexible, technology-enabled services are discussed.     

Design and development of a hybrid ant colony-variable neighbourhood search algorithm for a multi-depot green vehicle routing problem

The traditional distribution planning problem in a supply chain has often been studied mainly with a focus on economic benefits. The growing concern about the effects of anthropogenic pollutions has forced researchers and supply chain practitioners to address the socio-environmental concerns. This research study focuses on incorporating the environmental impact on route design problem. In this work, the aim is to integrate both the objectives, namely economic cost and emission cost reduction for a capacitated multi-depot green vehicle routing problem. The proposed models are a significant contribution to the field of research in green vehicle routing problem at the operational level. The formulated integer linear programming model is solved for a set of small scale instances using LINGO solver. A computationally efficient Ant Colony Optimization (ACO) based meta-heuristic is developed for solving both small scale and large scale problem instances in reasonable amount of time. For solving large scale instances, the performance of the proposed ACO based meta-heuristic is improved by integrating it with a variable neighbourhood search.     

Willingness-to-pay for alternative fuel vehicle characteristics: A stated choice study for Germany

In the light of European energy efficiency and clean air regulations, as well as an ambitious electric mobility goal of the German government, we examine consumer preferences for alternative fuel vehicles (AFVs) based on a Germany-wide discrete choice experiment among 711 potential car buyers. We estimate consumers’ willingness-to-pay and compensating variation (CV) for improvements in vehicle attributes, also taking taste differences in the population into account by applying a latent class model with 6 distinct consumer segments. Our results indicate that about 1/3 of the consumers are oriented towards at least one AFV option, with almost half of them being AFV-affine, showing a high probability of choosing AFVs despite their current shortcomings. Our results suggest that German car buyers’ willingness-to-pay for improvements of the various vehicle attributes varies considerably across consumer groups and that the vehicle features have to meet some minimum requirements for considering AFVs. The CV values show that decision-makers in the administration and industry should focus on the most promising consumer group of ‘AFV aficionados’ and their needs. It also shows that some vehicle attribute improvements could increase the demand for AFVs cost-effectively, and that consumers would accept surcharges for some vehicle attributes at a level which could enable their private provision and economic operation (e.g. fast-charging infrastructure). Improvement of other attributes will need governmental subsidies to compensate for insufficient consumer valuation (e.g. battery capacity).