当前位置: X-MOL 学术Eur. J. Oper. Res. › 论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
A memetic algorithm for solving rich waste collection problems
European Journal of Operational Research ( IF 6.0 ) Pub Date : 2022-11-17 , DOI: 10.1016/j.ejor.2022.11.023
Carolien Lavigne , Dirk Inghels , Wout Dullaert , Reginald Dewil

Inspired by a real-life case in the Brussels Capital Region, Belgium, this paper provides a Memetic Algorithm with Sequential Split procedure (MASS) for solving a large variety of waste collection problems with multiple depots, a restricted vehicle fleet at each depot, multiple (intermediate) processing facilities, capacity restrictions per processing facility and partial pick-ups. MASS first generates satisfactory initial solutions which are feasible w.r.t. the shift duration and the vehicle capacity using a novel procedure in which (1) a giant tour is split into vehicle routes, (2) intermediate processing facilities are introduced and (3) waste pick-ups can be split further if profitable. Second, MASS improves these solutions through local search. New test instances are created, which are used to evaluate the performance of MASS’s components. We show that MASS provides high-quality feasible solutions by comparing MASS with an exact approach on a small example. Furthermore, MASS is tested on existing instances for the multiple-depot vehicle routing problem (MDVRP), (multi-depot) vehicle routing problem with intermediate facilities ((MD)VRPIF) and the multi-depot vehicle routing problem with inter-depot routes (MDVRPI). MASS shows competitive results for the MDVRP, the VRPIF and the MDVRPI. For the MDVRPIF, MASS obtains better results than those currently found in the literature. To assess its practical value, MASS is used to solve a real-life waste collection problem in the Brussels Capital Region in which alternative scenarios for municipal bio-waste collection and treatment are compared.



中文翻译:

一种解决丰富垃圾收集问题的模因算法

受比利时布鲁塞尔首都地区真实案例的启发,本文提供了一种具有顺序拆分过程 (MASS) 的模因算法,用于解决具有多个仓库、每个仓库的有限车队、多个(中间)加工设施、每个加工设施的容量限制和部分提取。MASS 首先使用一种新颖的程序生成令人满意的初始解决方案,这些解决方案在轮班持续时间和车辆容量方面是可行的,其中 (1) 一个巨大的旅程被分成车辆路线,(2) 引入中间处理设施,以及 (3) 垃圾收集-如果有利可图,可以进一步拆分。其次,MASS 通过本地搜索改进这些解决方案。创建了新的测试实例,用于评估 MASS 组件的性能。我们通过在一个小例子上将 MASS 与精确方法进行比较,表明 MASS 提供了高质量的可行解决方案。此外,MASS 在现有实例上针对多站点车辆路径问题 (MDVRP)、具有中间设施的(多站点)车辆路径问题 ((MD)VRPIF) 和具有站点间路线的多站点车辆路径问题进行了测试(MDVRPI)。MASS 显示了 MDVRP、VRPIF 和 MDVRPI 的竞争结果。对于 MDVRPIF,MASS 获得了比目前在文献中发现的结果更好的结果。为了评估其实用价值,MASS 用于解决布鲁塞尔首都地区现实生活中的废物收集问题,其中比较了城市生物废物收集和处理的替代方案。

更新日期:2022-11-17
down
wechat
bug