A matheuristic based on large neighborhood search for the vehicle routing problem with cross-docking
From MaRDI portal
Publication:1652321
DOI10.1016/j.cor.2017.03.004zbMath1391.90061OpenAlexW2596054940MaRDI QIDQ1652321
Louis-Martin Rousseau, Philippe Grangier, Michel Gendreau, Fabien Lehuédé
Publication date: 11 July 2018
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2017.03.004
Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59)
Related Items
Vehicle dispatching for minimizing arrival conflicts in multi-supplier logistics network, An efficient matheuristic for the robust multiple allocation \(p\)-hub median problem under polyhedral demand uncertainty, A multi-modal competitive hub location pricing problem with customer loyalty and elastic demand, A multi-tiered vehicle routing problem with global cross-docking, An M/M/c queue model for vehicle routing problem in multi-door cross-docking environments, A hub-and-spoke architecture for a parcel delivery system using the cross-docking distribution strategy, Hybridizing adaptive large neighborhood search with kernel search: a new solution approach for the nurse routing problem with incompatible services and minimum demand, The rendezvous vehicle routing problem, The time‐consistent dial‐a‐ride problem, Adaptive large neighborhood search for the vehicle routing problem with synchronization constraints at the delivery location, An efficient environmentally friendly transportation network design via dry ports: a bi-level programming approach, A continuous‐time service network design and vehicle routing problem, Collaborative optimization of dock door assignment and vehicle scheduling in cross-docking, Integrated scheduling and assignment of trucks at unit-load cross-dock terminals with mixed service mode dock doors, The pickup and delivery problem with split loads and transshipments: a branch-and-cut solution approach, Meta-analysis of metaheuristics: quantifying the effect of adaptiveness in adaptive large neighborhood search, New decomposition methods for home care scheduling with predefined visits, A branch-and-cut-and-price algorithm for the multi-trip separate pickup and delivery problem with time windows at customers and facilities
Uses Software
Cites Work
- Unnamed Item
- Synchronization in cross-docking networks: a research classification and framework
- An adaptive large neighborhood search for the two-echelon multiple-trip vehicle routing problem with satellite synchronization
- A hybrid algorithm for a class of vehicle routing problems
- A survey on two-echelon routing problems
- Hybrid column generation and large neighborhood search for the dial-a-ride problem
- The pickup and delivery problem with cross-docking
- A parallel matheuristic for the technician routing and scheduling problem
- Adaptive multi-restart tabu search algorithm for the vehicle routing problem with cross-docking
- A general heuristic for vehicle routing problems
- The pickup and delivery problem with transfers: formulation and a branch-and-cut solution method
- An adaptive large neighborhood search for the full truckload pickup and delivery problem with resource synchronization
- Integrating dock-door assignment and vehicle routing with cross-docking
- Moving products between location pairs: cross-docking versus direct-shipping
- A GRASP with adaptive large neighborhood search for pickup and delivery problems with transshipment
- Probabilistic diversification and intensification in local search for vehicle routing
- A matheuristic for the truck and trailer routing problem
- Efficient feasibility testing for request insertion in the pickup and delivery problem with transfers
- A survey on matheuristics for routing problems
- A Branch-and-price algorithm for a Vehicle Routing Problem with Cross-Docking
- A Novel Column Generation Algorithm for the Vehicle Routing Problem with Cross-Docking
- Vehicle routing with cross-docking
