The following pages link to Savings by Split Delivery Routing (Q3821924):
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)
- Rich vehicle routing problems: from a taxonomy to a definition (Q299767) (← 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)
- Testing local search move operators on the vehicle routing problem with split deliveries and time windows (Q337460) (← links)
- A branch-price-and-cut method for a ship routing and scheduling problem with split loads (Q339703) (← links)
- Crossover iterated local search for SDCARP (Q489138) (← links)
- A randomized granular tabu search heuristic for the split delivery vehicle routing problem (Q490211) (← links)
- A solution approach to the inventory routing problem in a three-level distribution system (Q541738) (← links)
- An efficient column-generation-based algorithm for solving a pickup-and-delivery problem (Q547107) (← links)
- Efficient frameworks for greedy split and new depth first search split procedures for routing problems (Q613510) (← links)
- Planning for a bus-based evacuation (Q647528) (← links)
- Vehicle routing with compartments: applications, modelling and heuristics (Q657053) (← 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)
- Large neighborhood-based metaheuristic and branch-and-price for the pickup and delivery problem with split loads (Q724007) (← links)
- Shipper collaboration in forward and reverse logistics (Q781076) (← links)
- Dispatching a fishing trawler fleet in the Canadian Atlantic groundfish industry (Q807381) (← links)
- The multiple depot, multiple traveling salesmen facility-location problem: Vehicle range, service frequency, and heuristic implementations (Q814246) (← links)
- An extension of the relaxation algorithm for solving a special case of capacitated arc routing problems (Q841604) (← links)
- Improved bounds for vehicle routing solutions (Q865747) (← links)
- The vehicle routing problem with demand range (Q867541) (← links)
- The manpower allocation problem with time windows and job-teaming constraints: A branch-and-price approach (Q958447) (← links)
- An adaptive memory algorithm for the split delivery vehicle routing problem (Q972645) (← links)
- Improved lower bounds for the split delivery vehicle routing problem (Q991469) (← 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)
- Integrated production and outbound distribution scheduling problems with job release dates and deadlines (Q1617275) (← links)
- An iterated tabu search for the multi-compartment vehicle routing problem (Q1652237) (← links)
- A heuristic algorithm for finding cost-effective solutions to real-world school bus routing problems (Q1711659) (← 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)
- A tabu search algorithm for the vehicle routing problem with discrete split deliveries and pickups (Q1782165) (← links)
- Fleet assignment and routing with schedule synchronization constraints (Q1806762) (← 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)
- Integer linear programming models for a cement delivery problem (Q1926974) (← links)
- Multiobjective mathematical models and solution approaches for heterogeneous fixed fleet vehicle routing problems (Q1983754) (← 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)
- Approximation algorithms for the load-balanced capacitated vehicle routing problem (Q2043586) (← links)
- An integrated method for hybrid distribution with estimation of demand matching degree (Q2084644) (← links)
- Mathematical models for a ship routing problem with a small number of ports on a route (Q2110089) (← links)
- A branch-and-price algorithm for solving the single-hub feeder network design problem (Q2116907) (← links)
- Improved approximation algorithm for scheduling on a serial batch machine with split-allowed delivery (Q2176828) (← links)
- The fuel replenishment problem: a split-delivery multi-compartment vehicle routing problem with multiple trips (Q2185519) (← links)
