Pick-Up and Delivery Problem for Sequentially Consolidated Urban Transportation with Mixed and Multi-Pupropse Vehicle Fleet
Different urban transportation flows (e.g., passenger journeys, freight distribution, and waste management) are conventionally separately handled by corresponding single-purpose vehicles (SVs). The multi-purpose vehicle (MV) is a novel vehicle concept that can enable the sequential sharing of differ...
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Wiley
2022-01-01
|
| Series: | Journal of Advanced Transportation |
| Online Access: | http://dx.doi.org/10.1155/2022/2920532 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1832564040883240960 |
|---|---|
| author | Haoye Chen Jonas Hatzenbühler Erik Jenelius |
| author_facet | Haoye Chen Jonas Hatzenbühler Erik Jenelius |
| author_sort | Haoye Chen |
| collection | DOAJ |
| description | Different urban transportation flows (e.g., passenger journeys, freight distribution, and waste management) are conventionally separately handled by corresponding single-purpose vehicles (SVs). The multi-purpose vehicle (MV) is a novel vehicle concept that can enable the sequential sharing of different transportation flows by changing the so-called modules, thus theoretically improving the efficiency of urban transportation through the utilization of higher vehicles. In this study, a variant of the pick-up and delivery problem with time windows is established to describe the sequential sharing problem considering both MVs and SVs with features of multiple depots, partial recharging strategies, and fleet sizing. MVs can change their load modules to carry all item types that can also be carried by SVs. To solve the routing problem, an adaptive large neighborhood search (ALNS) algorithm is developed with new problem-specific heuristics. The proposed ALNS is tested on 15 small-size cases and evaluated using a commercial MIP solver. Results show that the proposed algorithm is time-efficient and able to generate robust and high-quality solutions. We investigate the performance of the ALNS algorithm by analyzing convergence and selection probabilities of the heuristic solution that destroy and repair operators. On 15 large-size instances, we compare results for pure SV, pure MV, and mixed fleets, showing that the introduction of MVs can allow smaller fleet sizes while approximately keeping the same total travel distance as for pure SVs. |
| format | Article |
| id | doaj-art-0dda37bb98824965adeaea607b56fbc7 |
| institution | Kabale University |
| issn | 2042-3195 |
| language | English |
| publishDate | 2022-01-01 |
| publisher | Wiley |
| record_format | Article |
| series | Journal of Advanced Transportation |
| spelling | doaj-art-0dda37bb98824965adeaea607b56fbc72025-02-03T01:11:56ZengWileyJournal of Advanced Transportation2042-31952022-01-01202210.1155/2022/2920532Pick-Up and Delivery Problem for Sequentially Consolidated Urban Transportation with Mixed and Multi-Pupropse Vehicle FleetHaoye Chen0Jonas Hatzenbühler1Erik Jenelius2School of Architecture and the Built EnvironmentDivision of Transport PlanningDivision of Transport PlanningDifferent urban transportation flows (e.g., passenger journeys, freight distribution, and waste management) are conventionally separately handled by corresponding single-purpose vehicles (SVs). The multi-purpose vehicle (MV) is a novel vehicle concept that can enable the sequential sharing of different transportation flows by changing the so-called modules, thus theoretically improving the efficiency of urban transportation through the utilization of higher vehicles. In this study, a variant of the pick-up and delivery problem with time windows is established to describe the sequential sharing problem considering both MVs and SVs with features of multiple depots, partial recharging strategies, and fleet sizing. MVs can change their load modules to carry all item types that can also be carried by SVs. To solve the routing problem, an adaptive large neighborhood search (ALNS) algorithm is developed with new problem-specific heuristics. The proposed ALNS is tested on 15 small-size cases and evaluated using a commercial MIP solver. Results show that the proposed algorithm is time-efficient and able to generate robust and high-quality solutions. We investigate the performance of the ALNS algorithm by analyzing convergence and selection probabilities of the heuristic solution that destroy and repair operators. On 15 large-size instances, we compare results for pure SV, pure MV, and mixed fleets, showing that the introduction of MVs can allow smaller fleet sizes while approximately keeping the same total travel distance as for pure SVs.http://dx.doi.org/10.1155/2022/2920532 |
| spellingShingle | Haoye Chen Jonas Hatzenbühler Erik Jenelius Pick-Up and Delivery Problem for Sequentially Consolidated Urban Transportation with Mixed and Multi-Pupropse Vehicle Fleet Journal of Advanced Transportation |
| title | Pick-Up and Delivery Problem for Sequentially Consolidated Urban Transportation with Mixed and Multi-Pupropse Vehicle Fleet |
| title_full | Pick-Up and Delivery Problem for Sequentially Consolidated Urban Transportation with Mixed and Multi-Pupropse Vehicle Fleet |
| title_fullStr | Pick-Up and Delivery Problem for Sequentially Consolidated Urban Transportation with Mixed and Multi-Pupropse Vehicle Fleet |
| title_full_unstemmed | Pick-Up and Delivery Problem for Sequentially Consolidated Urban Transportation with Mixed and Multi-Pupropse Vehicle Fleet |
| title_short | Pick-Up and Delivery Problem for Sequentially Consolidated Urban Transportation with Mixed and Multi-Pupropse Vehicle Fleet |
| title_sort | pick up and delivery problem for sequentially consolidated urban transportation with mixed and multi pupropse vehicle fleet |
| url | http://dx.doi.org/10.1155/2022/2920532 |
| work_keys_str_mv | AT haoyechen pickupanddeliveryproblemforsequentiallyconsolidatedurbantransportationwithmixedandmultipupropsevehiclefleet AT jonashatzenbuhler pickupanddeliveryproblemforsequentiallyconsolidatedurbantransportationwithmixedandmultipupropsevehiclefleet AT erikjenelius pickupanddeliveryproblemforsequentiallyconsolidatedurbantransportationwithmixedandmultipupropsevehiclefleet |