A Lower Bound for the Split Delivery Vehicle Routing Problem
From MaRDI portal
Publication:4530665
DOI10.1287/opre.48.5.801.12407zbMath1106.90380OpenAlexW1988345713MaRDI QIDQ4530665
No author found.
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)
Related Items
A tabu search heuristic for the vehicle routing problem with time windows and split deliveries, Branch-and-cut algorithms for the split delivery vehicle routing problem, An extension of the relaxation algorithm for solving a special case of capacitated arc routing problems, A hybrid VND method for the split delivery vehicle routing problem, 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, The vehicle routing problem with demand range, Simultaneously exploiting two formulations: an exact Benders decomposition approach, An exact approach for the green vehicle routing problem with two-dimensional loading constraints and split delivery, Integer linear programming models for a cement delivery problem, A branch-and-cut embedded matheuristic for the inventory routing problem, The Vehicle Routing Problem with Stochastic Demands and Split Deliveries, A novel approach to solve 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, Particle Swarm Optimization for Split Delivery Vehicle Routing Problem, New exact solution approaches for the split delivery vehicle routing problem, New cutting-planes for the time- and/or precedence-constrained ATSP and directed VRP, The Split Delivery Vehicle Routing Problem: A Survey, A column generation approach for the split delivery vehicle routing problem, Vehicle routing problems with split deliveries, A new model and hybrid approach for large scale inventory routing problems, Large scale stochastic inventory routing problems with~split delivery and service level constraints, An adaptive memory algorithm for the split delivery vehicle routing problem, A hybrid multi-objective evolutionary algorithm for solving truck and trailer vehicle routing problems, Branch and price for the vehicle routing problem with discrete Split deliveries and time windows, A tabu search algorithm for the vehicle routing problem with discrete split deliveries and pickups, Improved lower bounds for the split delivery vehicle routing problem, The split delivery vehicle routing problem with three-dimensional loading constraints, A branch-and-cut algorithm for an assembly routing problem, The split delivery capacitated team orienteering problem, Two-echelon vehicle routing problems: a literature review, Scatter search for a real-life heterogeneous fleet vehicle routing problem with time windows and split deliveries in Brazil, Neural large neighborhood search for routing problems, 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
Uses Software
