An iterated local search heuristic for the split delivery vehicle routing problem
From MaRDI portal
Publication:337288
DOI10.1016/J.COR.2014.08.005zbMATH Open1348.90129OpenAlexW1995719137MaRDI QIDQ337288FDOQ337288
A. Subramanian, Luiz S. Ochi, Marcos Melo Silva
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
Approximation methods and heuristics in mathematical programming (90C59) Transportation, logistics and supply chain management (90B06)
Cites Work
- TSPLIB—A Traveling Salesman Problem Library
- A Method for Solving Traveling-Salesman Problems
- Split delivery routing
- Savings by Split Delivery Routing
- Variable neighbourhood search: methods and applications
- A Lower Bound for the Split Delivery Vehicle Routing Problem
- Vehicle routing problems with split deliveries
- The split delivery vehicle routing problem: Applications, algorithms, test problems, and computational results
- A tabu search with vocabulary building approach for the vehicle routing problem with Split demands
- A column generation approach for the split delivery vehicle routing problem
- A ring-based diversification scheme for routing problems
- An adaptive memory algorithm for the split delivery vehicle routing problem
- Improved lower bounds for the split delivery vehicle routing problem
- Vehicle routing with split deliveries
- A Tabu Search Heuristic for the Vehicle Routing Problem
- A column generation approach for the split delivery vehicle routing problem
- A parallel heuristic for the vehicle routing problem with simultaneous pickup and delivery
- Scatter search for a real-life heterogeneous fleet vehicle routing problem with time windows and split deliveries in Brazil
- A simple and effective metaheuristic for the minimum latency problem
- Routing helicopters for crew exchanges on off-shore locations
- A food distribution network problem: a case study
- Ejection chain and filter-and-fan methods in combinatorial optimization
Cited In (27)
- A variable neighborhood search for the green vehicle routing problem with two-dimensional loading constraints and split delivery
- A tabu search heuristic for the split delivery vehicle routing problem with production and demand calendars
- An effective iterated tabu search for the maximum bisection problem
- A hybrid heuristic for a broad class of vehicle routing problems with heterogeneous fleet
- New exact solution approaches for the split delivery vehicle routing problem
- Particle Swarm Optimization for Split Delivery Vehicle Routing Problem
- A branch-and-cut embedded matheuristic for the inventory routing problem
- Alternative evaluation functions for the cyclic bandwidth sum problem
- Large neighborhood-based metaheuristic and branch-and-price for the pickup and delivery problem with split loads
- An exact hybrid method for the vehicle routing problem with time windows and multiple deliverymen
- A hybrid VND method for the split delivery vehicle routing problem
- Exact and heuristic algorithms for order acceptance and scheduling with sequence-dependent setup times
- Order matters -- a variable neighborhood search for the swap-body vehicle routing problem
- A novel hybrid multi-objective immune algorithm with adaptive differential evolution
- Simultaneously exploiting two formulations: an exact Benders decomposition approach
- A heuristic algorithm for a single vehicle static bike sharing rebalancing problem
- The static bike relocation problem with multiple vehicles and visits
- A heuristic algorithm for finding cost-effective solutions to real-world school bus routing problems
- Integer programming formulations and efficient local search for relaxed correlation clustering
- A hybrid iterated local search heuristic for the traveling salesperson problem with hotel selection
- An exact approach for the green vehicle routing problem with two-dimensional loading constraints and split delivery
- A heuristic with a performance guarantee for the commodity constrained split delivery vehicle routing problem
- A tabu search algorithm for the vehicle routing problem with discrete split deliveries and pickups
- A novel approach to solve the split delivery vehicle routing problem
- Neural large neighborhood search for routing problems
- Nested column generation for split pickup vehicle routing problem with time windows and time-dependent demand
- Heuristic approaches for a vehicle routing problem with an incompatible loading constraint and splitting deliveries by order
Uses Software
This page was built for publication: An iterated local search heuristic for the split delivery vehicle routing problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q337288)
