【无标题】

や且看゛

于 2022-12-18 18:51:14 发布

阅读量336

点赞数

文章标签： python 算法人工智能

本文链接：https://blog.csdn.net/qq_52871810/article/details/128356906

版权

1. LTI Branch-and-Price-and-Cut for the Heterogeneous Fleet and Multi-Depot Static Bike Rebalancing Problem with Split Load☀️

异构车队和多站点静态自行车分流平衡问题的LTI分支和价格与削减
FN Clarivate Analytics Web of Science
AU Ding, Y; Zhang, JT; Sun, JQ
AF Ding, Ye; Zhang, Jiantong;Sun, Jiaqing

PY 2022

摘要:Heterogeneous Fleet and Multi-Depot Static Bike Rebalancing Problem with Split Load (HFMDSBRP-SD) is an extension of the Static Bike Rebalancing Problem, considering heterogeneous fleet multiple depots, allowing split load. It consists of finding a set of least-cost repositioning vehicle routes and determining each station’s pickup or delivery quantity to satisfy the demand of each station. We develop a branch-and-price-and-cut (BPC) where a tabu search column generator and a heuristic label-setting algorithm are introduced to accelerate the column generation procedure, the subset-row (SR) inequalities, the strong minimum number of vehicles (SMV) inequalities, and the enhanced elementary inequalities are extended fitting this problem and applied to speed up the global convergence rate. Computational results demonstrate the effectiveness of the BPC algorithm. Among 360 instances with a maximum size of 30, there are 298 instances capable of achieving optimality within two hour time limitation.

异构车队和多站点静态自行车重新平衡问题（HFMDSBRP-SD）是静态自行车重新均衡问题的扩展，考虑到异构车队多站点，允许拆分负载。它包括找到一组成本最低的重新定位车辆路线，并确定每个站点的取货或交货数量，以满足每个站点的需求。我们开发了一种分支和价格切割（BPC），其中引入了禁忌搜索列生成器和启发式标签设置算法，并将增强的初等不等式推广到该问题中，以提高全局收敛速度。计算结果证明了BPC算法的有效性。在最大大小为30的360个实例中，有298个实例能够在两小时的时间限制内实现最优。

2. PROPOSING A MATHEMATICAL MODEL OF BALANCING THE INVENTORY OF MULTI-ZONE BICYCLE SHARING SYSTEMS WITH MOBILE STATIONS AND APPLYING MAINTENANCE CONSTRAINTS

提出了一种基于移动站的多区域自行车共享系统库存平衡的数学模型，并应用了维护约束
AU Kaveh, F ;Shirouyehzad, H; Zolfani, SH; Arabzad, SM
AF Kaveh, Farshad; Shirouyehzad, Hadi; Zolfani, Sarfaraz Hashemkhani ; Arabzad, S. Mohammad

PY 2022

Regarding the necessity of developing transportation infrastructures and its increasing importance in urban issues, nowadays in different cities, bicycles are considered the main and sustainable vehicle along with walking and drawing more attention day by day. The case considers highly paramount since preservation of the environment, natural resources, and energy is one of the significant pillars of sustainable development, and urban transportation intensively influences it. Thus, Bicycle Sharing System (BSS) is recognized as an innovative urban transportation option that meets the citizens??? demand for commuting during the day. The BSS can highly affect the level of citizens??? health, and it can be counted as one of the leading health programs whether it???s added to the public transportation system, it can help the culture to be created to use bicycles instead of cars in most of the internal trips, and also it can be so influential in decreasing the air pollution and in the following its harmful effects on health issues. The mathematical model of rebalancing multi-zone BSS with mobile stations and applying maintenance constraints in a static status is considered in this research. The objective function of this research is a single-objective one, which is modeled with the aims of reducing the costs of traveled distances by the tracks within and outside the zones, reducing the costs of intact and defective bicycles transportation within and outside the zones, and eventually, reducing the costs of surplus bicycles depot at the stations. This issue is a multi-product one that includes different types of bicycles and balancing tracks. Computational results confirm the model???s efficiency. Also, sensitivity analysis has been done to prove that the model is affected by both parameters of storage costs of surplus bicycles and transportation costs within and outside the zones.

