Split delivery routing
From MaRDI portal
Publication:3035116
DOI10.1002/nav.3800370304zbMath0692.90044OpenAlexW1786863823MaRDI QIDQ3035116
Publication date: 1990
Published in: Naval Research Logistics (NRL) (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/nav.3800370304
Numerical mathematical programming methods (65K05) Applications of mathematical programming (90C90) Integer programming (90C10) Inventory, storage, reservoirs (90B05)
Related Items
Fleet design optimisation from historical data using constraint programming and large neighbourhood search, Vehicle routing with split deliveries, 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, Classification, models and exact algorithms for multi-compartment delivery problems, An extension of the relaxation algorithm for solving a special case of capacitated arc routing problems, 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, 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, The min-max split delivery multi-depot vehicle routing problem with minimum service time requirement, Routing problems: A bibliography, A dynamic logistics coordination model for evacuation and support in disaster response activities, The vehicle routing problem with demand range, Simultaneously exploiting two formulations: an exact Benders decomposition approach, 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, A branch-and-cut embedded matheuristic for the inventory routing problem, 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, The inventory routing problem with split deliveries, A novel approach to solve the split delivery vehicle routing problem, A heuristic algorithm for finding cost-effective solutions to real-world school bus routing problems, Planning for a bus-based evacuation, A hybrid heuristic for a broad class of vehicle routing problems with heterogeneous fleet, 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, 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, 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, Large scale stochastic inventory routing problems with~split delivery and service level constraints, 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 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, The pickup and delivery problem with split loads and transshipments: a branch-and-cut solution approach, A route decomposition approach for the single commodity split pickup and split delivery vehicle routing problem, The split delivery vehicle routing problem with three-dimensional loading 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, Adaptive large neighborhood search for the commodity constrained split delivery VRP
Cites Work
- Stochastic vehicle routing with modified savings algorithm
- Heuristics for unequal weight delivery problems with a fixed error guarantee
- A vehicle routing improvement algorithm comparison of a greedy and a matching implementation for inventory routing
- An exact algorithm for the asymmetrical capacitated vehicle routing problem
- Exact algorithms for the vehicle routing problem, based on spanning tree and shortest path relaxations
