Time windows in workers' activity patterns: Empirical evidence from the Netherlands

This paper assumes that activities at the home and work location are important determinants of individuals' paths through time and space. Fixed activities at these locations determine to a large extent the duration and timing of time windows – blocks of time available for participation in travel and out-of-home non-work activities. Taking the time spent at home and at the workplace as a starting point, this paper classifies activity patterns on workdays into six groups with distinct home- and work-stay patterns. For this, data are used from the 1998 Netherlands National Travel Survey. The six clusters vary in terms of the duration and timing of time windows and some of the differences can be explained by commute characteristics, types of non-work activities performed, workers' sociodemographic attributes, and their spatiotemporal environment. However, the impact of sociodemographic and spatiotemporal variables on cluster membership is shown to be weak.     

分段矩形天窗对京沪高速铁路通过能力影响分析

本文以高速铁路天窗分段为基本研究单位,按照沿线途中大站将京沪高速铁路划分为若干天窗分段,分析天窗分段对列车运行的影响时间范围。在统计列车平均停站系数、停站时分和起停车附加时分等参数的基础上,计算列车一次停站的能力扣除系数以及天窗影响时间范围内通过能力的扣除值,得出京沪高速铁路在开设分段矩形天窗时线路通过能力的理论值以及限制区段。     

Liner ship route schedule design with port time windows

This paper examines a practical tactical liner ship route schedule design problem, which is the determination of the arrival and departure time at each port of call on the ship route. When designing the schedule, the availability of each port in a week, i.e., port time window, is incorporated. As a result, the designed schedule can be applied in practice without or with only minimum revisions. This problem is formulated as a mixed-integer nonlinear nonconvex optimization model. In view of the problem structure, an efficient holistic solution approach is proposed to obtain global optimal solution. The proposed solution method is applied to a trans-Atlantic ship route. The results demonstrate that the port time windows, port handling efficiency, bunker price and unit inventory cost all affect the total cost of a ship route, the optimal number of ships to deploy, and the optimal schedule.     

带时间窗的混和车辆路径问题的优化算法研究

文章针对带时间窗约束的混合车辆路径问题的特点,建立了带时间窗的混合车辆路径问题的数学模型,并设计了变邻域禁忌搜索算法对该问题进行求解。通过标准算例测试及与现有文献计算结果的比较,验证了该算法的有效性。     

The Pollution-Routing Problem

The amount of pollution emitted by a vehicle depends on its load and speed, among other factors. This paper presents the Pollution-Routing Problem (PRP), an extension of the classical Vehicle Routing Problem (VRP) with a broader and more comprehensive objective function that accounts not just for the travel distance, but also for the amount of greenhouse emissions, fuel, travel times and their costs. Mathematical models are described for the PRP with or without time windows and computational experiments are performed on realistic instances. The paper sheds light on the tradeoffs between various parameters such as vehicle load, speed and total cost, and offers insight on economies of ‘environmental-friendly’ vehicle routing. The results suggest that, contrary to the VRP, the PRP is significantly more difficult to solve to optimality but has the potential of yielding savings in total cost.     

有交通条件约束与软时间窗约束的配送配载模型算法研究

由于配送中客户的时间窗限制和车辆在运行过程中的交通条件约束,给配送中心的运营调度工作增加了新的难题,为此建立了在该约束条件下的车辆配送配载模型。通过在路径选择时考虑交通条件约束、在建立目标函数时以阈值的形式引入时间窗约束,对原始模型进行了拓展．并构造了该问题的遗传算法。     

Windows 2000并口EPP模式驱动程序的设计与实现

Windows2000下，用户模式应用程序不能直接访问硬件设备，需要通过内核模式驱动程序实现。本文介绍PC机在Windows2000操作系统下，使用Nm9835芯片，完成并行端口EPP模式的数据和地址读写操作的WDM模型设备驱动程序的设计与实现过程，以及驱动程序与用户模式应用程序的通信机制。     

有交通条件约束与软时间窗约束的配送配载模型算法研究

由于配送中客户的时间窗限制和车辆在运行过程中的交通条件约束，给配送中心的运营调度工作增加了新的难题，为此建立了在该约束条件下的车辆配送配载模型。通过在路径选择时考虑交通条件约束、在建立目标函数时以阈值的形式引入时间窗约束，对原始模型进行了拓展，并构造了该问题的遗传算法。     

带时间窗约束的道路危险品运输路径选择研究

对已有危险品运输模型进行分析,针对当前危险品类物流配送网络的特点,提出了在时间窗约束条件下城市道路网络中的危险品配送模型,该模型以整个网络中事故发生的期望和影响人数最小为目标。设计了目标集成方法和对集成后目标函数求解的扩展标号法来计算该多目标问题的Pareto最优折衷解,最后用实例对算法进行了验证。     

带软时间窗车辆路径问题及禁忌搜索算法

考虑不同容量和运输成本的多车型车辆,建立容量限制和软时间约束,并以最小化车辆在路段上的运输量和该路段的长度乘积为目标的数学模型,给出求解该问题的禁忌搜索算法。在算法中考虑使用车辆最少的插入算法生成初始解。最后,通过仿真算例,检验模型和算法的有效性。