Optimizing departure times in vehicle routes

Most solution methods for the vehicle routing problem with time\ud windows (VRPTW) develop routes from the earliest feasible departure time. However, in practice, temporal traffic congestions make\ud that such solutions are not optimal with respect to minimizing the\ud total duty time. Furthermore, VRPTW solutions do not account for\ud complex driving hours regulations, which severely restrict the daily\ud travel time available for a truck driver. To deal with these problems,\ud we consider the vehicle departure time optimization (VDO) problem\ud as a post-processing step of solving a VRPTW. We propose an ILP-formulation that minimizes the total duty time. The obtained solutions are feasible with respect to driving hours regulations and they\ud account for temporal traffic congestions by modeling time-dependent\ud travel times. For the latter, we assume a piecewise constant speed\ud function. Computational experiments show that problem instances\ud of realistic sizes can be solved to optimality within practical computation times. Furthermore, duty time reductions of 8 percent can\ud be achieved. Finally, the results show that ignoring time-dependent\ud travel times and driving hours regulations during the development of\ud vehicle routes leads to many infeasible vehicle routes. Therefore, vehicle routing methods should account for these real-life restrictions

Vehicle routing under time-dependent travel times: the impact of congestion avoidance

Daily traffic congestions form major problems for businesses such\ud as logistical service providers and distribution firms. They cause\ud late arrivals at customers and additional hiring costs for the truck\ud drivers. The additional costs of traffic congestions can be reduced\ud by taking into account and avoid well-predictable traffic congestions\ud within off-line vehicle route plans. In the literature, various strategies\ud are proposed to avoid traffic congestions, such as selecting alternative routes, changing the customer visit sequences, and changing the\ud vehicle-customer assignments. We investigate the impact of these and\ud other congestion avoidance strategies in off-line vehicle route plans on\ud the performance of these plans in reality. For this purpose, we develop\ud a set of VRP instances on real road networks, and a speed model that\ud inhabits the main characteristics of peak hour congestion. The instances are solved for different levels of congestion avoidance using a\ud modified Dijkstra algorithm and a restricted dynamic programming\ud heuristic. Computational experiments show that 99% of late arrivals\ud at customers can be eliminated if traffic congestions are accounted for\ud off-line. On top of that, almost 70% of the extra duty times caused by\ud the traffic congestions can be eliminated by clever avoidance strategies

Vehicle Routing with Traffic Congestion and Drivers' Driving and Working Rules

For the intensively studied vehicle routing problem (VRP), two real-life restrictions have received only minor attention in the VRP-literature: traffic congestion and driving hours regulations. Traffic congestion causes late arrivals at customers and long travel times resulting in large transport costs. To account for traffic congestion, time-dependent travel times should be considered when constructing vehicle routes. Next, driving hours regulations, which restrict the available driving and working times for truck drivers, must be respected. Since violations are severely fined, also driving hours regulations should be considered when constructing vehicle routes, even more in combination with congestion problems. The objective of this paper is to develop a solution method for the VRP with time windows (VRPTW), time-dependent travel times, and driving hours regulations. The major difficulty of this VRPTW extension is to optimize each vehicle’s departure times to minimize the duty time of each driver. Having compact duty times leads to cost savings. However, obtaining compact duty times is much harder when time-dependent travel times and driving hours regulations are considered. We propose a restricted dynamic programming (DP) heuristic for constructing the vehicles routes, and an efficient heuristic for optimizing the vehicle’s departure times for each (partial) vehicle route, such that the complete solution algorithm runs in polynomial time. Computational experiments emonstrate the trade-off between travel distance minimization and duty time minimization, and illustrate the cost savings of extending the depot opening hours such that traveling before the morning peak and after the evening peak becomes possible

Analytical model for flux saturation in sediment transport

The transport of sediment by a fluid along the surface is responsible for dune formation, dust entrainment and for a rich diversity of patterns on the bottom of oceans, rivers, and planetary surfaces. Most previous models of sediment transport have focused on the equilibrium (or saturated) particle flux. However, the morphodynamics of sediment landscapes emerging due to surface transport of sediment is controlled by situations out-of-equilibrium. In particular, it is controlled by the saturation length characterizing the distance it takes for the particle flux to reach a new equilibrium after a change in flow conditions. The saturation of mass density of particles entrained into transport and the relaxation of particle and fluid velocities constitute the main relevant relaxation mechanisms leading to saturation of the sediment flux. Here we present a theoretical model for sediment transport which, for the first time, accounts for both these relaxation mechanisms and for the different types of sediment entrainment prevailing under different environmental conditions. Our analytical treatment allows us to derive a closed expression for the saturation length of sediment flux, which is general and can thus be applied under different physical conditions

Persuasive system design does matter: a systematic review of adherence to web-based interventions

