带时间窗的车辆路径混合遗传算法

基于标准遗传算法, 将每一个染色体与分组信息相结合, 使染色体结构包含有更多信息, 辅以λ-交换局部搜索技术, 构造了一种新的混合遗传算法, 对带时间窗约束的车辆路径问题进行了求解, 并与标准遗传算法的求解结果进行了对比研究, 发现使用混合遗传算法, 总行驶里程为162km, 而使用标准遗传算法, 总行驶里程为182 km。结果表明混合遗传算法的求解结果比标准遗传算法更加接近最优解, 所需的行驶里程缩短, 有效降低运输企业的车辆运行成本。     

拉格朗日松弛启发式算法求解时空网络下的弧路径问题

为减少车辆调度成本,优化车辆运输路径,在时空网络中研究路段作业车辆的弧路径问题;考虑道路出行的时变性,利用车辆运行的时间、空间特征,构建时间-空间网络,建立弧路径问题的时空网络流模型;设计了拉格朗日松弛启发式算法,引入拉格朗日乘子松弛耦合约束,构建拉格朗日松弛问题;进一步通过拉格朗日分解,把松弛问题分解为单车最短路问题;用次梯度算法更新乘子,求解拉格朗日对偶问题,并更新原问题最优解的下界;使用启发式算法获得可行解,并更新原问题最优解的上界;用六结点运输网络和Sioux-Falls网络下的算例对算法进行实证分析。计算结果表明：六结点运输网络中6个算例的上下界间隙值等于0或接近0,Sioux-Falls网络中算例2的间隙值为0.02%,其余5个算例的间隙值等于0,均可以得到质量较高的近似最优解;在最复杂的算例(15辆车,70个任务)中,算法在可接受的时间内也得到了间隙值为0的解,找出了最优的车辆路径;随着迭代次数的增加,拉格朗日乘子会逐步收敛到固定值;当车辆容量从50增加到100时,最优解从52下降到42,说明在任务数和车辆数一定时,适当增加车容量可以降低运营成本。可见,与商业求解器相比,拉格朗日松弛启发式算法的间隙值更小,求解质量更高,可以更有效地求解弧路径问题。     

Adapt-Traf: An adaptive multiagent road traffic management system based on hybrid ant-hierarchical fuzzy model

Usually, road networks are characterized by their great dynamics including different entities in interactions. This leads to more complex road traffic management. This paper proposes an adaptive multiagent system based on the ant colony behavior and the hierarchical fuzzy model. This system allows adjusting efficiently the road traffic according to the real-time changes in road networks by the integration of an adaptive vehicle route guidance system. The proposed system is implemented and simulated under a multiagent platform in order to discuss the improvement of the global road traffic quality in terms of time, fluidity and adaptivity.     

Multi-objective optimization of train routing problem combined with train scheduling on a high-speed railway network

Based on train scheduling, this paper puts forward a multi-objective optimization model for train routing on high-speed railway network, which can offer an important reference for train plan to provide a better service. The model does not only consider the average travel time of trains, but also take the energy consumption and the user satisfaction into account. Based on this model, an improved GA is designed to solve the train routing problem. The simulation results demonstrate that the accurate algorithm is suitable for a small-scale network, while the improved genetic algorithm based on train control (GATC) applies to a large-scale network. Finally, a sensitivity analysis of the parameters is performed to obtain the ideal parameters; a perturbation analysis shows that the proposed method can quickly handle the train disturbance.     

Rolling horizon control framework for driver assistance systems. Part II: Cooperative sensing and cooperative control

This contribution furthers the control framework for driver assistance systems in Part I to cooperative systems, where equipped vehicles can exchange relevant information via vehicle-to-vehicle communication to improve the awareness of the ambient situation (cooperative sensing) and to manoeuvre together under a common goal (cooperative control). To operationalize the cooperative sensing strategy, the framework is applied to the development of a multi-anticipative controller, where an equipped vehicle uses information from its direct predecessor to predict the behaviour of its pre-predecessor. To operationalize the cooperative control strategy, we design cooperative controllers for sequential equipped vehicles in a platoon, where they collaborate to optimise a joint objective. The cooperative control strategy is not restricted to cooperation between equipped vehicles. When followed by a human-driven vehicle, equipped vehicles can still exhibit cooperative behaviour by predicting the behaviour of the human-driven follower, even if the prediction is not perfect.The performance of the proposed controllers are assessed by simulating a platoon of 11 vehicles with reference to the non-cooperative controller proposed in Part I. Evaluations show that the multi-anticipative controller generates smoother behaviour in accelerating phase. By a careful choice of the running cost specification, cooperative controllers lead to smoother decelerating behaviour and more responsive and agile accelerating behaviour compared to the non-cooperative controller. The dynamic characteristics of the proposed controllers provide new insights into the potential impact of cooperative systems on traffic flow operations, particularly at the congestion head and tail.     

