Vehicle routing problems with split deliveries

DOI10.1111/J.1475-3995.2011.00811.XMaRDI QIDQ4918250zbMATH OpenOpenAlexFDO

Authors C. Archetti, Maria Grazia Speranza

Publication date 24 April 2013

Published in International Transactions in Operational Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1111/j.1475-3995.2011.00811.x

zbMATH Keywords

split deliveriessurveytraveling salesman problemvehicle routing problem

Mathematics Subject Classification ID

Traffic problems in operations research (90B20) Combinatorial optimization (90C27)

Recommendations

• The split delivery vehicle routing problem: A survey
• An overview on the split delivery vehicle routing problem
• A SPLIT DELIVERY VEHICLE ROUTING PROBLEM
• New exact solution approaches for the split delivery vehicle routing problem
• The split delivery vehicle routing problem: Applications, algorithms, test problems, and computational results

Cites work

• A column generation approach for the split delivery vehicle routing problem
• A dynamic logistics coordination model for evacuation and support in disaster response activities
• A food distribution network problem: a case study
• A Lower Bound for the Split Delivery Vehicle Routing Problem
• A new capacitated vehicle routing problem with split service for minimizing fleet cost by simulated annealing
• A new model and hybrid approach for large scale inventory routing problems
• A parallel clustering technique for the vehicle routing problem with split deliveries and pickups
• A tabu search heuristic for the split delivery vehicle routing problem with production and demand calendars
• A tabu search heuristic for the vehicle routing problem with time windows and split deliveries
• A tabu search with vocabulary building approach for the vehicle routing problem with Split demands
• A two-stage vehicle routing model for large-scale bioterrorism emergencies
• A worst-case analysis for the split delivery vehicle routing problem with minimum delivery amounts
• An adaptive memory algorithm for the split delivery vehicle routing problem
• AN ALGORITHM FOR THE GENERALIZED VEHICLE ROUTING PROBLEM WITH BACKHAULING
• An empirical study on the benefit of split loads with the pickup and delivery problem
• An Evolutionary Algorithm with Distance Measure for the Split Delivery Capacitated Arc Routing Problem
• Branch-and-price-and-cut for the split-delivery vehicle routing problem with time windows
• Computerized scheduling of seagoing tankers
• Coordination of production and distribution planning
• scientific article; zbMATH DE number 591242 (Why is no real title available?)
• scientific article; zbMATH DE number 279304 (Why is no real title available?)
• Improved lower bounds for the split delivery vehicle routing problem
• Inventory routing
• Real-time split-delivery pickup and delivery time window problems with transfers
• Routing helicopters for crew exchanges on off-shore locations
• Savings by Split Delivery Routing
• Scatter search for a real-life heterogeneous fleet vehicle routing problem with time windows and split deliveries in Brazil
• Ship routing and scheduling with flexible cargo sizes
• Split delivery routing
• Split-delivery routeing heuristics in livestock feed distribution
• Stochastic vehicle routing with modified savings algorithm
• Synchronized development of production, inventory, and distribution schedules
• The split delivery vehicle routing problem: A survey
• The split delivery vehicle routing problem: Applications, algorithms, test problems, and computational results
• The split delivery vehicle scheduling problem with time windows and grid network distances
• Vehicle routing with split deliveries

Cited in

(77)

