A Lower Bound for the Split Delivery Vehicle Routing Problem
From MaRDI portal
Publication:4530665
DOI10.1287/OPRE.48.5.801.12407zbMATH Open1106.90380OpenAlexW1988345713MaRDI QIDQ4530665FDOQ4530665
Author name not available (Why is that?)
Publication date: 4 June 2002
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/opre.48.5.801.12407
Programming involving graphs or networks (90C35) Transportation, logistics and supply chain management (90B06)
Cited In (37)
- New cutting-planes for the time- and/or precedence-constrained ATSP and directed VRP
- The split delivery capacitated team orienteering problem
- An extension of the relaxation algorithm for solving a special case of capacitated arc routing problems
- New exact solution approaches for the split delivery vehicle routing problem
- Particle Swarm Optimization for Split Delivery Vehicle Routing Problem
- Vehicle routing problems with split deliveries
- A branch-and-cut embedded matheuristic for the inventory routing problem
- The vehicle routing problem with demand range
- Branch-and-cut algorithms for the split delivery vehicle routing problem
- A randomized granular tabu search heuristic for the split delivery vehicle routing problem
- A column generation approach for the split delivery vehicle routing problem
- Two-echelon vehicle routing problems: a literature review
- A hybrid VND method for the split delivery vehicle routing problem
- An adaptive memory algorithm for the split delivery vehicle routing problem
- Improved lower bounds for the split delivery vehicle routing problem
- An improved branch-cut-and-price algorithm for the two-echelon capacitated vehicle routing problem
- Heuristics for multi-attribute vehicle routing problems: a survey and synthesis
- A column generation approach for the split delivery vehicle routing problem
- Simultaneously exploiting two formulations: an exact Benders decomposition approach
- An iterated local search heuristic for the split delivery vehicle routing problem
- A branch-price-and-cut method for a ship routing and scheduling problem with split loads
- Branch and price for the vehicle routing problem with discrete Split deliveries and time windows
- Scatter search for a real-life heterogeneous fleet vehicle routing problem with time windows and split deliveries in Brazil
- A branch-and-cut algorithm for an assembly routing problem
- The Vehicle Routing Problem with Stochastic Demands and Split Deliveries
- 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
- The Split Delivery Vehicle Routing Problem: A Survey
- 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
- A new model and hybrid approach for large scale inventory routing problems
- A hybrid multi-objective evolutionary algorithm for solving truck and trailer vehicle routing problems
- A tabu search heuristic for the vehicle routing problem with time windows and split deliveries
- Neural large neighborhood search for routing problems
- Integer linear programming models for a cement delivery problem
- Large scale stochastic inventory routing problems with~split delivery and service level constraints
- The split delivery vehicle routing problem with three-dimensional loading constraints
Uses Software
This page was built for publication: A Lower Bound 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 Q4530665)