Order-first split-second methods for vehicle routing problems: A review

Cluster-first route-second methods like the sweep heuristic (Gillett and Miller, 1974) are well known in vehicle routing. They determine clusters of customers compatible with vehicle capacity and solve a traveling salesman problem for each cluster. The opposite approach, called route-first cluster-second, builds a giant tour covering all customers and splits it into feasible trips. Cited as a curiosity for a long time but lacking numerical evaluation, this technique has nevertheless led to successful metaheuristics for various vehicle routing problems in the last decade. As many implementations consider an ordering of customers instead of building a giant tour, we propose in this paper the more general name of ordering-first split-second methods. This article shows how this approach can be declined for different vehicle routing problems and reviews the associated literature, with more than 70 references.     

Ant Colony Routing algorithm for freeway networks

Dynamic traffic routing refers to the process of (re)directing vehicles at junctions in a traffic network according to the evolving traffic conditions. The traffic management center can determine desired routes for drivers in order to optimize the performance of the traffic network by dynamic traffic routing. However, a traffic network may have thousands of links and nodes, resulting in a large-scale and computationally complex non-linear, non-convex optimization problem. To solve this problem, Ant Colony Optimization (ACO) is chosen as the optimization method in this paper because of its powerful optimization heuristic for combinatorial optimization problems. ACO is implemented online to determine the control signal – i.e., the splitting rates at each node. However, using standard ACO for traffic routing is characterized by four main disadvantages: 1. traffic flows for different origins and destinations cannot be distinguished; 2. all ants may converge to one route, causing congestion; 3. constraints cannot be taken into account; and 4. neither can dynamic link costs. These problems are addressed by adopting a novel ACO algorithm with stench pheromone and with colored ants, called Ant Colony Routing (ACR). Using the stench pheromone, the ACR algorithm can distribute the vehicles over the traffic network with less or no traffic congestion, as well as reduce the number of vehicles near some sensitive zones, such as hospitals and schools. With colored ants, the traffic flows for multiple origins and destinations can be represented. The proposed approach is also implemented in a simulation-based case study in the Walcheren area, the Netherlands, illustrating the effectiveness of the approach.     

应用于现代有轨电车的司机手动排路方案研究

由于目前大部分有轨电车采用与社会车辆共有路权的运营方式,当岔区与路口区域重合时,就需要司机根据路口信号机状态,选择合理时机手动办理进路。基于上述需要,讨论几种应用于现代有轨电车信号系统的司机手动排路方案,并试图减小手动排路操作的复杂度,提高手动排路正确性,从而保障有轨电车安全高效运营。     

Social Networks of Alaska Fishing Communities

Fishing community social networks function as channels for transfer of fishery knowledge, resources, and business transactions that help mitigate risks and shocks associated with altered access to fishery resources. Research on such networks in Alaska is limited despite their cultural importance and community reliance on fisheries. We contribute to scholarship of fishery social networks by assessing Alaska fishing community perspectives of challenges related to fisheries policy and management, and the existing social networks that aid in overcoming these challenges. Our findings show that the greatest challenges fishing communities face pertaining to fishery management are high costs of participating in catch share programs, restricted subsistence fishing activity due to decline in salmon, and complex regulations. Social networks exist for coping with these challenges; fishery information, and resources such as food, fuel and medicines are shared between communities. However, networks for accessing fishery support services are centralized in fewer larger communities and hubs such as Anchorage. Smaller and remote communities are the most compromised in this regard given the distance they must travel to access fishery support services. Leveraging social networks for sharing resources and improving fishery support services in smaller communities will increase their adaptive capacity and ability to maintain participation in Alaska fisheries.     

船舶气象导航随船验证

横渡太平洋往返两个笈欠的随船调查研究表明，采用气象导航对减少燃油消耗和保证船舶安全、班期等，不但有一定的经济效益，而且是一种非常有效的航运管理方法。