Adaptive large neighborhood search for the commodity constrained split delivery VRP

DOI10.1016/J.COR.2019.07.019zbMath1458.90097OpenAlexW2966864247MaRDI QIDQ2329717

Maxime Ogier, Wenjuan Gu, Frédéric Semet, Diego Cattaruzza

Publication date: 18 October 2019

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2019.07.019

zbMATH Keywords

local searchvehicle routing problemadaptive large neighborhood searchmultiple commodities

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59)

Related Items (4)

The aquaculture service vessel routing problem with time dependent travel times and synchronization constraints ⋮ Heuristic approaches for a vehicle routing problem with an incompatible loading constraint and splitting deliveries by order ⋮ A survey of adaptive large neighborhood search algorithms and applications ⋮ Exact and hyper‐heuristic solutions for the distribution‐installation problem from the VeRoLog 2019 challenge

Uses Software

• VRP

Cites Work

• Large neighborhood search for multi-trip vehicle routing
• An adaptive large neighborhood search for a vehicle routing problem with multiple routes
• A branch-price-and-cut algorithm for the commodity constrained split delivery vehicle routing problem
• General solutions to the single vehicle routing problem with pickups and deliveries
• A simple and effective evolutionary algorithm for the vehicle routing problem
• Vehicle Routing
• Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
• Split delivery routing
• Savings by Split Delivery Routing
• Vehicle routing problems with split deliveries

This page was built for publication: Adaptive large neighborhood search for the commodity constrained split delivery VRP