open access publication

Article, 2023

An adaptive large neighborhood search metaheuristic for a passenger and parcel share-a-ride problem with drones

Transportation Research Part C Emerging Technologies, ISSN 0968-090X, 1879-2359, Volume 153, Page 104203, 10.1016/j.trc.2023.104203

Contributors

Cheng, Rong 0000-0003-0189-2330 [1] Jiang, Yao 0000-0001-9461-633X (Corresponding author) [1] [2] Nielsen, Otto Anker 0000-0001-7901-7021 [1] Pisinger, David 0000-0001-7695-9662 [1]

Affiliations

  1. [1] Technical University of Denmark
  2. [NORA names: DTU Technical University of Denmark; University; Denmark; Europe, EU; Nordic; OECD];
  3. [2] Lancaster University
  4. [NORA names: United Kingdom; Europe, Non-EU; OECD]

Abstract

With the increasing concerns about traffic congestion and climate change, much effort has been made to enhance sustainable urban mobility for passengers and goods. One emerging promising strategy is to transport passengers and goods in an integrated manner, as it could reduce the number of vehicles on the road compared with the separate transportation of passengers and goods. This study proposes the simultaneous transportation of passengers and goods using demand-responsive buses and drones. Compared with the prevalent strategies that rely only on ground vehicles to integrate passenger and parcel transportation, we propose the joint usage of ground vehicles and drones to transport passengers and deliver parcels. The ground vehicles for passenger and parcel delivery are on-demand buses, which combine the advantages of the flexibility of taxis and the large capacity of public transport modes. The drones automatically take off from and land on the on-demand buses’ rooftops and are only for parcel delivery. A new optimization problem that designs the routes for both demand-responsive buses and drones is proposed and denoted as the passenger and parcel share-a-ride problem with drones (SARP-D). A mixed-integer nonlinear programming model is devised; the nonlinearity exists because drone launch/recovery can occur simultaneously with request servicing by a bus at the same node. To solve the model for large-scale instances, we develop an adaptive large neighborhood search metaheuristic. Numerical experiments are conducted to validate the correctness of the model and evaluate the efficiency of the metaheuristic. Moreover, sensitivity analyses are performed to explore the influences of the maximum number of intermediate stops during one passenger request service, the drone flight endurance, and the unit delay penalty on the total cost, which comprises the transportation and delay costs.

Keywords

analysis, bus, capacity, changes, climate, climate change, concerns, congestion, correction, cost, delay, delay cost, delay penalty, deliver parcels, delivery, drones, efficiency, efforts, endurance, experiments, flexibility, flight endurance, goods, ground, ground vehicles, increasing concern, influence, intermediate, joint usage, land, maximum number, metaheuristics, mixed-integer nonlinear programming model, mobility, mode, model, neighborhood, neighborhood search metaheuristic, nodes, nonlinear programming model, nonlinearity, number, numerical experiments, on-demand buses, optimization, optimization problem, parcel delivery, parcel transport, parcels, passenger, penalty, problem, programming model, public transport modes, requested service, road, rooftop, route, search metaheuristic, sensitivity, sensitivity analysis, services, share-a-ride problem, simultaneous transport, strategies, study, taxes, traffic, traffic congestion, transport, transport modes, transport passengers, transportation of passengers, units, urban mobility, vehicle

Funders

  • China Scholarship Council

Data Provider: Digital Science