Adaptive large neighborhood search for the vehicle routing problem with synchronization constraints at the delivery location

DOI10.1002/net.21905zbMath1526.90003OpenAlexW2972747848WikidataQ127236086 ScholiaQ127236086MaRDI QIDQ6068533

Karl F. Doerner, Briseida Sarasola

Publication date: 13 November 2023

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/net.21905

zbMATH Keywords

vehicle routing problemcooperationmetaheuristicadaptive large neighborhood searchself-imposed time windowssynchronized transportation

Mathematics Subject Classification ID

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

Related Items (5)

A new constraint programming model and a linear programming-based adaptive large neighborhood search for the vehicle routing problem with synchronization constraints ⋮ A survey of adaptive large neighborhood search algorithms and applications ⋮ Fixed interval scheduling with third‐party machines ⋮ Flexible vehicle scheduling with precedence constraints for tourists ⋮ The synchronized multi-assignment orienteering problem

Cites Work

• Unnamed Item
• The dial-A-ride problem with transfers
• Minimum cost VRP with time-dependent speed data and congestion charge
• An adaptive large neighborhood search heuristic for two-echelon vehicle routing problems arising in city logistics
• A heuristic to solve the synchronized log-truck scheduling problem
• \textsc{Laps}\ \textsc{Care} -- an operational system for staff planning of home care
• A general heuristic for vehicle routing problems
• Threshold accepting: A general purpose optimization algorithm appearing superior to simulated annealing
• The manpower allocation problem with time windows and job-teaming constraints: A branch-and-price approach
• Hybridization of very large neighborhood search for ready-mixed concrete delivery problems
• Temporal constraint networks
• An adaptive large neighborhood search for the full truckload pickup and delivery problem with resource synchronization
• Large neighborhood search with constraint programming for a vehicle routing problem with synchronization constraints
• A matheuristic based on large neighborhood search for the vehicle routing problem with cross-docking
• Synchronized arc routing for snow plowing operations
• Solving routing problems with pairwise synchronization constraints
• Fleet assignment and routing with schedule synchronization constraints
• Self-imposed time windows in vehicle routing problems
• City-courier routing and scheduling problems
• A review of dynamic vehicle routing problems
• Improved branch-cut-and-price for capacitated vehicle routing
• Dynamic transport scheduling under multiple resource constraints
• A unified solution framework for multi-attribute vehicle routing problems
• Ensuring service levels in routing problems with time windows and stochastic travel times
• A template-based adaptive large neighborhood search for the consistent vehicle routing problem
• Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
• On a routing problem
• Vehicle Routing Problems with Inter-Tour Resource Constraints
• Shortest‐path methods: Complexity, interrelations and new propositions
• Implementation and efficiency of Moore-algorithms for the shortest route problem
• Shortest-path feasibility algorithms

This page was built for publication: Adaptive large neighborhood search for the vehicle routing problem with synchronization constraints at the delivery location