The Japanese experience with mini‐cars

Despite the early appeal of the light vehicle, increases in the average annual income have allowed consumers to consider a broader range of vehicles so that the negative aspects of mini‐vehicles such as higher noise and vibration levels, the lack of horsepower and instability in certain driving conditions have made light vehicles less tolerable. The “oil shock” shattered economic projections, and people began to acknowledge that living in a world with limited resources was a harsh reality. Concurrently, congestion increased dramatically in urban areas as a result of the popularity of automobiles, and producers made a number of design changes to improve the safety and comfort limitations of light vehicles. Thus, in a world where fuel economy and ease of use gained a greater meaning, light vehicles slowly regained their original appeal.

Light vehicles may play a greater role in the future. Studies indicate that light vehicles tend to be driven by females and elderly people and current trends indicate that the number of female drivers is increasing and that the average age of the Japanese population is getting higher. Furthermore, migration patterns indicate that a greater number of people are moving to smaller cities and their outlying areas as a result of national decentralization policies. The migration pattern may popularize light vehicles because vehicle ownership rates are higher in these areas than in larger cities. Another development which may increase the popularity of light vehicles is that more families are owning more than one car and light vehicles are popular as second vehicles. Moreover, the prospects of low economic growth have tempered the importance of comfortable amenities, and the virtues of maneuverability and fuel economy have become more important.

     

Scheduling freight trains traveling on complex networks

In the US, freight railways are one of the major means to transport goods from ports to inland destinations. According to the Association of American Railroad’s study, rail companies move more than 40% of the nation’s total freight. Given the fact that the freight railway industry is already running without much excess capacity, better planning and scheduling tools are needed to effectively manage the scarce resources, in order to cope with the rapidly increasing demand for railway transportation. This research develops optimization-based approaches for scheduling of freight trains. Two mathematical formulations of the scheduling problem are first introduced. One assumes the path of each train, which is the track segments each train uses, is given and the other one relaxes this assumption. Several heuristics based on mixtures of the two formulations are proposed. The proposed algorithms are able to outperform two existing heuristics, namely a simple look-ahead greedy heuristic and a global neighborhood search algorithm, in terms of railway total train delay. For large networks, two algorithms based on the idea of decomposition are developed and are shown to significantly outperform two existing algorithms.     

Equilibrium at a bottleneck when long-run and short-run scheduling preferences diverge

We consider the use of a Vickrey road bottleneck in the context of repetitive scheduling choices, distinguishing between long-run and short-run scheduling preferences. The preference structure reflects that there is a distinction between the (exogenous) ‘long-run preferred arrival time’, which would be relevant if consumers were unconstrained in the scheduling of their activities, and the ‘short-run preferred arrival time’, which is the result of an adaptation of travel routines in the face of constraints caused by, in particular, time-varying congestion levels. We characterize the unpriced equilibrium, the social optimum as well as second-best situations where the availability of the pricing instruments is restricted. All of them entail a dispersed distribution of short-run preferred arrival times. We obtain the intriguing results that the dispersion is lower in the social optimum than in the unpriced equilibrium, and that the application of first-best short-run tolls does not induce efficient long-run choices of travel routines.     

作业车间调度问题的改进遗传算法

研究了作业车间调度问题，并提出了一种新的求解方法，将邻域搜索与遗传算法相结合，提高遗传算法的局部搜索能力，加速进化过程，详细论述了该方法的优越性．     

基于多代理机制的车间作业调度算法动态混合生成策略

针对根据具体问题设计调度算法很难适应变化的生产作业调度问题,本文提出了基于多代理机制的车间作业调度算法动态混合生成策略,该策略根据具体的生产任务,判断生产类型,继而根据问题动态生成算法,对问题进行计算,形成调度序列,使得生产调度算法能够更好地适应动态变化的车间生产环境.通过仿真实验,验证了本系统的有效性.     

Optimal scheduling of a taxi fleet with mixed electric and gasoline vehicles to service advance reservations

This study addresses the problem of scheduling a fleet of taxis that are appointed to solely service customers with advance reservations. In contrast to previous studies that have dealt with the planning and operations of a taxi fleet with only electric vehicles (EVs), we consider that most taxi companies may have to operate with fleets comprised of both gasoline vehicles (GVs) and plug-in EVs during the transition from GV to (complete) EV taxi fleets. This paper presents an innovative multi-layer taxi-flow time-space network which effectively describes the movements of the taxis in the dimensions of space and time. An optimization model is then developed based on the time-space network to determine an optimal schedule for the taxi fleet. The objective is to minimize the total operating cost of the fleet, with a set of operating constraints for the EVs and GVs included in the model. Given that the model is formulated as an integer multi-commodity network flow problem, which is characterized as NP-hard, we propose two simple but effective decomposition-based heuristics to efficiently solve the problem with practical sizes. Test instances generated based on the data provided by a Taiwan taxi company are solved to evaluate the solution algorithms. The results show that the gaps between the objective values of the heuristic solutions and those of the optimal solutions are less than 3%, and the heuristics require much less time to obtain the good quality solutions. As a result, it is shown that the model, coupled with the algorithms, can be an effective planning tool to assist the company in routing and scheduling its fleet to service reservation customers.     

