The following pages link to Savings by Split Delivery Routing (Q3821924):
Displaying 35 items.
- A column generation-based heuristic for the split delivery vehicle routing problem with time windows (Q2226483) (← links)
- Branch and price for the vehicle routing problem with discrete Split deliveries and time windows (Q2275800) (← links)
- The split delivery vehicle routing problem with three-dimensional loading constraints (Q2282545) (← links)
- Adaptive large neighborhood search for the commodity constrained split delivery VRP (Q2329717) (← links)
- The bin packing problem with item fragmentation: a worst-case analysis (Q2414454) (← links)
- Humanitarian logistics planning for natural disaster response with Bayesian information updates (Q2438394) (← links)
- A memetic algorithm and a tabu search for the multi-compartment vehicle routing problem (Q2459404) (← links)
- A new model and hybrid approach for large scale inventory routing problems (Q2482782) (← links)
- Static pickup and delivery problems: a classification scheme and survey. (With comments and rejoinder) (Q2644426) (← links)
- Heuristic approaches for a vehicle routing problem with an incompatible loading constraint and splitting deliveries by order (Q2669495) (← links)
- Resilient route design for collection of material from suppliers with split deliveries and stochastic demands (Q2676305) (← links)
- The split delivery capacitated team orienteering problem (Q2811321) (← links)
- An approach for efficient ship routing (Q2865160) (← links)
- A novel approach to solve the split delivery vehicle routing problem (Q2968484) (← links)
- Split delivery routing (Q3035116) (← links)
- A two-stage vehicle routing model for large-scale bioterrorism emergencies (Q3057125) (← links)
- Approximate analysis of the delivery splitting model (Q3156653) (← links)
- The Split Delivery Vehicle Routing Problem: A Survey (Q3564351) (← links)
- Particle Swarm Optimization for Split Delivery Vehicle Routing Problem (Q4642133) (← links)
- Vehicle routing problems with split deliveries (Q4918250) (← links)
- A column generation approach for the split delivery vehicle routing problem (Q5894493) (← links)
- A column generation approach for the split delivery vehicle routing problem (Q5900196) (← links)
- A multiple-depot, multiple-vehicle, location-routing problem with stochastically processed demands (Q5953168) (← links)
- Green split multiple-commodity pickup and delivery vehicle routing problem (Q6047862) (← links)
- A branch-and-cut embedded matheuristic for the inventory routing problem (Q6047912) (← links)
- The split delivery vehicle routing problem with time windows and three-dimensional loading constraints (Q6065202) (← links)
- Exact and hyper‐heuristic solutions for the distribution‐installation problem from the VeRoLog 2019 challenge (Q6092665) (← links)
- The Maritime Pickup and Delivery Problem with Time Windows and Split Loads (Q6102720) (← links)
- The Vehicle Routing Problem with Stochastic Demands and Split Deliveries (Q6102745) (← links)
- Hybrid genetic algorithm for undirected traveling salesman problems with profits (Q6139377) (← links)
- The inventory routing problem with split deliveries (Q6180028) (← links)
- Systematic review of the latest scientific publications on the vehicle routing problem (Q6544925) (← links)
- Nested column generation for split pickup vehicle routing problem with time windows and time-dependent demand (Q6551134) (← links)
- Variable neighbourhood search based on Metropolis criterion for crowdsourced delivery scheduling problem in dispatch model (Q6568478) (← links)
- A heuristic with a performance guarantee for the commodity constrained split delivery vehicle routing problem (Q6659085) (← links)
