Modelling Complex Activity‐Travel Scheduling Decisions: Procedure for the Simultaneous Estimation of Activity Generation and Duration Functions

Abstract

Activity generation is a key factor in individual's choices of trip frequency and trip purpose. This paper describes the results of an experiment conducted to estimate functions of several temporal factors on individuals' propensity to schedule a given activity on a given day. The theory on which the experimental design is based states that the probability of scheduling an activity is a complex and continuous function of how long ago the activity was lastly performed, the duration constraints for the activity and the amount of available time in the activity schedule of the day considered. Aurora, an existing model of activity scheduling, assumes S‐shaped utility functions for the history as well as the duration functions, whereas most time‐use studies assume monotonically decreasing marginal utilities. The stated‐choice experiment involves a range of flexible activities and a large sample of individuals to measure the utility effects of a set of carefully chosen levels for the factors and tests these specific assumptions. The results suggest that the amount of discretionary time on a day has no significant impact on the scheduling decisions provided that enough time is available for the activity. The effects of other factors are as expected and show diminishing marginal utilities. We find mixed evidence for an initial phase of increasing marginal returns as assumed in an S‐shaped function.     

Modelling the joint choice of activity timing and duration

This paper develops a model of activity and trip scheduling that combines three elements that have to date mostly been investigated in isolation: the duration of activities, the time-of-day preference for activity participation and the effect of schedule delays on the valuation of activities. The model is an error component discrete choice model, describing individuals’ choice between alternative workday activity patterns. The utility function is formulated in a flexible way, applying a bell-shaped component to represent time-of-day preferences for activities. The model was tested using a 2001 data set from the Netherlands. The estimation results suggest that time-of-day preferences and schedule delays associated with the work activity are the most important factors influencing the scheduling of the work tour. Error components included in the model suggest that there is considerable unobserved heterogeneity with respect to mode preferences and schedule delay.     

An empirical investigation on the dynamic processes of activity scheduling and trip chaining

Investigation of the dynamic processes of activity scheduling and trip chaining has been an interest of transportation researchers over the past decade because of its relevance to the effectiveness of congestion management and intelligent transportation systems. To empirically examine the processes, a computerized survey instrument is developed to collect household activity scheduling data. The instrument is unique in that it records the evolution of activity schedules from intentions to final outcomes for a weekly period. This paper summarizes the investigation on the dynamic processes of activity scheduling and trip chaining based on data collected from a pilot study of the instrument. With the data, ordered logit models are applied to identify factors that are pertinent to the scheduling horizon of activities. Results of the empirical analysis show that a daily schedule often starts with certain activities occupying a portion of the schedule and other activities are then arranged around these pre-occupants. Activities of shorter duration are more likely to be opportunistically inserted in a schedule already anchored by their longer duration counterparts. Persons with children often expect more constraining activities than those with no children. The analysis also shows that female respondents tend to be more structured in terms of how the week is planned. Additionally, analysis of travel patterns reveals that many trip-chains are formed opportunistically. Travel time required to reach an activity is positively related to the scheduling horizon for the activity, with more distant stops being planned earlier than closer locations.     

On the structure of weekly activity/travel patterns

Understanding the process of activity scheduling is a critical pre-requisite to an understanding of changes in travel behavior. To examine this process, a computerized survey instrument was developed to collect household activity scheduling data. The instrument is unique in that it records the evolution of activity schedules from intentions to final outcomes for a weekly period. This paper summarizes an investigation of the structure of activity/travel patterns based on data collected from a pilot study of the instrument. The term “structure” refers to the sequence by which various activities enter one’s daily activity scheduling process. Results of the empirical analyses show that activities of shorter duration were more likely to be opportunistically inserted in a schedule already anchored by their longer duration counterparts. Additionally, analysis of travel patterns reveals that many trip-chains were formed opportunistically. Travel time required to reach an activity was positively related to the scheduling horizon for the activity, with more distant stops being planned earlier than closer locations.     