关于发展交通基础设施的必要性及其在城市问题中的日益重要性，如今在不同的城市，自行车被认为是主要和可持续的交通工具，与步行一起日益受到关注。该案例被认为是非常重要的，因为保护环境、自然资源和能源是可持续发展的重要支柱之一，而城市交通对其产生了强烈影响。因此，自行车共享系统（BSS）被公认为一种满足市民需求的创新城市交通方案？？？白天通勤需求。BSS可以高度影响公民的水平？？？健康，它可以算是领先的健康项目之一，无论是？？？它被添加到公共交通系统中，有助于创造在大多数内部旅行中使用自行车而不是汽车的文化，而且它可以在减少空气污染以及随之而来的对健康问题的有害影响方面发挥巨大的作用。本研究考虑了在静态状态下利用移动站重新平衡多区域BSS并应用维护约束的数学模型。本研究的目标函数是一个单一的目标函数，其建模目的是降低区域内外轨道的行驶距离成本，降低区域内外完整和有缺陷的自行车运输成本，最终降低站点多余自行车停车场的成本。这是一个多产品的问题，包括不同类型的自行车和平衡轨道。计算结果证实了模型？？？s效率。此外，还进行了敏感性分析，以证明该模型受到剩余自行车存储成本和区域内外运输成本两个参数的影响。

3. Repositioning Bikes with Carrier Vehicles and Bike Trailers in Bike

Sharing Systems

在自行车共享系统中使用载具和自行车拖车重新定位自行车
AU Zheng, XH; Tang, M; Liu, YC;Xian, ZZ;Zhuo, HHK
AF Zheng, Xinghua;Tang, Ming; Liu, Yuechang; Xian, Zhengzheng ;Zhuo, Hankz Hankui

PY 2021

Bike sharing systems (BSSs) are widely adopted in major cities of the world due to traffic congestion and carbon emissions. Although there have been approaches to exploit either bike trailers via crowdsourcing or carrier vehicles to reposition bikes in the “right” stations in the “right” time, they did not jointly consider the usage of both bike trailers and carrier vehicles. In this paper, we aim to take advantage of both bike trailers and carrier vehicles to reduce the loss of demand by determining whether bike trailers or carrier vehicles (or both) should be used. In addition, we also would like to maximize the overall profit with regard to the crowdsourcing of bike trailers and the fuel cost of carrier vehicles. In the experiment, we exhibit that our approach outperforms baselines in multiple data sets from bike sharing companies.
由于交通拥堵和碳排放，自行车共享系统（BSS）在世界主要城市被广泛采用。尽管已经有方法通过众包或运输车利用自行车拖车在“正确”的时间内将自行车重新定位到“正确”站点，但他们没有共同考虑自行车拖车和运输车的使用。在本文中，我们的目标是通过确定是否应使用自行车拖车或运输车（或两者）来利用自行车拖车和运输车，以减少需求损失。此外，我们还希望在自行车拖车的众包和运载车辆的燃料成本方面实现整体利润最大化。在实验中，我们展示了我们的方法在共享单车公司的多个数据集上优于基线。

4 Measures of balance in combinatorial optimization

组合优化中的平衡度量
AU Olivier, P ; Lodi, A; Pesant, G
AF Olivier, Philippe; Lodi, Andrea ;Pesant, Gilles

PY 2022

The concept of balance plays an important role in many combinatorial optimization problems. Yet there exist various ways of expressing balance, and it is not always obvious how best to achieve it. In this methodology-focused paper, we study three cases where its integration is deficient and analyze the causes of these inadequacies. We examine the characteristics and performance of the measures of balance used in these cases, and provide general guidelines regarding the choice of a measure.
平衡的概念在许多组合优化问题中起着重要作用。然而，表达平衡的方式多种多样，如何最好地实现平衡并不总是显而易见的。在这篇以方法论为重点的论文中，我们研究了三个其整合不足的案例，并分析了这些不足的原因。我们研究了在这些情况下使用的平衡措施的特点和性能，并提供了有关措施选择的一般指南。

5. An enhanced artificial bee colony algorithm for the green bike repositioning problem with broken bikes⭐️

