Norm approximation method for handling traffic count inconsistencies in path flow estimator

Path flow estimator (PFE) is a one-stage network observer proposed to estimate path flows and hence origin–destination (O–D) flows from traffic counts in a transportation network. Although PFE does not require traffic counts to be collected on all network links when inferring unmeasured traffic conditions, it does require all available counts to be reasonably consistent. This requirement is difficult to fulfill in practice due to errors inherited in data collection and processing. The original PFE model handles this issue by relaxing the requirement of perfect replication of traffic counts through the specification of error bounds. This method enhances the flexibility of PFE by allowing the incorporation of local knowledge, regarding the traffic conditions and the nature of traffic data, into the estimation process. However, specifying appropriate error bounds for all observed links in real networks turns out to be a difficult and time-consuming task. In addition, improper specification of the error bounds could lead to a biased estimation of total travel demand in the network. This paper therefore proposes the norm approximation method capable of internally handling inconsistent traffic counts in PFE. Specifically, three norm approximation criteria are adopted to formulate three L_p-PFE models for estimating consistent path flows and O–D flows that simultaneously minimize the deviation between the estimated and observed link volumes. A partial linearization algorithm embedded with an iterative balancing scheme and a column generation procedure is developed to solve the three L_p-PFE models. In addition, the proposed L_p-PFE models are illustrated with numerical examples and the characteristics of solutions obtained by these models are discussed.     

集装箱码头卸船作业调度方案的两阶段禁忌搜索算法

为提高集装箱码头卸船作业效率,建立了堆存位置-集卡调度一体优化模型,设计了集装箱码头卸船作业调度方案两阶段禁忌搜索算法。在第一阶段,通过禁忌搜索算法决定集装箱的堆存位置;在第二阶段,基于堆存方案执行另一禁忌搜索算法,获得集卡的优化调度方案,然后再计算卸船时间,且将结果反馈到第一阶段的搜索过程,通过两阶段搜索过程的反馈优化卸船调度方案。计算结果表明两阶段禁忌搜索算法可以平均减少卸船作业时间6.78%,结果稳定。     

Vehicle headway modeling and its inferences in macroscopic/microscopic traffic flow theory: A survey

Vehicle headway distribution models are widely used in traffic engineering fields, since they reflect the fundamental uncertainty in drivers' car-following maneuvers and meanwhile provide a concise way to describe the stochastic feature of traffic flows. This paper presents a systematic review of vehicle headway distribution studies in the last few decades. Since it is impossible to enumerate the merits and drawbacks of all of existing distribution models, we emphasize four advances of headway distribution modeling in this paper. First, we highlight the chronicle of key assumptions on the existing distribution models and explain why this evolution occurs. Second, we show that departure headways measured for interrupted flows on urban streets and headways measured for uninterrupted flows on freeways have common features and can be simulated by a unified microscopic car-following model. The interesting finding helps gather two kinds of headway distribution models under one umbrella. Third, we review different approaches that aim to link microscopic car-following models and mesoscopic vehicle headway distribution models. Fourth, we show that both the point scattering on the density-flow plot and the shape of traffic flow breakdown curve implicitly depend on the vehicular headway distribution. These findings reveal pervasive connections between macroscopic traffic flow models and mesoscopic headway distribution. All these new insights bring new vigor into vehicle headway studies and open research frontiers in this field.     

Adapting the shipping sector to stricter emissions regulations: Fuel switching or installing a scrubber?

This paper examines how the existing fleet in the shipping industry can be adapted to the new emission regulations through the two main techniques that currently exist: (a) the use of low-sulphur marine diesels; and (b) the installation of scrubbers. A method is presented here for drawing up an economic assessment of both these techniques under uncertainty. It enables the best option to be selected at any given time taking into account fuel prices (spot and futures), scrubber installation costs, the time that the vessel operates in an Emission Control Area (ECA) and the remaining useful lifetime of the vessel. The paper also considers the possibility of an unexpected change from a non-ECA navigation area to an ECA. The assessment is carried out in a manner consistent with marine diesel and crude oil spot and futures market quotes. Our results show the net present value of investing in the installation of scrubbers and investing in changing fuel types for different assumptions on how vessels are operated. We also analyse increases in fuel consumption and CO₂ emissions as a consequence of using scrubbers and how they affects the financial analysis if such incremental emissions must be paid under a CO₂ pricing mechanism.     

A hybrid heuristic strategy for liquefied natural gas inventory routing

As liquefied natural gas (LNG) steadily grows to be a common mode for commercializing natural gas, LNG supply chain optimization is becoming a key technology for gas companies to maintain competitiveness. This paper develops methods for improving the solutions for a previously stated form of an LNG inventory routing problem (LNG-IRP). Motivated by the poor performance of a Dantzig-Wolfe-based decomposition approach for exact solutions, we develop a suite of advanced heuristic techniques and propose a hybrid heuristic strategy aiming to achieve improved solutions in shorter computational time. The heuristics include two phases: the advanced construction phase is based on a rolling time algorithm and a greedy randomized adaptive search procedure (GRASP); and the solution improvement phase is a series of novel MIP-based neighborhood search techniques. The proposed algorithms are evaluated based on a set of realistic large-scale instances seen in recent literature. Extensive computational results indicate that the hybrid heuristic strategy is able to obtain optimal or near optimal feasible solutions substantially faster than commercial optimization software and also the previously proposed heuristic methods.     