The Vehicle Routing Problem: The Case of the Hong Kong Postal Service

Abstract

With the growth in population and development of business activities in Hong Kong, the range and level of services provided by Hongkong Post have multiplied. However, the schedule of its postal vehicles, including mail collection and delivery, is still constructed manually on a daily basis, based on the experience of staff and transportation reviews. In this paper, the problem of scheduling a set of n collection points (District Post Offices) from a depot (General Post Office) in Hong Kong Island is addressed. The objectives pursued are the maximization of resource utilization and minimization of operation costs. In other words, the variable cost is expected to be reduced. To achieve these goals, an integer linear programming (IP) model of the vehicle routing problem (VRP) is developed in an effort to obtain optimal solutions. As the model involves computational complexity, a commercial software package CPLEX is used to solve the problems efficiently. The results show that the proposed model can produce optimal vehicle routes and schedules.     

Statistical and activity-based modeling of university student travel behavior

Abstract

This paper conducts a statistical analysis of student travel behavior at Virginia Commonwealth University (VCU). The data source is the ‘University NHTS’ project launched by the Virginia Department of Transportation (VDOT) in 2009. Through this empirical study, it has been found that university student travel behavior is different from that of the general population; urban universities have lower percentages of nonmotorized trips than college-town universities; undergraduate students are likely to make more daily trips than graduate students – similarly, on-campus students make more frequent trips than off-campus students; the most frequent student activities are home and academic activities; and student group categories have virtually no impact on daily activity profiles, though activity types do have a dramatic impact on daily activity profiles. Based on these research findings, the paper makes a series of recommendations regarding trip generation, trip distribution, mode choice, and activity-based modeling.     

The effect of location,mobility and socio-demographic factors on task and time allocation of households

This paper investigates the role of location factors in task and time allocation at the household level. It is hypothesized that, if time constraints are less binding as a result of living in an urban area or owning more cars, spouses engage more often and longer in out-of-home activities and schedule their activities more independently. The hypotheses are tested with logistic and Cox regression models of activity participation and time allocation on a data set collected in the Amsterdam–Utrecht region in the Netherlands. Results suggest that the hypotheses are supported with respect to specific household activity scheduling decisions.     

Modeling activity conflict resolution strategies using scheduling process data

Developments in activity scheduling process data have recently allowed for much improvement and validation of rule-based activity scheduling models. The use of actual scheduling process data allows for a potentially more realistic model in terms of how the travel episodes are actually derived. Since these types of models are simulations of the scheduling process, scheduling conflicts naturally arise in the creation of the final schedule. The handling of these scheduling conflicts is a critical component of all rule-based activity models. Many of these models rely on the concept of priority of the activities to resolve conflicts. However, recent research has shown that this is often not how conflicts are actually resolved. In order to more accurately model actual conflict resolution behavior, scheduling process data was used to estimate conflict resolution rules using decision trees. The use of a conflict resolution model allows the strategy chosen to depend on the attributes of the individual and the conflicting activities, rather than assuming a prior definition of precedence based on the activity types. The conflict resolution decision showed reasonable ability to predict the resolution strategy chosen in actual scheduling process survey data, and represents an important advance in developing a functional computational process model of activity scheduling.     

An optimization approach to resolve activity scheduling conflicts in ADAPTS activity-based model

Activity conflict resolution as the core of scheduling process in activity-based modeling is a challenging step because the activity diary databases mostly report the outcome of the scheduling decisions and often fail to capture key factors influencing the resolution process itself. Consequently, most activity-based frameworks ignore modeling this process by using either predefined set of activity patterns or priority-based assumptions to schedule daily activities and prevent conflict occasions. ADAPTS is one of the few activity-based models that attempts to simulate the process of activity scheduling and resolve the conflicts as they occur. This paper advances the current rule-based conflict resolution model of ADAPTS by implementing an advanced and flexible non-linear optimization model. A set of linear optimization sub-models is then proposed that together perform the same task as the non-linear model, however they are much easier to implement and maintain, while fast to run and flexible to extend. The proposed approach defines an objective function, which aims to minimize the extent of changes in timing and duration of conflicting activities, while fitting them in the schedule. Comparing performance of the proposed model with TASHA scheduler and former resolution module of ADAPTS using CHASE scheduling process data reveals significant improvement in fitting the newly planned activities in the schedules with the minimal modifications in the timing and duration of activities.     