一种改进的人工蜂群算法求解自行车破损的绿色自行车重新定位问题

AU Wang, Y ;Szeto, WY
AF Wang, Yue; Szeto, W. Y.(⭐️)

期刊: TRANSPORTATION RESEARCH PART C-EMERGING TECHNOLOGIES

PY 2021

The Bike Repositioning Problem (BRP) has raised many researchers? attention in recent years to improve the service quality of Bike Sharing Systems (BSSs). It is mainly about designing the routes and loading instructions for the vehicles to transfer bikes among stations in order to achieve a desirable state. This study tackles a static green BRP that aims to minimize the CO2 emissions of the repositioning vehicle besides achieving the target inventory level at stations as much as possible within the time budget. Two types of bikes are considered, including usable and broken bikes. The Enhanced Artificial Bee Colony (EABC) algorithm is adopted to generate the vehicle route. Two methods, namely heuristic and exact methods, are proposed and incorporated into the EABC algorithm to compute the loading/unloading quantities at each stop. Computational experiments were conducted on the real-world instances having 10?300 stations. The results indicate that the proposed solution methodology that relies on the heuristic loading method can provide optimal solutions for small instances. For large-scale instances, it can produce better feasible solutions than two benchmark methodologies in the literature.
自行车重新定位问题（BRP）引起了许多研究人员的关注？近年来，人们关注提高自行车共享系统（BSS）的服务质量。它主要是为车辆设计路线和装载指令，以便在站点之间转移自行车，以实现理想状态。本研究涉及一个静态绿色BRP，其目的是除了在时间预算内尽可能实现站点的目标库存水平之外，还将重新定位车辆的CO2排放降至最低。考虑两种类型的自行车，包括可用自行车和坏自行车。采用增强型人工蜂群（EABC）算法生成车辆路径。提出了两种方法，即启发式和精确方法，并将其结合到EABC算法中，以计算每个站点的装载/卸载量。在具有10？300个站点。结果表明，所提出的基于启发式加载方法的求解方法可以为小实例提供最优解。对于大规模实例，它可以产生比文献中的两种基准方法更好的可行解决方案。

6. Modelling of User Behaviour for Static Rebalancing of Bike Sharing System: Transfer of Demand from Bike-Shortage Stations to Neighbouring Stations☀️

自行车共享系统静态再平衡的用户行为模型：需求从自行车短缺站转移到邻近站

AU Affonso, RC ;Couffin, F ;Leclaire, P
AF Costa Affonso, Roberta ;Couffin, Florent ;Leclaire, Patrice

JOURNAL OF ADVANCED TRANSPORTATION

PY 2021

Bike sharing systems are becoming more and more common around the world. One of the main difficulties is to ensure the availability of bicycles in order to satisfy users. To achieve this objective, managers of these systems set up rebalancing vehicles that displace bicycles to stations that are likely to be in a situation of bike shortage. In order to determine which stations must be supplied on a priority basis and the number of bicycles to be supplied (named in this paper as rebalancing plan), the aim is generally to reduce the lost demand for each station, i.e., the gap between the demand for bicycles and the number of bicycles at a station. On the one hand, this paper proposes an algorithm that evaluates the lost demand in a more realistic way, by describing the behaviour of users faced with a bike-shortage station. It takes into account the possibility that a proportion of users who cannot find bicycles will move to a neighbouring station that is not empty. This proportion depends on the distance between stations and corresponds to the number of users willing to walk a given distance to a neighbouring station. On the other hand, this algorithm provides the value of the objective function to be minimized to a static rebalancing plan algorithm based on a Random Search metaheuristic. The quantities of bicycles to be picked up and dropped off at each station are calculated in a static rebalancing context. The calculation of lost demand based on this algorithm, which simulates user behaviour, was compared with that one obtained by the classical method on a real numerical example obtained from the open data of Parisian Velib (more than 1200 stations). In addition, the efficiency of the rebalancing algorithm coupled with the user behaviour simulation algorithm was evaluated on this numerical example and allowed to obtain very good results compared to the rebalancing performed by the system operator.
自行车共享系统在世界各地越来越普遍。主要困难之一是确保自行车的可用性，以满足用户的需求。为了实现这一目标，这些系统的管理者建立了再平衡车辆，将自行车转移到可能处于自行车短缺状况的站点。为了确定哪些站点必须优先供应以及要供应的自行车数量（本文中称为再平衡计划），目的通常是减少每个站点的损失需求，即自行车需求与站点自行车数量之间的差距。一方面，本文提出了一种算法，通过描述面临自行车短缺站的用户的行为，以更现实的方式评估损失的需求。它考虑到了一部分找不到自行车的用户可能会搬到附近的非空站。该比例取决于站点之间的距离，并对应于愿意步行给定距离到达相邻站点的用户数量。另一方面，该算法将目标函数的值最小化为基于随机搜索元启发式的静态再平衡计划算法。每个站点上下车的自行车数量是在静态再平衡环境中计算的。基于该算法（模拟用户行为）的需求损失计算与经典方法计算的需求损失进行了比较，该方法基于从巴黎Velib（1200多个站点）的开放数据中获得的真实数值示例。此外，在该数值示例上评估了再平衡算法与用户行为模拟算法的效率，并且与系统操作员执行的再平衡相比，允许获得非常好的结果。