• Vehicle routing with split deliveries
• Integer optimization with penalized fractional values: the knapsack case
• The flexible periodic vehicle routing problem
• A parallel variable neighborhood search for the vehicle routing problem with divisible deliveries and pickups
• Heuristic algorithm for the split-demand one-commodity pickup-and-delivery travelling salesman problem
• A distance function for computing on finite subsets of Euclidean spaces
• New exact solution approaches for the split delivery vehicle routing problem
• A hierarchical solution approach for a multicommodity distribution problem under a special cost structure
• A tabu search algorithm for the vehicle routing problem with discrete split deliveries and pickups
• A tabu search heuristic for the vehicle routing problem with time windows and split deliveries
• 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
• Multi-compartment vehicle routing problems: state-of-the-art, modeling framework and future directions
• Approximation issues of fractional knapsack with penalties: a note
• A concise guide to existing and emerging vehicle routing problem variants
• A matheuristic approach for the split delivery vehicle routing problem: an efficient set covering-based model with guided route generation schemes
• A column generation-based heuristic for the split delivery vehicle routing problem with time windows
• A branch-and-cut algorithm for the split-demand one-commodity pickup-and-delivery travelling salesman problem
• The split delivery vehicle routing problem with three-dimensional loading constraints
• A mathematical programming model for integrating production and procurement transport decisions
• Adaptive large neighborhood search for the commodity constrained split delivery VRP
• Heuristics for multi-attribute vehicle routing problems: a survey and synthesis
• The bin packing problem with item fragmentation: a worst-case analysis
• A survey on matheuristics for routing problems
• An exact approach for the green vehicle routing problem with two-dimensional loading constraints and split delivery
• The heterogeneous flexible periodic vehicle routing problem: mathematical formulations and solution algorithms
• Resilient route design for collection of material from suppliers with split deliveries and stochastic demands
• The split delivery capacitated team orienteering problem
• An approach for efficient ship routing
• Achieving better solutions for vehicle routing problem involving split deliveries and pickups using a competitive decision algorithm
• A novel approach to solve the split delivery vehicle routing problem
• Branch-and-cut algorithms for the split delivery vehicle routing problem
• Rich vehicle routing problems: from a taxonomy to a definition
• Split delivery routing
• An ant colony system for responsive dynamic vehicle routing
• A hybrid heuristic approach for the multi-commodity pickup-and-delivery traveling salesman problem
• Mathematical programming algorithms for bin packing problems with item fragmentation
• An iterated local search heuristic for the split delivery vehicle routing problem
• A decomposition-based heuristic for the multiple-product inventory-routing problem
• Testing local search move operators on the vehicle routing problem with split deliveries and time windows
• A parallel clustering technique for the vehicle routing problem with split deliveries and pickups
• The min-max split delivery multi-depot vehicle routing problem with minimum service time requirement
• The split delivery vehicle routing problem: A survey
• Special issue on vehicle routing and scheduling: recent trends and advances
• A worst-case analysis for the split delivery vehicle routing problem with minimum delivery amounts
• A min-max vehicle routing problem with split delivery and heterogeneous demand
• Savings by Split Delivery Routing
• scientific article; zbMATH DE number 591242 (Why is no real title available?)
• A SPLIT DELIVERY VEHICLE ROUTING PROBLEM
• Incomplete service and split deliveries in a routing problem with profits
• Particle swarm optimization for split delivery vehicle routing problem
• A randomized granular tabu search heuristic for the split delivery vehicle routing problem
• A hybrid algorithm for the drilling rig routing problem
• An overview on the split delivery vehicle routing problem
• A column generation approach for the split delivery vehicle routing problem
• Thirty years of International Transactions in Operational Research: past, present, and future direction
• Systematic reviews as a metaknowledge tool: caveats and a review of available options
• An evolutionary algorithm for the multi‐objective pick‐up and delivery pollution‐routing problem
• Exact and hyper‐heuristic solutions for the distribution‐installation problem from the VeRoLog 2019 challenge
• The Vehicle Routing Problem with Stochastic Demands and Split Deliveries
• A memetic algorithm for solving rich waste collection problems
• The inventory routing problem with split deliveries
• A parallel greedy approach enhanced by genetic algorithm for the stochastic rig routing problem
• Systematic review of the latest scientific publications on the vehicle routing problem
• Nested column generation for split pickup vehicle routing problem with time windows and time-dependent demand
• A variable neighborhood search for the green vehicle routing problem with two-dimensional loading constraints and split delivery
• Exact methods for the split delivery vehicle routing problem with two-dimensional loading constraints
• The latency location routing problem with split deliveries: mathematical formulation and metaheuristic algorithm
• Pitfalls, benefits, and comparative analysis of artificial intelligence ChatBots in the systematic review process
• Solving a real case of rich vehicle routing problem with zone-dependent transportation costs
• Matheuristic algorithms for the inventory routing problem with unsplit and split deliveries
• Beyond fifty years of vehicle routing: insights into the history and the future
• Large neighborhood-based metaheuristic and branch-and-price for the pickup and delivery problem with split loads
• The bi-objective Dial-a-Tour problem
• Shipper collaboration in forward and reverse logistics
• A ring-based diversification scheme for routing problems
• An adaptive memory algorithm for the split delivery vehicle routing problem

This page was built for publication: Vehicle routing problems with split deliveries

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4918250)