Closing the loop in real-time railway control: Framework design and impacts on operations

Railway traffic is heavily affected by disturbances and/or disruptions, which are often cause of delays and low performance of train services. The impact and the propagation of such delays can be mitigated by relying on automatic tools for rescheduling traffic in real-time. These tools predict future track conflict based on current train information and provide suitable control measures (e.g. reordering, retiming and/or rerouting) by using advanced mathematical models. A growing literature is available on these tools, but their effects on real operations are blurry and not yet well known, due to the very scarce implementation of such systems in practice.In this paper we widen the knowledge on how automatic real-time rescheduling tools can influence train performance when interfaced with railway operations. To this purpose we build up a novel traffic control framework that couples the state-of-the art automatic rescheduling tool ROMA, with the realistic railway traffic simulation environment EGTRAIN, used as a surrogate of the real field. At regular times ROMA is fed with current traffic information measured from the field (i.e. EGTRAIN) in order to predict possible conflicts and compute (sub) optimal control measures that minimize the max consecutive delay on the network. We test the impact of the traffic control framework based on different types of interaction (i.e. open loop, multiple open loop, closed loop) between the rescheduling tool and the simulation environment as well as different combinations of parameter values (such as the rescheduling interval and prediction horizon). The influence of different traffic prediction models (assuming e.g. aggressive versus conservative driving behaviour) is also investigated together with the effects on traffic due to control delays of the dispatcher in implementing the control measures computed by the rescheduling tool.Results obtained for the Dutch railway corridor Utrecht–Den Bosch show that a closed loop interaction outperforms both the multiple open loop and the open loop approaches, especially with large control delays and limited information on train entrance delays and dwell times. A slow rescheduling frequency and a large prediction horizon improve the quality of the control measure. A limited control delay and a conservative prediction of train speed help filtering out uncertain traffic dynamics thereby increasing the effectiveness of the implemented measures.     

A bi-objective approach to routing and scheduling maritime transportation of crude oil

Maritime transportation, the primary mode for intercontinental movement of crude oil, accounts for 1.7 billion tons annually – bulk of which are carried via a fleet of large crude oil tankers. Although spectacular episodes such as Exxon Valdez underline the significant risk and tremendous cost associated with marine shipments of hazardous materials, maritime literature has focused only on the cost-effective scheduling of these tankers. It is important that oil transport companies consider risk, since the insurance premiums is contingent on the expected claim. Hence through this work, we present a mixed-integer optimization program – with operating cost and transport risk objectives, which could be used to prepare routes and schedules for a heterogeneous fleet of crude oil tankers. The bi-objective model was tested on a number of problem instances of realistic size, which were further analyzed to conclude that the cheapest route may not necessarily yield the lowest insurance premiums, and that larger vessels should be used if risk is more important as it enables better exploitation of the risk structure.     

How flexible is flexible? Accounting for the effect of rescheduling possibilities in choice of departure time for work trips

In departure time studies it is crucial to ascertain whether or not individuals are flexible in their choices. Previous studies have found that individuals with flexible work times have a lower value of time for late arrivals. Flexibility is usually measured in terms of flexible work start time or in terms of constraints in arrival time at work. Although used for the same purpose, these two questions can convey different types of information. Moreover, constraints in departure time are often related not only to the main work activity, but to all daily activities. The objective of this paper is to investigate the effect of constraints in work and in other daily trips/activities on the willingness to shift departure time and the willingness to pay for reducing travel time and travel delay. We set up a survey to collect detailed data on the full 24-hour out-of-home activities and on the constraints for each of these activities. We then built a stated preference experiment to infer preferences on departure time choice, and estimated a mixed logit model, based on the scheduling model, to account for the effects of daily activity schedules and their constraints. Our results show that measuring flexibility in terms of work start time or constraints at work does not provide exactly the same information. Since one-third of the workers with flexible working hours in the survey indicated that they have restrictions on late work-arrival times, their willingness to pay will be overestimated (almost doubled) if flexibility information is asked only in terms of fixed/flexible working hours. This clearly leads to different conclusion in terms of demand sensitivity to reschedule to a later departure time. We also found that having other activities and constraints during the day increases the individuals’ willingness to pay to avoid being late at work, where the presence of constraints on daily activities other than work is particularly relevant for individuals with no constraints at work. The important impact of these findings is that if we neglect the presence of constraints, as is common practise in transport models, it will generally lead to biased value-of-time estimates. Results clearly show that the shift in the departure time, especially towards a late departure time, is strongly overestimated (the predicted shift is more than double) when the effect of non-work activities and their constraints is not accounted for.     

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.