A multi-instrumented approach to observing the activity rescheduling decision process

Activity scheduling simulation models represent an emerging and proposing approach to forecasting travel demand. The most significant developmental challenge is the lack of empirical data on how people actually proceed through the scheduling and conflict resolution process. This paper develops a new methodology to collect data about the rescheduling decision process. The data collection involves six stages: preplanned schedule interview, coding of the preplanned schedule, second-by-second Global Positioning System tracking, internet-based prompted recall diary, detection of rescheduling decisions (via comparison of planned versus executed activities), and a final in-depth interview probing the how and why of rescheduling decisions. Each stage of the methodology is described in detail with example results drawn from a pilot study. Key discoveries include: elicitation of multiple preplanned schedule reporting methods (verbal, point-form, calendar); discovery that activity attributes (time, location, involved persons) are planned on significantly different time horizons and include partial elaboration; and provision of new insights into how and why rescheduling decisions are made. A method for automatically tracking rescheduling decisions was also discovered. Overall, the new methodology has potential to contribute to the development of more realistic models of the entire scheduling process, especially rescheduling and conflict resolution sub-models.     

Future electricity demand from battery‐powered vehicles

An important decision faced by airline schedulers is how to adapt the flight schedule and aircraft assignment to unforeseen perturbations in an established schedule. In the face of unforeseen aircraft delays, schedulers have to decide which flights to delay, and when delays become excessive, which to cancel. Current scheduling models deal with simple decision problems of delay or cancellation, but not with both simultaneously. But in practice the optimal decision may involve results from the integration of both flight cancellations and delays. In Part I of this paper, a quadratic programming model for the integration decision problem is given. The model can formulate the integration of flight cancellations and delays as well as some special cases, such as the ferrying of surplus aircraft and the possibility of swapping different types of aircraft. In this paper, based on the special structure of the model, an effective algorithm is presented, sufficient computational experiments are conducted and some results are reported. These show that we can expect to obtain a sufficiently good solution in terms of reasonable CPU time.     

A multiple discrete-continuous model for independent- and joint-discretionary-activity participation decisions

This paper presents a multiple discrete-continuous econometric structure to model the daily time-investment decisions of couples in solo- and joint-discretionary activities incorporating intra-personal and inter-personal inter-dependencies. The empirical model was estimated using data from the 2000 Bay Area Travel Survey. The results indicate evidence of the positive impact of vehicle availability on independent activity participation and the negative impacts of the presence of children and mandatory time investments on the joint discretionary-activity engagement of the spouses. In addition, we also find the mandatory- and maintenance-activity-participation characteristics of the spouse to influence the discretionary activity choices of individuals. Finally, the analysis also indicates a strong impact of common unobserved factors on the decisions of couples. From a policy analysis perspective, these results imply that demand-management actions directly impacting one adult could also result in changes to the activity patterns of his/her spouse and to changes in joint activity participation characteristics. Dr. Sivaramakrishnan Srinivasan is an Assistant Professor in the Department of Civil and Coastal Engineering at the University of Florida. His research interests include travel-behavior analysis, activity-based travel-demand modeling, and the application of advanced econometric methods for transportation problems. Dr. Chandra R. Bhat has contributed toward the development of advanced econometric techniques for travel behavior analysis, in recognition of which he received the 2004 Walter L. Huber Award and the 2005 James Laurie Prize from the American Society of Civil Engineers (ASCE).     

Determining the effects of scheduling on automated automobile guideway utilization

