Savings by Split Delivery Routing
From MaRDI portal
Publication:3821924
DOI10.1287/trsc.23.2.141zbMath0668.90044OpenAlexW2131338629WikidataQ115188648 ScholiaQ115188648MaRDI QIDQ3821924
Publication date: 1989
Published in: Transportation Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/trsc.23.2.141
Related Items
Fleet design optimisation from historical data using constraint programming and large neighbourhood search, Vehicle routing with split deliveries, Integrated production and outbound distribution scheduling problems with job release dates and deadlines, A tabu search heuristic for the vehicle routing problem with time windows and split deliveries, Branch-and-cut algorithms for the split delivery vehicle routing problem, Rich vehicle routing problems: from a taxonomy to a definition, An extension of the relaxation algorithm for solving a special case of capacitated arc routing problems, The split delivery vehicle scheduling problem with time windows and grid network distances, 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, Testing local search move operators on the vehicle routing problem with split deliveries and time windows, Static pickup and delivery problems: a classification scheme and survey. (With comments and rejoinder), An iterated tabu search for the multi-compartment vehicle routing problem, A branch-price-and-cut method for a ship routing and scheduling problem with split loads, Routing problems: A bibliography, Improved bounds for vehicle routing solutions, The vehicle routing problem with demand range, Improved approximation algorithm for scheduling on a serial batch machine with split-allowed delivery, Heuristic approaches for a vehicle routing problem with an incompatible loading constraint and splitting deliveries by order, Integer linear programming models for a cement delivery problem, The bin packing problem with item fragmentation: a worst-case analysis, The fuel replenishment problem: a split-delivery multi-compartment vehicle routing problem with multiple trips, Resilient route design for collection of material from suppliers with split deliveries and stochastic demands, Green split multiple-commodity pickup and delivery vehicle routing problem, A branch-and-cut embedded matheuristic for the inventory routing problem, The split delivery vehicle routing problem with time windows and three-dimensional loading constraints, 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, Hybrid genetic algorithm for undirected traveling salesman problems with profits, The inventory routing problem with split deliveries, A novel approach to solve the split delivery vehicle routing problem, Humanitarian logistics planning for natural disaster response with Bayesian information updates, A heuristic algorithm for finding cost-effective solutions to real-world school bus routing problems, Planning for a bus-based evacuation, Vehicle routing with compartments: applications, modelling and heuristics, A column generation-based heuristic for the split delivery vehicle routing problem with time windows, A memetic algorithm and a tabu search for the multi-compartment vehicle routing problem, Crossover iterated local search for SDCARP, A randomized granular tabu search heuristic for the split delivery vehicle routing problem, A column generation approach for the split delivery vehicle routing problem, Multiobjective mathematical models and solution approaches for heterogeneous fixed fleet vehicle routing problems, Particle Swarm Optimization for Split Delivery Vehicle Routing Problem, New exact solution approaches for the split delivery vehicle routing problem, The Split Delivery Vehicle Routing Problem: A Survey, The two-echelon capacitated electric vehicle routing problem with battery swapping stations: formulation and efficient methodology, A column generation approach for the split delivery vehicle routing problem, Modeling vehicle routing with uncertain demands as a stochastic program: Properties of the corresponding solution, The manpower allocation problem with time windows and job-teaming constraints: A branch-and-price approach, Vehicle routing problems with split deliveries, A new model and hybrid approach for large scale inventory routing problems, A hierarchical solution approach for a multicommodity distribution problem under a special cost structure, A solution approach to the inventory routing problem in a three-level distribution system, An efficient column-generation-based algorithm for solving a pickup-and-delivery problem, An adaptive memory algorithm for the split delivery vehicle routing problem, A large neighbourhood search heuristic for ship routing and scheduling with split loads, Branch and price for the vehicle routing problem with discrete Split deliveries and time windows, A tabu search algorithm for the vehicle routing problem with discrete split deliveries and pickups, A multiple-depot, multiple-vehicle, location-routing problem with stochastically processed demands, A two-stage vehicle routing model for large-scale bioterrorism emergencies, A large neighborhood search for the pickup and delivery problem with time windows, split loads and transshipments, Improved lower bounds for the split delivery vehicle routing problem, The pickup and delivery problem with split loads and transshipments: a branch-and-cut solution approach, Large neighborhood-based metaheuristic and branch-and-price for the pickup and delivery problem with split loads, The split delivery vehicle routing problem with three-dimensional loading constraints, Approximation algorithms for the load-balanced capacitated vehicle routing problem, The split delivery capacitated team orienteering problem, Fleet assignment and routing with schedule synchronization constraints, 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, Shipper collaboration in forward and reverse logistics, Adaptive large neighborhood search for the commodity constrained split delivery VRP, An integrated method for hybrid distribution with estimation of demand matching degree, An approach for efficient ship routing, Dispatching a fishing trawler fleet in the Canadian Atlantic groundfish industry, Mathematical models for a ship routing problem with a small number of ports on a route, The multiple depot, multiple traveling salesmen facility-location problem: Vehicle range, service frequency, and heuristic implementations, A branch-and-price algorithm for solving the single-hub feeder network design problem