Background: Although web-based interventions for promoting health and health-related behavior can be effective, poor adherence is a common issue that needs to be addressed. Technology as a means to communicate the content in web-based interventions has been neglected in research. Indeed, technology is often seen as a black-box, a mere tool that has no effect or value and serves only as a vehicle to deliver intervention content. In this paper we examine technology from a holistic perspective. We see it as a vital and inseparable aspect of web-based interventions to help explain and understand adherence. Objective: This study aims to review the literature on web-based health interventions to investigate whether intervention characteristics and persuasive design affect adherence to a web-based intervention. Methods: We conducted a systematic review of studies into web-based health interventions. Per intervention, intervention characteristics, persuasive technology elements and adherence were coded. We performed a multiple regression analysis to investigate whether these variables could predict adherence. Results: We included 101 articles on 83 interventions. The typical web-based intervention is meant to be used once a week, is modular in set-up, is updated once a week, lasts for 10 weeks, includes interaction with the system and a counselor and peers on the web, includes some persuasive technology elements, and about 50% of the participants adhere to the intervention. Regarding persuasive technology, we see that primary task support elements are most commonly employed (mean 2.9 out of a possible 7.0). Dialogue support and social support are less commonly employed (mean 1.5 and 1.2 out of a possible 7.0, respectively). When comparing the interventions of the different health care areas, we find significant differences in intended usage (p = .004), setup (p < .001), updates (p < .001), frequency of interaction with a counselor (p < .001), the system (p = .003) and peers (p = .017), duration (F = 6.068, p = .004), adherence (F = 4.833, p = .010) and the number of primary task support elements (F = 5.631, p = .005). Our final regression model explained 55% of the variance in adherence. In this model, a RCT study as opposed to an observational study, increased interaction with a counselor, more frequent intended usage, more frequent updates and more extensive employment of dialogue support significantly predicted better adherence. Conclusions: Using intervention characteristics and persuasive technology elements, a substantial amount of variance in adherence can be explained. Although there are differences between health care areas on intervention characteristics, health care area per se does not predict adherence. Rather, the differences in technology and interaction predict adherence. The results of this study can be used to make an informed decision about how to design a web-based intervention to which patients are more likely to adher

Optimizing departure times in vehicle routes

Most solution methods for the vehicle routing problem with time windows (VRPTW) develop routes from the earliest feasible departure time. In practice, however, temporary traffic congestion make such solutions non-optimal with respect to minimizing the total duty time. Furthermore, the VRPTW does not account for driving hours regulations, which restrict the available travel time for truck drivers. To deal with these problems, we consider the vehicle departure time optimization (VDO) problem as a post-processing of a VRPTW. We propose an ILP formulation that minimizes the total duty time. The results of a case study indicate that duty time reductions of 15% can be achieved. Furthermore, computational experiments on VRPTW benchmarks indicate that ignoring traffic congestion or driving hours regulations leads to practically infeasible solutions. Therefore, new vehicle routing methods should be developed that account for these common restrictions. We propose an integrated approach based on classical insertion heuristic

Evaluating traffic informers: Testing the behavioral and social-cognitive effects of an adolescent bicycle safety education program

AbstractIn The Netherlands, 12–24 years old are over-represented in the total number of traffic fatalities and injuries. In this study, the traffic informer program – designed to promote safe traffic behavior in the pre-driver population – was experimentally evaluated, with a specific focus on bicycle use. Students were subjected to graphic videos of traffic accidents and listened to a first-person narrative provided by a traffic accident victim. The influence of the program on concepts derived from the theory of planned behavior and protection motivation theory (attitudes, norms, self-efficacy, risk-perception, intention and behavior) was assessed. Students from various schools (N=1593;M age=15 years, SD=.84) participated in a quasi-experimental study, either in an experimental or a control group, completing self-report questionnaires one week prior to the program implementation and approximately one month after the program implementation. Mixed regression analyses showed significant positive and negative time×intervention interaction effects on attitude toward traffic violations, relative attitude toward traffic safety, and risk comparison, but not on intention and behavior. More research is needed to find effective behavioral change techniques (other than increasing risk awareness) for promoting safe traffic behavior in adolescents. Research is also needed to address how these can be translated into effective interventions and educational programs

A dynamic programming heuristic for vehicle routing with time-dependent travel times and required breaks.

For the intensively studied vehicle routing problem (VRP), two real-life restrictions have received only minor attention in the VRP-literature: traffic congestion and driving hours regulations. Traffic congestion causes late arrivals at customers and long travel times resulting in large transport costs. To account for traffic congestion, time-dependent travel times should be considered when constructing vehicle routes. Next, driving hours regulations, which restrict the available driving and working times for truck drivers, must be respected. Since violations are severely fined, also driving hours regulations should be considered when constructing vehicle routes, even more in combination with congestion problems. The objective of this paper is to develop a solution method for the VRP with time windows (VRPTW), time-dependent travel times, and driving hours regulations. The major difficulty of this VRPTW extension is to optimize each vehicle’s departure times to minimize the duty time of each driver. Having compact duty times leads to cost savings. However, obtaining compact duty times is much harder when time-dependent travel times and driving hours regulations are considered. We propose a restricted dynamic programming (DP) heuristic for constructing the vehicle routes, and an efficient heuristic for optimizing the vehicle’s departure times for each (partial) vehicle route, such that the complete solution algorithm runs in polynomial time. Computational experiments demonstrate the trade-off between travel distance minimization and duty time minimization, and illustrate the cost savings of extending the depot opening hours such that traveling before the morning peak and after the evening peak becomes possible