For networks with human-driven vehicles (HDVs) only, pricing with arc-specific tolls has been proposed to achieve minimization of travel times in a decentralized way. However, the policy is hardly feasible from a technical viewpoint without connectivity. Therefore, for networks with mixed traffic of HDVs and connected and autonomous vehicles (CAVs), this paper considers pricing in a scenario where only CAVs are charged. In contrast to HDVs, CAVs can be managed as individual vehicles or as a fleet. In the latter case, CAVs can be routed to minimize the travel time of the fleet of CAVs or that of the entire fleet of HDVs and CAVs. We have a selfish user behavior in the first case, a private monopolist behavior in the second, a social planner behavior in the third. Pricing achieves in a decentralized way the social planner optimum. Tolls are not unique and can take both positive and negative values. Marginal cost pricing is one solution. The valid toll set is provided, and tolls are then computed according to two schemes: one with positive tolls only and minimum toll expenditure, and one with both tolls and subsidies and zero net expenditure. Convergent algorithms are used for the mixed-behavior equilibrium (simplicial decomposition algorithm) and toll determination (cutting plane algorithm). The computational experience with three networks: a two-arc network representative of the classic town bypass case, the Nguyen-Dupuis network, and the Anaheim network, provides useful policy insight.

仅对于具有人力车辆（HDV）的网络，已提出了针对特定弧线的通行费定价，以实现分散化的行驶时间最小化。但是，从技术角度来看，如果没有连接，该政策几乎是不可行的。因此，对于HDV和混合自动驾驶汽车（CAV）混合流量的网络，本文考虑仅对CAV收费的情况下的定价。与HDV相比，CAV可以作为单个车辆或车队进行管理。在后一种情况下，可以对CAV进行路由，以最大程度地减少CAV车队或整个HDV和CAV车队的旅行时间。在第一种情况下，我们具有自私的用户行为，在第二种情况下，我们具有私人垄断者的行为，第三种情况下，我们具有社交策划者​​的行为。定价以分散的方式实现了社会计划者的最佳选择。通行费不是唯一的，可以采用正值和负值。边际成本定价是一种解决方案。提供有效的通行费集，然后根据两种方案计算通行费：一种仅具有正通行费和最小通行费支出，一种具有通行费和补贴且净支出为零。收敛算法用于混合行为均衡（简单分解算法）和通行费确定（切平面算法）。三个网络的计算经验：代表经典城镇旁路案例的两弧网络，Nguyen-Dupuis网络和Anaheim网络提供了有用的政策见解。一种是只收取正的通行费，最少的通行费支出，另一种同时采用通行费和补贴，净支出为零。收敛算法用于混合行为均衡（简单分解算法）和通行费确定（切平面算法）。三个网络的计算经验：代表经典城镇旁路案例的两弧网络，Nguyen-Dupuis网络和Anaheim网络提供了有用的政策见解。一种是只收取正的通行费，最少的通行费支出，另一种同时采用通行费和补贴，净支出为零。收敛算法用于混合行为均衡（简单分解算法）和通行费确定（切平面算法）。三个网络的计算经验：代表经典城镇旁路案例的两弧网络，Nguyen-Dupuis网络和Anaheim网络提供了有用的政策见解。