The load-dependent vehicle routing problem and its pick-up and delivery extension

The present paper examines a Vehicle Routing Problem (VRP) of major practical importance which is referred to as the Load-Dependent VRP (LDVRP). LDVRP is applicable for transportation activities where the weight of the transported cargo accounts for a significant part of the vehicle gross weight. Contrary to the basic VRP which calls for the minimization of the distance travelled, the LDVRP objective is aimed at minimizing the total product of the distance travelled and the gross weight carried along this distance. Thus, it is capable of producing sensible routing plans which take into account the variation of the cargo weight along the vehicle trips. The LDVRP objective is closely related to the total energy requirements of the vehicle fleet, making it a credible alternative when the environmental aspects of transportation activities are examined and optimized. A novel LDVRP extension which considers simultaneous pick-up and delivery service is introduced, formulated and solved for the first time. To deal with large-scale instances of the examined problems, we propose a local-search algorithm. Towards an efficient implementation, the local-search algorithm employs a computational scheme which calculates the complex weighted-distance objective changes in constant time. Solution results are presented for both problems on a variety of well-known test cases demonstrating the effectiveness of the proposed solution approach. The structure of the obtained LDVRP and VRP solutions is compared in pursuit of interesting conclusions on the relative suitability of the two routing models, when the decision maker must deal with the weighted distance objective. In addition, results of a branch-and-cut procedure for small-scale instances of the LDVRP with simultaneous pick-ups and deliveries are reported. Finally, extensive computational experiments have been performed to explore the managerial implications of three key problem characteristics, namely the deviation of customer demands, the cargo to tare weight ratio, as well as the size of the available vehicle fleet.     

Policy packages for modal shift and CO2 reduction in Lille,France

This paper proposes different policy scenarios to cut CO₂ emissions caused by the urban mobility of passengers. More precisely, we compare the effects of the ‘direct tool’ of carbon tax, to a combination of ‘indirect tools’ – not originally aimed at reducing CO₂ (i.e. congestion charging, parking charges and a reduction in public transport travel time) in terms of CO₂ impacts through a change in the modal split. In our model, modal choices depend on individual characteristics, trip features (including the effects of policy tools), and land use at origin and destination zones. Personal “CO₂ emissions budgets” resulting from the trips observed in the metropolitan area of Lille (France) in 2006 are calculated and compared to the situation related to the different policy scenarios. We find that an increase of 50% in parking charges combined with a cordon toll of €1.20 and a 10% travel time decrease in public transport services (made after recycling toll-revenues) is the winning scenario. The combined effects of all the policy scenarios are superior to their separate effects.     

Capturing correlation with a mixed recursive logit model for activity-travel scheduling

Representing activity-travel scheduling decisions as path choices in a time–space network is an emerging approach in the literature. In this paper, we model choices of activity, location, timing and transport mode using such an approach and seek to estimate utility parameters of recursive logit models. Relaxing the independence from irrelevant alternatives (IIA) property of the logit model in this setting raises a number of challenges. First, overlap in the network may not fully characterize perceptual correlation between paths, due to their interpretation as activity schedules. Second, the large number of states that are needed to represent all possible locations, times and activity combinations imposes major computational challenges to estimate the model. We combine recent methodological developments to build on previous work by Blom Västberg et al. (2016) and allow to model complex and realistic correlation patterns in this type of network. We use sampled choices sets in order to estimate a mixed recursive logit model in reasonable time for large-scale, dense time-space networks. Importantly, the model retains the advantage of fast predictions without sampling choice sets. In addition to estimation results, we present an extensive empirical analysis which highlights the different substitution patterns when the IIA property is relaxed, and a cross-validation study which confirms improved out-of-sample fit.     

Traffic and emissions impact of congestion charging in the central Beijing urban area: A simulation analysis

Congestion charging is being considered as a potential measure to address the issue of substantially increased traffic congestion and vehicle emissions in Beijing. This study assessed the impact of congestion charging on traffic and emissions in Beijing using macroscopic traffic simulation and vehicle emissions calculation. Multiple testing scenarios were developed with assumptions in different charging zone sizes, public transit service levels and charging methods. Our analysis results showed that congestion charging in Beijing may increase public transit use by approximately 13%, potentially reduce CO and HC emissions by 60–70%, and reduce NOx emissions by 35–45% within the charging zone. However, congestion charging may also result in increased travel activities and emissions outside of the charging zone and a slight increase in emissions for the entire urban area. The size of charging zone, charging method, and charging rate are key factors that directly influence the impact of congestion charging; improved public transit service needs to be considered as a complementary approach with congestion charging. This study is used by Beijing Transportation Environment and Energy Center (BTEC) as reference to support the development of Beijing’s congestion charging policy and regulation.     

Electric vehicles and residential parking in an urban environment: Results from a stated preference experiment

