Heuristic approaches for a vehicle routing problem with an incompatible loading constraint and splitting deliveries by order
From MaRDI portal
Publication:2669495
Recommendations
- An iterated local search heuristic for the split delivery vehicle routing problem
- A heuristic method for the vehicle routing problem with mixed deliveries and pickups
- A min-max vehicle routing problem with split delivery and heterogeneous demand
- Heuristic algorithms for the vehicle routing problem with simultaneous pick-up and delivery
- 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 routing problem with three-dimensional loading constraints
- A novel approach to solve the split delivery vehicle routing problem
- A tabu search heuristic for the split delivery vehicle routing problem with production and demand calendars
- The split heterogeneous vehicle routing problem with three-dimensional loading constraints on a large scale
Cites work
- A branch-and-price algorithm for a vehicle routing with demand allocation problem
- A branch-price-and-cut algorithm for the commodity constrained split delivery vehicle routing problem
- A general heuristic for vehicle routing problems
- A Heuristic Algorithm for the Vehicle-Dispatch Problem
- A hybrid method for the probabilistic maximal covering location-allocation problem
- A large neighborhood search for the pickup and delivery problem with time windows, split loads and transshipments
- A memory-based iterated local search algorithm for the multi-depot open vehicle routing problem
- A multi-compartment vehicle routing problem in cold-chain distribution
- A simulation-based heuristic for the electric vehicle routing problem with time windows and stochastic waiting times at recharging stations
- A simultaneous facility location and vehicle routing problem arising in health care logistics in the Netherlands
- A tabu search algorithm for the vehicle routing problem with discrete split deliveries and pickups
- Adaptive large neighborhood search for the commodity constrained split delivery VRP
- An adaptive large neighborhood search for the two-echelon multiple-trip vehicle routing problem with satellite synchronization
- An adaptive large neighborhood search heuristic for the cumulative capacitated vehicle routing problem
- An adaptive large neighborhood search heuristic for two-echelon vehicle routing problems arising in city logistics
- An iterated local search heuristic for the split delivery vehicle routing problem
- Battery swap station location-routing problem with capacitated electric vehicles
- Enhanced branch-cut-and-price algorithm for heterogeneous fleet vehicle routing problems
- Guest editorial to the special issue ``Routing and logistics (VeRoLog 2012)
- Heuristics for vehicle routing problems with backhauls, time windows, and 3D loading constraints
- Large neighborhood-based metaheuristic and branch-and-price for the pickup and delivery problem with split loads
- Parallel iterative search methods for vehicle routing problems
- Product-oriented time window assignment for a multi-compartment vehicle routing problem
- Savings by Split Delivery Routing
- Solving the vehicle routing problem with multi-compartment vehicles for city logistics
- Stabilized branch-price-and-cut for the commodity-constrained split delivery vehicle routing problem
- Testing local search move operators on the vehicle routing problem with split deliveries and time windows
- The electric two-echelon vehicle routing problem
- The fuel replenishment problem: a split-delivery multi-compartment vehicle routing problem with multiple trips
- The inventory-routing problem with transshipment
- The multi-vehicle traveling purchaser problem with pairwise incompatibility constraints and unitary demands: a branch-and-price approach
- The two-echelon vehicle routing problem with covering options: city logistics with cargo bikes and parcel lockers
- The vehicle routing problem with simultaneous pickup and delivery and handling costs
- The vehicle routing problem. Latest advances and new challenges.
- Vehicle routing with probabilistic capacity constraints
Cited in
(11)- A tabu search heuristic for the split delivery vehicle routing problem with production and demand calendars
- Mathematical models for a ship routing problem with a small number of ports on a route
- Using intermediate infeasible solutions to approach vehicle routing problems with precedence and loading constraints
- Optimizing two-dimensional vehicle loading and dispatching decisions in freight logistics
- The split delivery vehicle routing problem with time windows and three-dimensional loading constraints
- Heterogeneous instant delivery orders scheduling and routing problem
- Modelling and heuristically solving many-to-many heterogeneous vehicle routing problem with cross-docking and two-dimensional loading constraints
- Collaborative optimization of routing and storage strategy of multi-period multimodal transport in an uncertain environment
- A heuristic with a performance guarantee for the commodity constrained split delivery vehicle routing problem
- Learning-based column generation approach for the vehicle routing problem with release dates and incompatible loading constraints
- An exact branch-price-and-cut algorithm for the time-dependent cold chain pickup and delivery problem with incompatibility constraints
This page was built for publication: Heuristic approaches for a vehicle routing problem with an incompatible loading constraint and splitting deliveries by order
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2669495)