An adaptive large neighborhood search heuristic for the vehicle routing problem with time windows and delivery robots
From MaRDI portal
Publication:2240065
DOI10.1016/j.ejor.2021.02.027zbMath1487.90085OpenAlexW3130612522MaRDI QIDQ2240065
Cheng Chen, Emrah Demir, Yu-An Huang
Publication date: 5 November 2021
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://orca.cardiff.ac.uk/138362/1/ALNS%20for%20VRPTWDR%20.pdf
Transportation, logistics and supply chain management (90B06) Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)
Related Items (15)
A branch-and-price algorithm for location-routing problems with pick-up stations in the last-mile distribution system ⋮ A mixed truck and robot delivery approach for the daily supply of customers ⋮ A survey of adaptive large neighborhood search algorithms and applications ⋮ An ALNS-based matheuristic algorithm for a multi-product many-to-many maritime inventory routing problem ⋮ A multi-visit flexible-docking vehicle routing problem with drones for simultaneous pickup and delivery services ⋮ Modelling and heuristically solving many-to-many heterogeneous vehicle routing problem with cross-docking and two-dimensional loading constraints ⋮ A general deep reinforcement learning hyperheuristic framework for solving combinatorial optimization problems ⋮ Efficient feasibility checks and an adaptive large neighborhood search algorithm for the time-dependent green vehicle routing problem with time windows ⋮ Drone location and vehicle fleet planning with trucks and aerial drones ⋮ A metaheuristic algorithm for a locomotive routing problem arising in the steel industry ⋮ Routing problems with electric and autonomous vehicles: review and potential for future research ⋮ The multi-vehicle truck-and-robot routing problem for last-mile delivery ⋮ QMOEA: a Q-learning-based multiobjective evolutionary algorithm for solving time-dependent green vehicle routing problems with time windows ⋮ Van-based robot hybrid pickup and delivery routing problem ⋮ A tailored Benders decomposition approach for last-mile delivery with autonomous robots
Uses Software
Cites Work
- A general heuristic for vehicle routing problems
- An exact hybrid method for the vehicle routing problem with time windows and multiple deliverymen
- Scheduling last-mile deliveries with truck-based autonomous robots
- Order matters -- a variable neighborhood search for the swap-body vehicle routing problem
- A metaheuristic for the time-dependent pollution-routing problem
- A hybrid VNS/tabu search algorithm for solving the vehicle routing problem with drones and en route operations
- An adaptive large neighborhood search heuristic for the pollution-routing problem
- Foreword: COR special issue on computational operations research for drone systems
- Solving the vehicle routing problem with multi-compartment vehicles for city logistics
- New Route Relaxation and Pricing Strategies for the Vehicle Routing Problem
- Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
- The Mothership and Drone Routing Problem
- The vehicle routing problem with drones: Extended models and connections
- Preface: Special issue on Drone Delivery Systems
- A variable neighborhood search for flying sidekick traveling salesman problem
This page was built for publication: An adaptive large neighborhood search heuristic for the vehicle routing problem with time windows and delivery robots
