Exact and meta-heuristic approach for a general heterogeneous dial-a-ride problem with multiple depots

Dial-a-ride problems are concerned with the design of efficient vehicle routes for transporting individual persons from specific origin to specific destination locations. In real-life this operational planning problem is often complicated by several factors. Users may have special requirements (e.g. to be transported in a wheelchair) while service providers operate a heterogeneous fleet of vehicles from multiple depots in their service area. In this paper, a general dial-a-ride problem in which these three real-life aspects may simultaneously be taken into account is introduced: the Multi-Depot Heterogeneous Dial-A-Ride Problem (MD-H-DARP). Both a three- and two-index formulation are discussed. A branch-and-cut algorithm for the standard dial-a-ride problem is adapted to exactly solve small problem instances of the MD-H-DARP. To be able to solve larger problem instances, a new deterministic annealing meta-heuristic is proposed. Extensive numerical experiments are presented on different sets of benchmark instances for the homogeneous and the heterogeneous single depot dial-a-ride problem. Instances for the MD-H-DARP are introduced as well. The branch-and-cut algorithm provides considerably better results than an existing algorithm which uses a less compact formulation. All seven previously unsolved benchmark instances for the heterogeneous dial-a-ride problem could be solved to optimality within a matter of seconds. While computation times of the exact algorithm increase drastically with problem size, the proposed meta-heuristic algorithm provides near-optimal solutions within limited computation time for all instances. Several best known solutions for unsolved instances are improved and the algorithm clearly outperforms current state-of-the-art heuristics for the homogeneous and heterogeneous dial-a-ride problem, both in terms of solution quality and computation time.     

Viability of new road infrastructure with heterogeneous users

This paper explores the importance of heterogeneity in value of time and route choice when assessing the viability of new road infrastructure to alleviate congestion problems. The model incorporates strategic interaction between road operators in a cost-benefit framework and several competitive regimes are considered. It is then employed to establish the financial and socio-economic viability of a congestion pricing demonstration entering Madrid city centre, where road users have to choose between a free but highly congested road and a priced free-flowing road (semi-private regime). A logit estimation is undertaken with information from a questionnaire among road users in the Eastern Madrid area to obtain users’ value of time and of congestion.The tolls obtained generate a traffic reallocation towards the new roadway such that revenues suffice to render the infrastructure socio-economically viable. The private and the low toll regimes generate similar welfare gains that are close to the first best. Yet the former supposes large losses to users. The low toll and the semi-private regimes do not raise such distributional concerns. However, the low toll regime requires a sufficiently high traffic growth rate to make it financially viable; this does not happen for the other competitive regimes.     

一种改进的遗传算法在动态交通分配中的应用

以遗传思想为基础设计了新的启发式优化算法,针对动态交通分配问题,对遗传操作中的选择、交叉、变异算子进行修改,同时采用了模拟退火收敛准则,克服了传统遗传算法早熟收敛的弊端,并提高了全局寻优能力。仿真实验表明,该算法有快速高效的特点,提高了该动态交通分配模型的实用价值。