Routing of Carrier-vehicle Systems with Dedicated Last-stretch Delivery Vehicle and Fixed Carrier Route

Othman, Mohd Shahrizan; Shurbevski, Aleksandar; Karuno, Yoshiyuki; Nagamochi, Hiroshi

doi:10.2197/ipsjjip.25.655

Cited by 33 publications

(23 citation statements)

References 12 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Based on both basic routing tasks, the drone literature investigates a broad variety of problem extensions. Othman et al (2017) and Boysen et al (2018a) extract different versions of drone routing problems, when the truck route is already fixed and given. Ha et al (2018) treat the min-cost TSP-D which considers that drone and truck have different travel costs.…”

Section: Dronesmentioning

confidence: 99%

Last-mile delivery concepts: a survey from an operational research perspective

2020

View full text Add to dashboard Cite

In the wake of e-commerce and its successful diffusion in most commercial activities, last-mile distribution causes more and more trouble in urban areas all around the globe. Growing parcel volumes to be delivered toward customer homes increase the number of delivery vans entering the city centers and thus add to congestion, pollution, and negative health impact. Therefore, it is anything but surprising that in recent years many novel delivery concepts on the last mile have been innovated. Among the most prominent are unmanned aerial vehicles (drones) and autonomous delivery robots taking over parcel delivery. This paper surveys established and novel last-mile concepts and puts special emphasis on the decision problems to be solved when setting up and operating each concept. To do so, we systematically record the alternative delivery concepts in a compact notation scheme, discuss the most important decision problems, and survey existing research on operations research methods solving these problems. Furthermore, we elaborate promising future research avenues.

show abstract

Section: Dronesmentioning

confidence: 99%

Last-mile delivery concepts: a survey from an operational research perspective

2020

View full text Add to dashboard Cite

show abstract

“…Othman et al. () introduce four different variants for DDPs. The first variant is the alternating last‐stretch delivery problem, or ALSDP, where the drone launches from the truck and, while it is delivering a parcel, the truck is allowed to wait for the drone to return at the previous set rendezvous point.…”

Section: Related Workmentioning

confidence: 99%

A variable neighborhood search for flying sidekick traveling salesman problem

Freitas

Penna

2019

Int Trans Operational Res

161

View full text Add to dashboard Cite

The efficiency and dynamism of unmanned aerial vehicles, or drones, have presented substantial application opportunities in several industries in the last years. Notably, logistic companies have given close attention to these vehicles to reduce delivery time and operational cost. A variant of the traveling salesman problem (TSP), called the flying sidekick traveling salesman problem, was introduced involving drone‐assisted parcel delivery. The drone launches from the truck, proceeds to deliver parcels to a customer, and then is recovered by the truck at a third location. While the drone travels through a trip, the truck delivers parcels to other customers as long as the drone has enough battery to hover waiting for the truck. This work proposes a hybrid heuristic where the initial solution is created from the optimal TSP solution reached by a TSP solver. Next, an implementation of the general variable neighborhood search is employed to obtain the delivery routes of truck and drone. Computational experiments show the potential of the algorithm to improve significantly delivery time. Furthermore, we provide a new set of instances based on the well‐known traveling salesman problem library instances.

show abstract

“…Afterwards, Poikonen et al [16] extended the research and theoretically analyzed the maximum benefit under ideal circumstances. The second variant is Alternating Last-Stretch Delivery Problem (ALSDP) [17], in which the GV route is fixed and the main decision is to choose a set of rendezvous nodes for launching and recycling.…”

Section: Literature Reviewmentioning

confidence: 99%

Cooperative Routing Problem for Ground Vehicle and Unmanned Aerial Vehicle: The Application on Intelligence, Surveillance, and Reconnaissance Missions

et al. 2019

View full text Add to dashboard Cite

In this paper, we investigate a novel two-echelon ground vehicle and its mounted unmanned aerial vehicle cooperative routing problem (2E-GUCRP) for intelligence, surveillance, and reconnaissance (ISR) missions. In a typical cooperative system with ground vehicle (GV) and unmanned aerial vehicle (UAV), the UAV is launched from the GV, automatically flies to the designated target and return to the GV before powering off. Meanwhile, acting as a mobile platform, the GV can carry the UAV moving in a larger region and charge or exchange the UAV's battery. The objective is to design efficient GV and UAV routes to minimize the total mission time while meeting the operational constraints. A mixed integer programming (MIP) model, which could be solved by commercial software (e.g. CPLEX), is developed to formulate the problem. In order to quickly solve the medium-scale or above problems, two heuristics are designed. The random instances and practical case based on the road network in Changsha, China, are used for experiments. The computational results indicate that, compared to the mode of two-echelon vehicle routing problem (2E-VRP), the cooperative GV and UAV can complete the ISR missions in a much shorter time through utilizing the proposed 2E-GUCRP mode. Furthermore, discussion of the practical instance points out that the increase in efficiency is related to the speed relationship between the GV and the UAV. INDEX TERMS Two-echelon routing, vehicle routing, UAV routing, heuristic.

show abstract

Routing of Carrier-vehicle Systems with Dedicated Last-stretch Delivery Vehicle and Fixed Carrier Route

Cited by 33 publications

References 12 publications

Last-mile delivery concepts: a survey from an operational research perspective

Last-mile delivery concepts: a survey from an operational research perspective

A variable neighborhood search for flying sidekick traveling salesman problem

Cooperative Routing Problem for Ground Vehicle and Unmanned Aerial Vehicle: The Application on Intelligence, Surveillance, and Reconnaissance Missions

Contact Info

Product

Resources

About