Branch-and-price-and-cut for the split-delivery vehicle routing problem with time windows
From MaRDI portal
(Redirected from Publication:3100458)
Recommendations
- A column generation-based heuristic for the split delivery vehicle routing problem with time windows
- A column generation approach for the split delivery vehicle routing problem
- Branch and price for the vehicle routing problem with discrete Split deliveries and time windows
- Branch-and-cut algorithms for the split delivery vehicle routing problem
- A branch-price-and-cut algorithm for the commodity constrained split delivery vehicle routing problem
Cited in
(77)- A branch-price-and-cut algorithm for the vehicle routing problem with time windows and multiple deliverymen
- Scheduling cleaning activities on trains by minimizing idle times
- New exact solution approaches for the split delivery vehicle routing problem
- A branch and price algorithm to solve the integrated production planning and scheduling in bulk ports
- Branch-price-and-cut for the mixed capacitated general routing problem with time windows
- A tabu search heuristic for the vehicle routing problem with time windows and split deliveries
- Integer linear programming models for a cement delivery problem
- A branch-and-price algorithm for a vehicle routing with demand allocation problem
- Column generation for vehicle routing problems with multiple synchronization constraints
- 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
- Parameterized algorithms and complexity for the traveling purchaser problem and its variants
- The prisoner transportation problem
- Combined maintenance and routing optimization for large-scale sewage cleaning
- The fuel replenishment problem: a split-delivery multi-compartment vehicle routing problem with multiple trips
- Branch-cut-and-price for scheduling deliveries with time windows in a direct shipping network
- A column generation-based heuristic for the split delivery vehicle routing problem with time windows
- A branch-and-price algorithm for the liner shipping network design problem
- The inventory routing problem with demand moves
- Branch-and-price-and-cut for the multiple traveling repairman problem with distance constraints
- Branch and price for the vehicle routing problem with discrete Split deliveries and time windows
- The nuclear medicine production and delivery problem
- A multi-trip split-delivery vehicle routing problem with time windows for inventory replenishment under stochastic travel times
- Stabilized branch-price-and-cut for the commodity-constrained split delivery vehicle routing problem
- Synchronized routing of active and passive means of transport
- Classification of Dantzig-Wolfe reformulations for binary mixed integer programming problems
- An exact solution approach for the inventory routing problem with time windows
- The split delivery capacitated team orienteering problem
- The fixed-charge shortest-path problem
- Integrated charge batching and casting width selection at Baosteel
- Exact algorithms for electric vehicle-routing problems with time windows
- The surgical patient routing problem: a central planner approach
- Branch-and-cut algorithms for the split delivery vehicle routing problem
- Alternative approaches to the crude oil tanker routing and scheduling problem with split pickup and split delivery
- Two exact algorithms for the traveling umpire problem
- The multi-vehicle traveling purchaser problem with pairwise incompatibility constraints and unitary demands: a branch-and-price approach
- Liner shipping network design with deadlines
- A branch-price-and-cut method for a ship routing and scheduling problem with split loads
- A branch-price-and-cut algorithm for the commodity constrained split delivery vehicle routing problem
- Branch-cut-and-price for the vehicle routing problem with simultaneous pickup and delivery
- Branch-and-cut with lazy separation for the vehicle routing problem with simultaneous pickup and delivery
- Regenerator location problem in flexible optical networks
- Particle swarm optimization for split delivery vehicle routing problem
- A randomized granular tabu search heuristic for the split delivery vehicle routing problem
- Vehicle routing problems with split deliveries
- The Migratory Beekeeping Routing Problem: Model and an Exact Algorithm
- A branch-and-price-and-cut algorithm for the cable-routing problem in solar power plants
- Branch-and-price approaches for real-time vehicle routing with picking, loading, and soft time windows
- Reverse multistar inequalities and vehicle routing problems with a lower bound on the number of customers per route
- A column generation approach for the split delivery vehicle routing problem
- A column generation approach for the split delivery vehicle routing problem
- A branch-and-cut embedded matheuristic for the inventory routing problem
- A multi‐vehicle covering tour problem with speed optimization
- An exact solution method for home health care scheduling with synchronized services
- The Maritime Pickup and Delivery Problem with Time Windows and Split Loads
- Branch-Cut-and-Price for the Time-Dependent Green Vehicle Routing Problem with Time Windows
- A note on branch-and-cut-and-price
- A branch‐and‐price‐and‐cut algorithm for the truck‐drone routing problem with simultaneously delivery and pickup
- A two‐stage method for the shipper lane selection problem with time windows in transportation service procurement
- Nested column generation for split pickup vehicle routing problem with time windows and time-dependent demand
- A heuristic with a performance guarantee for the commodity constrained split delivery vehicle routing problem
- Partial dominance in branch-price-and-cut algorithms for vehicle routing and scheduling problems with a single-segment tradeoff
- Nested branch-and-price-and-cut for vehicle routing problems with multiple resource interdependencies
- Subset-row inequalities and unreachability in path-based formulations for vehicle routing and scheduling problems
- A branch-and-cut algorithm for the pallet-loading vehicle routing problem considering load balance of semi-trailer trucks
- Exact methods for the split delivery vehicle routing problem with two-dimensional loading constraints
- Adaptive large neighborhood search for autonomous electric vehicle scheduling in airport baggage transport service
- Vehicle routing problem for omnichannel retailing including multiple types of time windows and products
- An exact algorithm for simultaneous pickup and delivery problem with split demand and time windows
- An enhanced exact algorithm for the multi-trip vehicle routing problem with time windows and capacitated unloading station
- An exact method for the two-echelon split-delivery vehicle routing problem for liquefied natural gas delivery with the boil-off phenomenon
- An exact algorithm for the multi-trip vehicle routing problem with time windows and multi-skilled manpower
- A tutorial on Branch-Price-and-Cut algorithms
- A branch-price-and-cut algorithm for sustainable milk-run vehicle scheduling problem with cross-dimensional integration
- Branch-price-and-cut for the production routing problem with time windows
This page was built for publication: Branch-and-price-and-cut for the split-delivery vehicle routing problem with time windows
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3100458)
