Heuristic approaches for a vehicle routing problem with an incompatible loading constraint and splitting deliveries by order
From MaRDI portal
Publication:2669495
DOI10.1016/j.cor.2021.105379OpenAlexW3167079049MaRDI QIDQ2669495
Weilai Huang, Fang Guo, Zhi-hong Huang
Publication date: 9 March 2022
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2021.105379
routinghybrid heuristic algorithmincompatibility among ordersinconvenience of order receiptssplit deliveries by order
Related Items
Modelling and heuristically solving many-to-many heterogeneous vehicle routing problem with cross-docking and two-dimensional loading constraints ⋮ Mathematical models for a ship routing problem with a small number of ports on a route
Cites Work
- The multi-vehicle traveling purchaser problem with pairwise incompatibility constraints and unitary demands: a branch-and-price approach
- An adaptive large neighborhood search for the two-echelon multiple-trip vehicle routing problem with satellite synchronization
- An iterated local search heuristic for the split delivery vehicle routing problem
- Battery swap station location-routing problem with capacitated electric vehicles
- Testing local search move operators on the vehicle routing problem with split deliveries and time windows
- A hybrid method for the probabilistic maximal covering location-allocation problem
- An adaptive large neighborhood search heuristic for two-echelon vehicle routing problems arising in city logistics
- A branch-price-and-cut algorithm for the commodity constrained split delivery vehicle routing problem
- Large neighborhood-based metaheuristic and branch-and-price for the pickup and delivery problem with split loads
- A general heuristic for vehicle routing problems
- The vehicle routing problem. Latest advances and new challenges.
- The electric two-echelon vehicle routing problem
- Enhanced branch-cut-and-price algorithm for heterogeneous fleet vehicle routing problems
- Vehicle routing with probabilistic capacity constraints
- Product-oriented time window assignment for a multi-compartment vehicle routing problem
- Heuristics for vehicle routing problems with backhauls, time windows, and 3D loading constraints
- A simultaneous facility location and vehicle routing problem arising in health care logistics in the Netherlands
- The inventory-routing problem with transshipment
- An adaptive large neighborhood search heuristic for the cumulative capacitated vehicle routing problem
- A tabu search algorithm for the vehicle routing problem with discrete split deliveries and pickups
- A branch-and-price algorithm for a vehicle routing with demand 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
- The fuel replenishment problem: a split-delivery multi-compartment vehicle routing problem with multiple trips
- The two-echelon vehicle routing problem with covering options: city logistics with cargo bikes and parcel lockers
- A multi-compartment vehicle routing problem in cold-chain distribution
- The vehicle routing problem with simultaneous pickup and delivery and handling costs
- Solving the vehicle routing problem with multi-compartment vehicles for city logistics
- Adaptive large neighborhood search for the commodity constrained split delivery VRP
- Stabilized branch-price-and-cut for the commodity-constrained split delivery vehicle routing problem
- Guest editorial to the special issue ``Routing and logistics (VeRoLog 2012)
- A simulation-based heuristic for the electric vehicle routing problem with time windows and stochastic waiting times at recharging stations
- Savings by Split Delivery Routing
- Parallel iterative search methods for vehicle routing problems
- A Heuristic Algorithm for the Vehicle-Dispatch Problem
