Split delivery routing
From MaRDI portal
Recommendations
Cites work
- A vehicle routing improvement algorithm comparison of a greedy and a matching implementation for inventory routing
- An exact algorithm for the asymmetrical capacitated vehicle routing problem
- Exact algorithms for the vehicle routing problem, based on spanning tree and shortest path relaxations
- Heuristics for unequal weight delivery problems with a fixed error guarantee
- Stochastic vehicle routing with modified savings algorithm
Cited in
(85)- An empirical study on the benefit of split loads with the pickup and delivery 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 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
- New exact solution approaches for the split delivery vehicle routing problem
- A hierarchical solution approach for a multicommodity distribution problem under a special cost structure
- Large scale stochastic inventory routing problems with~split delivery and service level constraints
- A tabu search algorithm for the vehicle routing problem with discrete split deliveries and pickups
- A tabu search heuristic for the vehicle routing problem with time windows and split deliveries
- The split delivery vehicle scheduling problem with time windows and grid network distances
- Routing problems: A bibliography
- Integer linear programming models for a cement delivery problem
- The two-echelon capacitated electric vehicle routing problem with battery swapping stations: formulation and efficient methodology
- A large neighborhood search for the pickup and delivery problem with time windows, split loads and transshipments
- The pickup and delivery problem with split loads and transshipments: a branch-and-cut solution approach
- A route decomposition approach for the single commodity split pickup and split delivery vehicle routing problem
- An analytical bound on the fleet size in vehicle routing problems: a dynamic programming approach
- The fuel replenishment problem: a split-delivery multi-compartment vehicle routing problem with multiple trips
- Branch and price for the vehicle routing problem with discrete Split deliveries and time windows
- The split delivery vehicle routing problem with three-dimensional loading constraints
- Adaptive large neighborhood search for the commodity constrained split delivery VRP
- The bin packing problem with item fragmentation: a worst-case analysis
- A new model and hybrid approach for large scale inventory routing problems
- Classification, models and exact algorithms for multi-compartment delivery problems
- Fleet design optimisation from historical data using constraint programming and large neighbourhood search
- Simultaneously exploiting two formulations: an exact Benders decomposition approach
- Resilient route design for collection of material from suppliers with split deliveries and stochastic demands
- The split delivery capacitated team orienteering problem
- A novel approach to solve the split delivery vehicle routing problem
- Branch-and-cut algorithms for the split delivery vehicle routing problem
- Heuristics for routes generation in pickup and delivery problem
- A two-stage vehicle routing model for large-scale bioterrorism emergencies
- Tour splitting algorithms for vehicle routing problems
- Metaheuristic algorithms for solving two interconnected vehicle routing problems in a hospital complex
- An iterated local search heuristic for the split delivery vehicle routing problem
- Technical note: Split algorithm in O(n) for the capacitated vehicle routing problem
- The min-max split delivery multi-depot vehicle routing problem with minimum service time requirement
- The split delivery vehicle routing problem: A survey
- A new capacitated vehicle routing problem with split service for minimizing fleet cost by simulated annealing
- A min-max vehicle routing problem with split delivery and heterogeneous demand
- Savings by Split Delivery Routing
- scientific article; zbMATH DE number 591242 (Why is no real title available?)
- A SPLIT DELIVERY VEHICLE ROUTING PROBLEM
- Split-delivery routeing heuristics in livestock feed distribution
- Particle swarm optimization for split delivery vehicle routing problem
- Consistent inventory routing with split deliveries
- Optimization on simultaneous pick-up and delivery vehicle routing problem with split delivery and stochastic travel and service time
- Crossover iterated local search for SDCARP
- A randomized granular tabu search heuristic for the split delivery vehicle routing problem
- Vehicle routing problems with split deliveries
- Routing in Point-to-Point Delivery Systems: Formulations and Solution Heuristics
- The split delivery vehicle routing problem: Applications, algorithms, test problems, and computational results
- An efficient column-generation-based algorithm for solving a pickup-and-delivery problem
- A column generation approach for the split delivery vehicle routing problem
- A column generation approach for the split delivery vehicle routing problem
- Green split multiple-commodity pickup and delivery vehicle routing problem
- A branch-and-cut embedded matheuristic for the inventory routing problem
- Matheuristics with performance guarantee for the unsplit and split delivery capacitated vehicle routing problem
- Exact and hyper‐heuristic solutions for the distribution‐installation problem from the VeRoLog 2019 challenge
- The Maritime Pickup and Delivery Problem with Time Windows and Split Loads
- The Vehicle Routing Problem with Stochastic Demands and Split Deliveries
- Efficient frameworks for greedy split and new depth first search split procedures for routing problems
- The inventory routing problem with split deliveries
- Planning for a bus-based evacuation
- Trajectory optimization for arbitrary layered geometries in wire-arc additive manufacturing
- Nested column generation for split pickup vehicle routing problem with time windows and time-dependent demand
- Optimizing combined tours: the truck-and-cargo-bike case
- Modeling vehicle routing with uncertain demands as a stochastic program: Properties of the corresponding solution
- Improved approximations for the capacitated vehicle routing problem with fixed capacity
- Exact methods for the split delivery vehicle routing problem with two-dimensional loading constraints
- The latency location routing problem with split deliveries: mathematical formulation and metaheuristic algorithm
- The vehicle routing problem with transfers
- An exact method for the two-echelon split-delivery vehicle routing problem for liquefied natural gas delivery with the boil-off phenomenon
- Multidepot capacitated vehicle routing with improved approximation guarantees
- On the feasibility of solutions to the split delivery vehicle routing problem represented as edge variables
- A large neighbourhood search heuristic for ship routing and scheduling with split loads
- Large neighborhood-based metaheuristic and branch-and-price for the pickup and delivery problem with split loads
- An extension of the relaxation algorithm for solving a special case of capacitated arc routing problems
- A dynamic logistics coordination model for evacuation and support in disaster response activities
- The vehicle routing problem with demand range
- Real-time split-delivery pickup and delivery time window problems with transfers
- An adaptive memory algorithm for the split delivery vehicle routing problem
- Improved lower bounds for the split delivery vehicle routing problem
This page was built for publication: Split delivery routing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3035116)