7. Extending and Solving the Refrigerated Routing Problem

冷藏路径问题的扩展与解决

AU Ceschia, S ; Di Gaspero, L; Meneghetti, A
AF Ceschia, Sara ;Di Gaspero, Luca ;Meneghetti, Antonella

ENERGIES

PY 2020

近年来，冷链食品的增长令人印象深刻，这主要是由于顾客生活方式的改变。因此，冷藏食品的运输正成为链条的一个关键方面，旨在确保过程的效率和可持续性，同时保持高水平的产品质量。最近定义的冷藏路线问题（RRP）包括找到最佳的运输路线，以最小化牵引和冷藏部件的燃油消耗。总油耗与行驶距离、车辆负载和速度以及室外温度有着复杂的关系。所有这些因素反过来又取决于运输地区的交通和气候条件，这些因素在白天和一年中都会发生变化。最初的RRP已被扩展，以考虑到总驾驶成本，并增加了通过允许任意长的等待时间来降低交付速度的可能性，当这对目标功能有利时。新的RRP被表述和求解为混合整数规划和新的约束规划模型。此外，还提出了基于不同邻域结构组合的局部搜索元启发式技术（即延迟接受爬山）。比较和讨论了在一组基准情景下通过不同的解决方法获得的结果。

用处不大,所以没有记录英文摘要

PT J

8.An Improved Iterated Local Search Algorithm for the Static Partial Repositioning Problem in Bike-Sharing System

自行车共享系统静态部分重新定位问题的改进迭代局部搜索算法

AU Tang, Q ;Fu, Z ; Zhang, DZ ; Qiu, M; Li, MY
AF Tang, Qiong ; Fu, Zhu ; Zhang, Dezhi ;Qiu, Meng ;Li, Minyi

JOURNAL OF ADVANCED TRANSPORTATION

PY 2020

In this paper, a single-vehicle static partial repositioning problem (SPRP) is investigated, which distinguishes the user dissatisfaction generated by different stations. The overall objective of the SPRP is to minimize the weighted sum of the total operational time and the total absolute deviation from the target number of bikes at all stations. An iterated local search is developed to solve this problem. A novel loading and unloading quantity adjustment operator is proposed to further improve the quality of the solution. Experiments are conducted on a set of instances from 30 to 300 stations to demonstrate the effectiveness of the proposed customized solution algorithm as well as the adjustment operator. Using a small example, this paper also reveals that the unit penalty cost has an effect on the repositioning strategies.
本文研究了一个单车静态部分重新定位问题（SPRP），该问题区分了不同站点产生的用户不满。SPRP的总体目标是最大限度地减少总运行时间和与所有站点自行车目标数量的总绝对偏差的加权和。为了解决这个问题，开发了迭代局部搜索。提出了一种新的加载和卸载量调整算子，以进一步提高解决方案的质量。在30到300个站点的一组实例上进行了实验，以证明所提出的定制解决方案算法以及调整算子的有效性。通过一个小例子，本文还揭示了单位惩罚成本对重新定位策略的影响。