This paper develops an analytic approach for measuring the effect of vehicle scheduling and of metering methods required to balance entrance rates among stations on lane capacity utilization of automated automobile guideways. The scheduling process at each entrance is represented by a probabilistic model which generates a system of nonlinear equations. The solution of this system yields the maximum steady state input rates at the entrances to the guideway system. The method developed is applicable to network configurations in which a small number of merges must be scheduled for each vehicle before it enters the guideway. It is demonstrated by application to a corridor guideway serving a major activity center during peak inbound demand, and also it is shown how the approach may be extended to more complex networks.     

Exploring the propensity to perform social activities: a social network approach

Conceptual and empirical models of the propensity to perform social activity–travel behavior are described, which incorporate the influence of individuals’ social context, namely their social networks. More explicitly, the conceptual model develops the concepts of egocentric social networks, social activities, and social episodes, and defines the three sets of aspects that influence the propensity to perform social activities: individuals’ personal attributes, social network composition, and information and communication technology interaction with social network members. Using the structural equation modeling (SEM) technique and data recently collected in Toronto, the empirical model tests the effect of these three aspects on the propensity to perform social activities. Results suggest that the social networks framework provides useful insights into the role of physical space, social activity types, communication and information technology use, and the importance of “with whom” the activity was performed with. Overall, explicitly incorporating social networks into the activity–travel behavior modeling framework provides a promising framework to understand social activities and key aspects of the underlying behavioral process. Juan Antonio Carrasco a PhD candidate in Civil Engineering at the University of Toronto, holds a MSc degree in Transportation Engineering from the Pontificia Universidad Católica de Chile. His doctoral research explores the relationships between social networks, activity–travel behavior, and ICTs. His research interests also include microsimulation, land use-transportation, and econometric modeling. Eric J. Miller is Bahen-Tanenbaum Professor of Civil Engineering at the University of Toronto where he is also Director of the Joint Program in Transportation. His research interests include integrated land-use/transportation modeling, activity-based travel modeling, microsimulation and sustainable transportation planning.     

The use of GIS and relational database management systems to improve the scheduling operations of paratransit

The scheduling operations of many paratransit agencies in the United States are undertaken manually. Those customers who are eligible to travel call in their requests the day before the trip is needed. As the trip requests are received, they are entered into a list of unscheduled trips. In order to schedule these trips, the scheduler must first determine the number of drivers and shuttle buses that are available as well as the time of availability of each. The scheduler must then try to match the rides that are in “similar” areas around the “same” time to place together on the driver's schedule. As new trip requests are made, the schedulers must adjust the trips that are already scheduled to try and schedule as many trips as possible in the most efficient way.

By developing a system that would improve the scheduling system operations of, in this case, DART (Delaware Administration for Regional Transit) First State Paratransit, customers can expect to receive better service that will improve their ability to travel throughout the community. Some devices that could also improve the operations of paratransit agencies are described in this paper, such as satellite‐based Global Positioning System (GPS), radio communication systems, mobile computers, radio frequency‐based data communication systems, internet web pages, automated paratransit information systems, and card‐based data storage and transfer media. However, because paratransit systems are difficult to operate cost‐efficiently, the optimum and most cost‐efficient device must be selected. The system chosen for DART First State Paratransit includes the use of a relational database management system (RDMS) and a transportation Geographic Information System (GIS). RDMS keeps track of the database information as well as the scheduled trips and the GIS is ideal for analyzing both geographic and temporal data. This system is shown to be superior to the manual system.     

Traveler delay costs and value of time with trip chains, flexible activity scheduling and information

