Vehicle routing with cross-dock selection

DOI10.1016/J.COR.2016.08.007zbMath1391.90073OpenAlexW2513863907MaRDI QIDQ1652043

Yousef Maknoon, Gilbert Laporte

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.2016.08.007

zbMATH Keywords

vehicle routingcross-dockingadaptive large neighborhood search (ALNS)

Mathematics Subject Classification ID

Mixed integer programming (90C11) Abstract computational complexity for mathematical programming problems (90C60) Transportation, logistics and supply chain management (90B06) Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27) Traffic problems in operations research (90B20)

Related Items (15)

Vehicle dispatching for minimizing arrival conflicts in multi-supplier logistics network ⋮ A comparison of formulations and relaxations for cross-dock door assignment problems ⋮ An adaptive large neighbourhood search for asset protection during escaped wildfires ⋮ Adaptive neighborhood simulated annealing for the heterogeneous fleet vehicle routing problem with multiple cross-docks ⋮ Network scheduling problem with cross-docking and loading constraints ⋮ 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 survey of adaptive large neighborhood search algorithms and applications ⋮ Delivery systems with crowd‐sourced drivers: A pickup and delivery problem with transfers ⋮ Cross-dock facility for disaster relief operations ⋮ Just-in-time logistics for far-distant suppliers: scheduling truck departures from an intermediate cross-docking terminal ⋮ The pickup and delivery problem with split loads and transshipments: a branch-and-cut solution approach ⋮ The vehicle routing and scheduling problem with cross-docking for perishable products under uncertainty: two robust bi-objective models ⋮ A branch-and-cut-and-price algorithm for the multi-trip separate pickup and delivery problem with time windows at customers and facilities ⋮ Integrating workload smoothing and inventory reduction in three intermodal logistics platforms of a European car manufacturer

Cites Work

• On the shortest spanning subtree of a graph and the traveling salesman 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
• A GRASP with adaptive large neighborhood search for pickup and delivery problems with transshipment
• New mixed integer-programming model for the pickup-and-delivery problem with transshipment
• Scheduling inbound and outbound trucks at cross docking terminals
• A parallel route building algorithm for the vehicle routing and scheduling problem with time windows
• A Branch-and-price algorithm for a Vehicle Routing Problem with Cross-Docking
• Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
• A Novel Column Generation Algorithm for the Vehicle Routing Problem with Cross-Docking
• Vehicle routing with cross-docking
• A Heuristic Algorithm for the Vehicle-Dispatch Problem
• The Pickup And Delivery Problem With Time Windows And Transshipment

This page was built for publication: Vehicle routing with cross-dock selection