行人-公交紧急疏散集成优化模型

针对大型公共场所突发事件提出了运用公共交通进行紧急疏散的集成优化模型。模型将紧急疏散问题抽象为行人交通流和公共交通网络的双层优化网络, 第1层引导撤离人员从事发地点(建筑物等) 到达指定的乘车点(公交站等), 第2层优化公交车从场站出发, 途经各乘车点, 最后运输撤离人员到达安全地点。利用基于禁忌搜索的两阶段启发式算法对模型进行求解和验证。验证结果表明: 在一个有328人需要疏散的网络中, 共使用8辆公交车完成疏散。目标函数中每一项权重的变化对模型输出结果基本没有影响, 模型具有很强的鲁棒性。对比CPLEX优化软件, 启发式算法能够在1h内求解出近似最优解, 并且近似最优解与最优解的误差小于15%。模型充分考虑了撤离人员分配与公交路径优化之间的交互影响, 实现了在紧急疏散时行人交通流与公共交通网络的组织最优。     

When it comes to container port efficiency,are all developing regions equal?

In this paper we carry out a container port performance analysis of the developing world between 2000 and 2010, using both parametric and nonparametric approaches. From a unique dataset – our sample covers 70 developing countries, 203 ports, and 1750 data points–, we examine the evolution and drivers of productivity and efficiency changes across developing regions. We show that productivity growth rates between 2000 and 2010 vary significantly and that this heterogeneity is explained by pure efficiency changes rather than scale efficiency of technological changes. Therefore, we carry out a detailed efficiency analysis to determine the drivers of port efficiency. Time series results show an upward trend for port efficiency in developing regions, as it increased from 51 percent in 2000 to 61 percent in 2010. Our analysis indicates that private sector participation, the reduction of corruption in the public sector, improvements in liner connectivity and the existence of multimodal links increase the level of port efficiency in developing regions.     

What drives the drivers? Predicting turnover intentions in the Belgian bus and coach industry

The bus industry is characterized by demanding jobs and high turnover rates. In this study we gather essential insights that can help companies and industry-level policy makers increase the attractiveness of the profession and design effective retention policies. We compare the factors that induce Belgian drivers to leave their current organization with those inducing them to leave the industry. Key factors increasing the likelihood to consider quitting the company are a negative work-life balance, a lack of social support and a temporary contract. Dominant factors to consider quitting the bus driver profession are a lack of fulfillment, a demanding job environment and a negative work-life balance.     

A distributed VNS algorithm for optimizing dial-a-ride problems in large-scale scenarios

These days, transportation and logistic problems in large cities are demanding smarter transportation services that provide flexibility and adaptability. A possible solution to this arising problem is to compute the best routes for each new scenario. In this problem, known in the literature as the dial-a-ride problem, a number of passengers are transported between pickup and delivery locations trying to minimize the routing costs while respecting a set of prespecified constraints. This problem has been solved in the literature with several approaches from small to medium sized problems. However, few efforts have dealt with large scale problems very common in massive scenarios (big cities or highly-populated regions). In this study, a new distributed algorithm based on the partition of the requests space and the combination of the routes is presented and tested on a set of 24 different scenarios of a large-scale problem (up to 16,000 requests or 32,000 locations) in the city of San Francisco. The results show that, not only the distributed algorithm is able to solve large problem instances that the corresponding sequential algorithm is unable to solve in a reasonable time, but also to have an average improvement of 9% in the smaller problems. The results have been validated by means of statistical procedures proving that the distributed algorithm can be an effective way to solve high dimensional dial-a-ride problems.     

A model and optimization-based heuristic for the operational aircraft maintenance routing problem

This paper investigates the Operational Aircraft Maintenance Routing Problem (OAMRP). Given a set of flights for a specific homogeneous fleet type, this short-term planning problem requires building feasible aircraft routes that cover each flight exactly once and that satisfy maintenance requirements. Basically, these requirements enforce an aircraft to undergo a planned maintenance at a specified station before accumulating a maximum number of flying hours. This stage is significant to airline companies as it directly impacts the fleet availability, safety, and profitability. The contribution of this paper is twofold. First, we elucidate the complexity status of the OAMRP and we propose an exact mixed-integer programming model that includes a polynomial number of variables and constraints. Furthermore, we propose a graph reduction procedure and valid inequalities that aim at improving the model solvability. Second, we propose a very large-scale neighborhood search algorithm along with a procedure for computing tight lower bounds. We present the results of extensive computational experiments that were carried out on real-world flight networks and attest to the efficacy of the proposed exact and heuristic approaches. In particular, we provide evidence that the exact model delivers optimal solutions for instances with up to 354 flights and 8 aircraft, and that the heuristic approach consistently delivers high-quality solutions while requiring short CPU times.