A truck and drones model for last-mile delivery: a mathematical model and heuristic approach
From MaRDI portal
Publication:1988950
DOI10.1016/j.apm.2019.11.020zbMath1481.90066OpenAlexW2984182507WikidataQ126785884 ScholiaQ126785884MaRDI QIDQ1988950
Matthias Winkenbach, Ahmad Hemmati, Mohammad Moshref-Javadi
Publication date: 24 April 2020
Published in: Applied Mathematical Modelling (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.apm.2019.11.020
Related Items (17)
A logic-based Benders decomposition method for the multi-trip traveling repairman problem with drones ⋮ Time-optimal of fixed wing UAV aircraft with input and output constraints ⋮ The last-mile delivery process with trucks and drones under uncertain energy consumption ⋮ A mixed truck and robot delivery approach for the daily supply of customers ⋮ Truck and drone routing problem with synchronization on arcs ⋮ Modeling the flying sidekick traveling salesman problem with multiple drones ⋮ Trucks and drones cooperation in the last‐mile delivery process ⋮ Cost‐optimal truck‐and‐robot routing for last‐mile delivery ⋮ Enabling same-day delivery using a drone resupply model with transshipment points ⋮ A multi-visit flexible-docking vehicle routing problem with drones for simultaneous pickup and delivery services ⋮ Unmanned aerial vehicles/drones in vehicle routing problems: a literature review ⋮ The multi-vehicle truck-and-robot routing problem for last-mile delivery ⋮ Last‐mile delivery with drone and lockers ⋮ Ground-vehicle and unmanned-aerial-vehicle routing problems from two-echelon scheme perspective: a review ⋮ Improved prescribed performance anti-disturbance control for quadrotors ⋮ Van-based robot hybrid pickup and delivery routing problem ⋮ Simultaneous cooperation of refrigerated ground vehicle (RGV) and unmanned aerial vehicle (UAV) for rapid delivery with perishable food
Uses Software
Cites Work
- Unnamed Item
- Thirty years of heterogeneous vehicle routing
- Mathematical formulations and exact algorithm for the multitrip cumulative capacitated single-vehicle routing problem
- The latency location-routing problem
- Two improved formulations for the minimum latency problem
- The vehicle routing problem with drones: several worst-case results
- Efficient GRASP+VND and GRASP+VNS metaheuristics for the traveling repairman problem
- An effective memetic algorithm for the cumulative capacitated vehicle routing problem
- Vehicle routing problem with trailers
- An improved approximation ratio for the minimum latency problem
- Simulated annealing for complex portfolio selection problems.
- Guided local search and its application to the traveling salesman problem
- A simple and effective metaheuristic for the minimum latency problem
- Variable neighborhood search for the travelling deliveryman problem
- A modeling framework and local search solution methodology for a production-distribution problem with supplier selection and time-aggregated quantity discounts
- The minimum latency problem
- Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
- Two exact algorithms for the distance-constrained vehicle routing problem
- The complexity of the travelling repairman problem
- Special cases of traveling salesman and repairman problems with time windows
- Drone delivery from trucks: Drone scheduling for given truck routes
- The Traveling-Salesman Problem
- Least-squares fitting of circles and ellipses
- Benchmark Suite for Industrial and Tramp Ship Routing and Scheduling Problems
This page was built for publication: A truck and drones model for last-mile delivery: a mathematical model and heuristic approach