This paper presents the results of a preference survey of 1545 respondents’ willingness to purchase electric vehicles (EVs) in Philadelphia. We pay particular attention to respondents’ willingness to pay for convenient charging systems and parking spaces. If the value of dedicated parking substantially outweighs the value of convenient charging systems, residential-based on-street charging systems are unlikely to ever be politically palatable. As expected, respondents are generally willing to pay for longer range, shorter charging times, lower operating costs, and shorter parking search times. For a typical respondent, a $100 per month parking charge decreases the odds of purchasing an EV by around 65%. Across mixed logit and latent class models, we find substantial variation in the willingness to pay for EV range, charge time, and ease of parking. Of note, we find two primary classes of respondents with substantially different EV preferences. The first class tends to live in multifamily housing units in central parts of the city and puts a high value on parking search time and the availability of on-street charging stations. The second class, whose members are likelier to be married, wealthy, conservative, and residing in single-family homes in more distant neighborhoods, are willing to pay more for EV range and charge time, but less for parking than the first group. They are also much likelier to consider purchasing EVs at all. We recommend that future research into EV adoption incorporate neighborhood-level features, like parking availability and average trip distances, which vary by neighborhood and almost certainly influence EV adoption.     

Robust weekly aircraft maintenance routing problem and the extension to the tail assignment problem

In this paper, we study two closely related airline planning problems: the robust weekly aircraft maintenance routing problem (RWAMRP) and the tail assignment problem (TAP). In real life operations, the RWAMRP solution is used in tactical planning whereas the TAP solution is implemented in operational planning. The main objective of these two problems is to minimize the total expected propagated delay (EPD) of the aircraft routes. To formulate the RWAMRP, we propose a novel weekly line-of-flights (LOF) network model that can handle complex and nonlinear cost functions of EPD. Because the number of LOFs grows exponentially with the number of flights to be scheduled, we propose a two-stage column generation approach to efficiently solve large-scale real-life RWAMRPs. Because the EPD of an LOF is highly nonlinear and can be very time-consuming to accurately compute, we propose three lower bounds on the EPD to solve the pricing subproblem of the column generation. Our approach is tested on eight real-life test instances. The computational results show that the proposed approach provides very tight LP relaxation (within 0.6% of optimal solutions) and solves the test case with more than 6000 flights per week in less than three hours. We also investigate the solutions obtained by our approach over 500 simulated realizations. The simulation results demonstrate that, in all eight test instances, our solutions result in less EPDs than those obtained from traditional methods. We then extend our model and solution approach to solve realistically simulated TAP instances.     

Generalized Maximum Benefit Multiple Chinese Postman Problem

This research is focused on a generalization on the Max Benefit Chinese Postman Problem and the multiple vehicle variant of the Chinese Postman Problem. We call this generalization, the Generalized Maximum Benefit k-Chinese Postman Problem (GB k-CPP). We present a novel Mixed Integer Programming (MIP) formulation for the GB k-CPP. Four different cases of the model are discussed. The first case, performs arc-routing with profits and assumes that the origin and destination for each vehicle is the same for each cycle and is given by the user. The next case relaxes the assumption that the origin and destination for each vehicle should be the same and allows the users to select possible origins/destinations for vehicles. Case three gets the origin for each vehicle as input and produces a solution based on finding the best destination for each vehicle. The last case, that is very general, allows the optimization model to select possibly different locations for vehicle origin and destination, during each cycle. The different cases are applied to a security patrolling case conducted on the network of University of Maryland at College Park campus and the results are compared.     

On the variance of recurrent traffic flow for statistical traffic assignment

This paper generalizes and extends classical traffic assignment models to characterize the statistical features of Origin-Destination (O-D) demands, link/path flow and link/path costs, all of which vary from day to day. The generalized statistical traffic assignment (GESTA) model has a clear multi-level variance structure. Flow variance is analytically decomposed into three sources, O-D demands, route choices and measurement errors. Consequently, optimal decisions on roadway design, maintenance, operations and planning can be made using estimated probability distributions of link/path flow and system performance. The statistical equilibrium in GESTA is mathematically defined. Its multi-level statistical structure well fits large-scale data mining techniques. The embedded route choice model is consistent with the settings of O-D demands considering link costs that vary from day to day. We propose a Method of Successive Averages (MSA) based solution algorithm to solve for GESTA. Its convergence and computational complexity are analyzed. Three example networks including a large-scale network are solved to provide insights for decision making and to demonstrate computational efficiency.     

����������ݵ������Ǽʳ��з�ʽѡ����Ϊ�о�

随着中国城市群的快速发展,城际交通出行环境发生了巨大的变化,因此城际出行者也会不断地重建自己的出行习惯,这就要求建立动态模型研究城际出行者出行行为和预测城际交通需求。本文调查出行者在宁杭城际高铁开通前后两个时期的出行信息,并且引入状态依赖变量表征出行者之前选择结果对之后出行选择的影响,建立了基于面板数据的城际出行方式选择动态模型。模型结果表明,基于面板数据的动态模型比传统的基于出行者单次出行数据的模型拥有更高精度。同时本文根据宁杭城际出行背景设置三组政策变化方案预测出行分担率,结果表明,当选择环境发生变化时,传统模型会高估出行方式分担率的变化程度。以上结论能更好地服务于中国城际交通的规划。     

铁路枢纽小运转列车径路优化

以枢纽小运转列车运营成本和货运站装卸费用最小为目标,考虑载重量、列车数和运行时间约束,建立了枢纽小运转列车路径优化模型.并以某铁路枢纽地区为例,运用ILOG CPLEX优化软件仿真求解,得出枢纽小运转列车的最优路径方案.实例证明模型是有效可行的,与实际运行比较,优化后的费用降低近5%,运输距离缩短近8.31%.