The delay costs of traffic disruptions and congestion and the value of travel time reliability are typically evaluated using single trip scheduling models, which treat the trip in isolation of previous and subsequent trips and activities. In practice, however, when activity scheduling to some extent is flexible, the impact of delay on one trip will depend on the actual and predicted travel time on itself as well as other trips, which is important to consider for long-lasting disturbances and when assessing the value of travel information. In this paper we extend the single trip approach into a two trips chain and activity scheduling model. Preferences are represented as marginal activity utility functions that take scheduling flexibility into account. We analytically derive trip timing optimality conditions, the value of travel time and schedule adjustments in response to travel time increases. We show how the single trip models are special cases of the present model and can be generalized to a setting with trip chains and flexible scheduling. We investigate numerically how the delay cost depends on the delay duration and its distribution on different trips during the day, the accuracy of delay prediction and travel information, and the scheduling flexibility of work hours. The extension of the model framework to more complex schedules is discussed.     

Optimal tank-trailer routing using the ILOG constraint programming – a Taiwan case study

Abstract

This paper investigates the routing of pressurized tank trailers and proposes a scheduling plan which ensures the practical delivery of industrial gases under the objective of reducing transportation costs. Using constraint programming, we solve a combinatorial optimization problem that incorporates both hard and soft constraints for routing and scheduling tank trailers. Hard constraints are resource and safety/regulation constraints, whereas soft constraints are utilization and efficiency constraints. This approach enables tank-trailer routing and scheduling management to consider different combinations of parameters and view the results in ‘real-time.’ The routing and scheduling results based on a case study in Taiwan fulfil the goals of avoiding risks associated with transporting industrial gases, and attaining efficient delivery while conforming to regulations and consistent with good business practice. The results also suggest that significant economies in distribution costs are possible.     

Bus maintenance systems and maintenance scheduling: model formulations and solutions

This paper deals with the problem of scheduling bus maintenance activities. The scheduling of maintenance activities is an important component in bus transit operations planning process. The other components include network route design, setting timetables, scheduling vehicles, and assignment of drivers. This paper presents a mathematical programming approach to the problem. This approach takes as input a given daily operating schedule for all buses assigned to a depot along with available maintenance resources. It, then, attempts to design daily inspection and maintenance schedules for the buses that are due for inspection so as to minimize the interruptions in the daily bus operating schedule, and maximize the utilization of the maintenance facilities. Three integer programming formulations are presented and different properties of the problem are discussed. Several heuristic methods are presented and tested. Some of these procedures produce very close to optimal solutions very efficiently. In some cases, the computational times required to obtain these solutions are less than 1% of the computational time required for the conventional branch and bound algorithm. Several small examples are offered and the computational results of solving the problem for an actual, 181-bus transit property are reported.     

Prospects for computer aided railway scheduling: perspectives from users and parallels from mass transit

Railway scheduling faces new challenges as competition and, in many parts of the world, privatisation require ever better results, both in terms of minimising the resources used and maximising the performance achieved by those resources. It is therefore surprising that in practice railway scheduling tasks appear to be performed largely without the use of optimizing models. This paper takes two different perspectives, a case study of user needs from the UK railway industry and a comparative analysis with mass transit scheduling systems, to consider why this might be and assesses what the future prospects are for computer aided railway scheduling.

A number of conclusions are drawn: that optimization models need to be integrated with software packages that meet schedulers' data management needs; that researchers need to work with commercial developers to achieve this integration; that there needs to be an emphasis on extending models to cover more real‐life circumstances; and that solutions with international applicability should be sought.     

Heuristic approach to the airline schedule disturbances problem

Abstract

When disturbances make it impossible to realise the planned flight schedule, the dispatcher at the airline operational centre defines a new flight schedule based on airline policy, in order to reduce the negative effects of these perturbations. Depending on airline policy, when designing the new flight schedule, the dispatcher delays or cancels some flights and reassigns some flights to available aircraft. In this paper, a decision support system (DSS) for solving the airline schedule disturbances problem is developed aiming to assist decision makers in handling disturbances in real-time. The system is based on a heuristic algorithm, which generates a list of different feasible schedules ordered according to the value of an objective function. The dispatcher can thus select and implement one of them. In this paper, the possibilities of DSS are illustrated by real numerical examples that concern JAT Airways' flight schedule disturbances.