Vehicle routing problems with split deliveries
From MaRDI portal
Publication:4918250
DOI10.1111/j.1475-3995.2011.00811.xzbMath1267.90030MaRDI QIDQ4918250
Claudia 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
Related Items
Particle Swarm Optimization for Split Delivery Vehicle Routing Problem, A hybrid algorithm for the drilling rig 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, A memetic algorithm for solving rich waste collection problems, Branch-and-cut algorithms for the split delivery vehicle routing problem, Rich vehicle routing problems: from a taxonomy to a definition, 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, Special issue on vehicle routing and scheduling: recent trends and advances, A randomized granular tabu search heuristic for the split delivery vehicle routing problem, Large neighborhood-based metaheuristic and branch-and-price for the pickup and delivery problem with split loads, Shipper collaboration in forward and reverse logistics, 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 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 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, An approach for efficient ship routing, A novel approach to solve the split delivery vehicle routing problem
Cites Work
- Unnamed Item
- Unnamed Item
- A new capacitated vehicle routing problem with split service for minimizing fleet cost by simulated annealing
- A worst-case analysis for the split delivery vehicle routing problem with minimum delivery amounts
- A tabu search with vocabulary building approach for the vehicle routing problem with Split demands
- A dynamic logistics coordination model for evacuation and support in disaster response activities
- Real-time split-delivery pickup and delivery time window problems with transfers
- An adaptive memory algorithm for the split delivery vehicle routing problem
- Improved lower bounds for the split delivery vehicle routing problem
- A tabu search heuristic for the split delivery vehicle routing problem with production and demand calendars
- 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
- Stochastic vehicle routing with modified savings algorithm
- Vehicle routing with split deliveries
- Coordination of production and distribution planning
- Routing helicopters for crew exchanges on off-shore locations
- A tabu search heuristic for the vehicle routing problem with time windows and split deliveries
- The split delivery vehicle scheduling problem with time windows and grid network distances
- A new model and hybrid approach for large scale inventory routing problems
- Synchronized Development of Production, Inventory, and Distribution Schedules
- Split delivery routing
- A two-stage vehicle routing model for large-scale bioterrorism emergencies
- Branch-and-Price-and-Cut for the Split-Delivery Vehicle Routing Problem with Time Windows
- A parallel clustering technique for the vehicle routing problem with split deliveries and pickups
- Inventory Routing
- The Split Delivery Vehicle Routing Problem: A Survey
- An Evolutionary Algorithm with Distance Measure for the Split Delivery Capacitated Arc Routing Problem
- Savings by Split Delivery Routing
- Computerized scheduling of seagoing tankers
- Split-delivery routeing heuristics in livestock feed distribution
- A Lower Bound for the Split Delivery Vehicle Routing Problem
- The split delivery vehicle routing problem: Applications, algorithms, test problems, and computational results
- AN ALGORITHM FOR THE GENERALIZED VEHICLE ROUTING PROBLEM WITH BACKHAULING
- A food distribution network problem: a case study
- Ship routing and scheduling with flexible cargo sizes
- A column generation approach for the split delivery vehicle routing problem
