The following pages link to Split delivery routing (Q3035116):
Displaying 50 items.
- Fleet design optimisation from historical data using constraint programming and large neighbourhood search (Q265693) (← links)
- Branch-and-cut algorithms for the split delivery vehicle routing problem (Q296858) (← links)
- Metaheuristic algorithms for solving two interconnected vehicle routing problems in a hospital complex (Q336558) (← links)
- An iterated local search heuristic for the split delivery vehicle routing problem (Q337288) (← links)
- The min-max split delivery multi-depot vehicle routing problem with minimum service time requirement (Q342348) (← links)
- Crossover iterated local search for SDCARP (Q489138) (← links)
- A randomized granular tabu search heuristic for the split delivery vehicle routing problem (Q490211) (← links)
- An efficient column-generation-based algorithm for solving a pickup-and-delivery problem (Q547107) (← links)
- Planning for a bus-based evacuation (Q647528) (← links)
- Modeling vehicle routing with uncertain demands as a stochastic program: Properties of the corresponding solution (Q684320) (← links)
- A large neighbourhood search heuristic for ship routing and scheduling with split loads (Q709186) (← links)
- An extension of the relaxation algorithm for solving a special case of capacitated arc routing problems (Q841604) (← links)
- A dynamic logistics coordination model for evacuation and support in disaster response activities (Q864038) (← links)
- The vehicle routing problem with demand range (Q867541) (← links)
- An adaptive memory algorithm for the split delivery vehicle routing problem (Q972645) (← links)
- An empirical study on the benefit of split loads with the pickup and delivery problem (Q1042050) (← links)
- Scatter search for a real-life heterogeneous fleet vehicle routing problem with time windows and split deliveries in Brazil (Q1042225) (← links)
- Vehicle routing with split deliveries (Q1327209) (← links)
- A heuristic algorithm for finding cost-effective solutions to real-world school bus routing problems (Q1711659) (← links)
- A hybrid heuristic for a broad class of vehicle routing problems with heterogeneous fleet (Q1730643) (← links)
- New exact solution approaches for the split delivery vehicle routing problem (Q1742903) (← links)
- A hierarchical solution approach for a multicommodity distribution problem under a special cost structure (Q1761205) (← links)
- Large scale stochastic inventory routing problems with~split delivery and service level constraints (Q1761929) (← links)
- A tabu search algorithm for the vehicle routing problem with discrete split deliveries and pickups (Q1782165) (← links)
- A tabu search heuristic for the vehicle routing problem with time windows and split deliveries (Q1879783) (← links)
- The split delivery vehicle scheduling problem with time windows and grid network distances (Q1892675) (← links)
- Routing problems: A bibliography (Q1908308) (← links)
- The two-echelon capacitated electric vehicle routing problem with battery swapping stations: formulation and efficient methodology (Q1991213) (← links)
- A large neighborhood search for the pickup and delivery problem with time windows, split loads and transshipments (Q2026973) (← links)
- The pickup and delivery problem with split loads and transshipments: a branch-and-cut solution approach (Q2029026) (← links)
- A route decomposition approach for the single commodity split pickup and split delivery vehicle routing problem (Q2029263) (← links)
- The fuel replenishment problem: a split-delivery multi-compartment vehicle routing problem with multiple trips (Q2185519) (← 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)
- A new model and hybrid approach for large scale inventory routing problems (Q2482782) (← links)
- Classification, models and exact algorithms for multi-compartment delivery problems (Q2630232) (← links)
- Simultaneously exploiting two formulations: an exact Benders decomposition approach (Q2664373) (← links)
- Resilient route design for collection of material from suppliers with split deliveries and stochastic demands (Q2676305) (← links)
- A novel approach to solve the split delivery vehicle routing problem (Q2968484) (← links)
- A two-stage vehicle routing model for large-scale bioterrorism emergencies (Q3057125) (← 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)
- The split delivery vehicle routing problem: Applications, algorithms, test problems, and computational results (Q5295488) (← 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 branch-and-cut embedded matheuristic for the inventory routing problem (Q6047912) (← links)
- Exact and hyper‐heuristic solutions for the distribution‐installation problem from the VeRoLog 2019 challenge (Q6092665) (← links)
