An iterated local search heuristic for the split delivery vehicle routing problem
From MaRDI portal
Publication:337288
DOI10.1016/j.cor.2014.08.005zbMath1348.90129OpenAlexW1995719137MaRDI QIDQ337288
Anand Subramanian, Marcos Melo Silva, Luiz Satoru Ochi
Publication date: 10 November 2016
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2014.08.005
Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59)
Related Items (22)
Alternative evaluation functions for the cyclic bandwidth sum problem ⋮ A novel hybrid multi-objective immune algorithm with adaptive differential evolution ⋮ A heuristic algorithm for a single vehicle static bike sharing rebalancing problem ⋮ An effective iterated tabu search for the maximum bisection problem ⋮ An exact hybrid method for the vehicle routing problem with time windows and multiple deliverymen ⋮ Exact and heuristic algorithms for order acceptance and scheduling with sequence-dependent setup times ⋮ Simultaneously exploiting two formulations: an exact Benders decomposition approach ⋮ A hybrid iterated local search heuristic for the traveling salesperson problem with hotel selection ⋮ Heuristic approaches for a vehicle routing problem with an incompatible loading constraint and splitting deliveries by order ⋮ An exact approach for the green vehicle routing problem with two-dimensional loading constraints and split delivery ⋮ The static bike relocation problem with multiple vehicles and visits ⋮ A branch-and-cut embedded matheuristic for the inventory routing problem ⋮ Order matters -- a variable neighborhood search for the swap-body vehicle routing problem ⋮ A novel approach to solve the split delivery vehicle routing problem ⋮ A heuristic algorithm for finding cost-effective solutions to real-world school bus routing problems ⋮ A hybrid heuristic for a broad class of vehicle routing problems with heterogeneous fleet ⋮ Particle Swarm Optimization for Split Delivery Vehicle Routing Problem ⋮ New exact solution approaches for the split delivery vehicle routing problem ⋮ A tabu search algorithm for the vehicle routing problem with discrete split deliveries and pickups ⋮ Large neighborhood-based metaheuristic and branch-and-price for the pickup and delivery problem with split loads ⋮ Integer programming formulations and efficient local search for relaxed correlation clustering ⋮ Neural large neighborhood search for routing problems
Uses Software
Cites Work
- A tabu search with vocabulary building approach for the vehicle routing problem with Split demands
- A ring-based diversification scheme for routing problems
- Variable neighbourhood search: methods and applications
- An adaptive memory algorithm for the split delivery vehicle routing problem
- A parallel heuristic for the vehicle routing problem with simultaneous pickup and delivery
- Improved lower bounds for the split delivery vehicle routing problem
- Scatter search for a real-life heterogeneous fleet vehicle routing problem with time windows and split deliveries in Brazil
- Vehicle routing with split deliveries
- Routing helicopters for crew exchanges on off-shore locations
- A simple and effective metaheuristic for the minimum latency problem
- Split delivery routing
- Savings by Split Delivery Routing
- TSPLIB—A Traveling Salesman Problem Library
- A Lower Bound for the Split Delivery Vehicle Routing Problem
- A Tabu Search Heuristic for the Vehicle Routing Problem
- Vehicle routing problems with split deliveries
- The split delivery vehicle routing problem: Applications, algorithms, test problems, and computational results
- A Method for Solving Traveling-Salesman Problems
- A food distribution network problem: a case study
- A column generation approach for the split delivery vehicle routing problem
- Ejection chain and filter-and-fan methods in combinatorial optimization
- A column generation approach for the split delivery vehicle routing problem
This page was built for publication: An iterated local search heuristic for the split delivery vehicle routing problem
