Vehicle routing with split deliveries
From MaRDI portal
Publication:1327209
DOI10.1016/0166-218X(92)00172-IzbMath0801.90082MaRDI QIDQ1327209
Pierre Trudeau, Moshe Dror, Gilbert Laporte
Publication date: 15 June 1994
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
branch-and-bound algorithmvehicle routingrelaxationsubtour elimination constraintssplit deliveryconnectivity constraintsfractional cycle elimination constraints
Programming involving graphs or networks (90C35) Integer programming (90C10) Abstract computational complexity for mathematical programming problems (90C60) Linear programming (90C05) Transportation, logistics and supply chain management (90B06)
Related Items
A tabu search heuristic for the vehicle routing problem with time windows and split deliveries, 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, A branch and cut algorithm for the hierarchical network design problem, An ant colony system for responsive dynamic vehicle routing, An iterated local search heuristic for the split delivery vehicle routing problem, A branch-price-and-cut method for a ship routing and scheduling problem with split loads, Routing problems: A bibliography, Multiobjective location routing problem considering uncertain data after disasters, The vehicle routing problem with demand range, Simultaneously exploiting two formulations: an exact Benders decomposition approach, An exact approach for the green vehicle routing problem with two-dimensional loading constraints and split delivery, Integer linear programming models for a cement delivery problem, A branch-and-cut embedded matheuristic for the inventory routing problem, An integral LP relaxation for a drayage problem, Solving the integrated bin allocation and collection routing problem for municipal solid waste: a benders decomposition approach, The Maritime Pickup and Delivery Problem with Time Windows and Split Loads, The Vehicle Routing Problem with Stochastic Demands and Split Deliveries, 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, A SCATTER SEARCH FOR MULTI-DEPOT VEHICLE ROUTING PROBLEM WITH WEIGHT-RELATED COST, The Split Delivery Vehicle Routing Problem: A Survey, A column generation approach for the split delivery vehicle routing problem, Vehicle routing problems with split deliveries, A tabu search heuristic for ship routing and scheduling with flexible cargo quantities, 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 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, The split delivery vehicle routing problem with three-dimensional loading constraints, Optimisation enhancement using self‐organising fuzzy control, The Fixed-Charge Shortest-Path Problem, 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
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A branch and bound algorithm for the capacitated vehicle routing problem
- Heuristics for unequal weight delivery problems with a fixed error guarantee
- The vehicle routing problem: An overview of exact and approximate algorithms
- Split delivery routing
- Technical Note—Heuristics for Delivery Problems with Constant Error Guarantees
- Optimal Routing under Capacity and Distance Restrictions
- Generalized Subtour Elimination Constraints and Connectivity Constraints
- Savings by Split Delivery Routing
- Solution of a Large-Scale Traveling-Salesman Problem
