An iterated local search heuristic for the split delivery vehicle routing problem

DOI10.1016/J.COR.2014.08.005MaRDI QIDQ337288zbMATH OpenOpenAlexFDO

Authors Marcos Melo Silva, A. Subramanian, Luiz S. 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

zbMATH Keywords

metaheuristicsvehicle routingiterated local searchsplit deliveries

Mathematics Subject Classification ID

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

Recommendations

• A novel approach to solve the split delivery vehicle routing problem
• The split delivery vehicle routing problem: Applications, algorithms, test problems, and computational results
• A SPLIT DELIVERY VEHICLE ROUTING PROBLEM
• The split delivery vehicle routing problem: A survey
• A hybrid VND method for the split delivery vehicle routing problem

Cites work

• A Lower Bound for the Split Delivery Vehicle Routing Problem
• A Tabu Search Heuristic for the Vehicle Routing Problem
• A column generation approach for the split delivery vehicle routing problem
• A column generation approach for the split delivery vehicle routing problem
• A food distribution network problem: a case study
• A method for solving traveling-salesman problems
• A parallel heuristic for the vehicle routing problem with simultaneous pickup and delivery
• A ring-based diversification scheme for routing problems
• A simple and effective metaheuristic for the minimum latency problem
• A tabu search with vocabulary building approach for the vehicle routing problem with Split demands
• An adaptive memory algorithm for the split delivery vehicle routing problem
• Ejection chain and filter-and-fan methods in combinatorial optimization
• Improved lower bounds for the split delivery vehicle routing problem
• Routing helicopters for crew exchanges on off-shore locations
• Savings by Split Delivery Routing
• Scatter search for a real-life heterogeneous fleet vehicle routing problem with time windows and split deliveries in Brazil
• Split delivery routing
• TSPLIB—A Traveling Salesman Problem Library
• The split delivery vehicle routing problem: Applications, algorithms, test problems, and computational results
• Variable neighbourhood search: methods and applications
• Vehicle routing problems with split deliveries
• Vehicle routing with split deliveries

Cited in

(32)

• A tabu search heuristic for the split delivery vehicle routing problem with production and demand calendars
• A branch-and-cut embedded matheuristic for the inventory routing problem
• A hybrid iterated local search heuristic for the traveling salesperson problem with hotel selection
• Local search algorithm for the multi-depot weighted vehicle routing problem
• A hybrid heuristic for a broad class of vehicle routing problems with heterogeneous fleet
• An exact hybrid method for the vehicle routing problem with time windows and multiple deliverymen
• A heuristic with a performance guarantee for the commodity constrained split delivery vehicle routing problem
• Simultaneously exploiting two formulations: an exact Benders decomposition approach
• Alternative evaluation functions for the cyclic bandwidth sum problem
• 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
• Nested column generation for split pickup vehicle routing problem with time windows and time-dependent demand
• A novel approach to solve the split delivery vehicle routing problem
• An exact approach for the green vehicle routing problem with two-dimensional loading constraints and split delivery
• An integration of Lagrangian split and VNS: the case of the capacitated vehicle routing problem
• Exact and heuristic algorithms for order acceptance and scheduling with sequence-dependent setup times
• Matheuristics with performance guarantee for the unsplit and split delivery capacitated vehicle routing problem
• An effective iterated tabu search for the maximum bisection problem
• Neural large neighborhood search for routing problems
• Particle swarm optimization for split delivery vehicle routing problem
• A hybrid VND method for the split delivery vehicle routing problem
• Large neighborhood-based metaheuristic and branch-and-price for the pickup and delivery problem with split loads
• A heuristic algorithm for a single vehicle static bike sharing rebalancing problem
• New exact solution approaches for the split delivery vehicle routing problem
• Order matters -- a variable neighborhood search for the swap-body vehicle routing problem
• Heuristic approaches for a vehicle routing problem with an incompatible loading constraint and splitting deliveries by order
• A variable neighborhood search for the green vehicle routing problem with two-dimensional loading constraints and split delivery
• An overview on the split delivery vehicle routing problem
• Testing local search move operators on the vehicle routing problem with split deliveries and time windows
• A novel hybrid multi-objective immune algorithm with adaptive differential evolution
• A tabu search algorithm for the vehicle routing problem with discrete split deliveries and pickups
• The static bike relocation problem with multiple vehicles and visits

Describes a project that uses

Uses Software

• TSPLIB

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)