Adaptive multi-restart tabu search algorithm for the vehicle routing problem with cross-docking
From MaRDI portal
Publication:376002
DOI10.1007/S11590-012-0558-5zbMATH Open1280.90015OpenAlexW2022969949MaRDI QIDQ376002FDOQ376002
Authors: Christos D. Tarantilis
Publication date: 1 November 2013
Published in: Optimization Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11590-012-0558-5
Recommendations
- Adaptive neighborhood simulated annealing for the heterogeneous fleet vehicle routing problem with multiple cross-docks
- A modified variable neighborhood search hybridized with genetic algorithm for vehicle routing problems with cross-docking
- Vehicle routing with cross-dock selection
- Vehicle routing problem of multi-distribution centers with cross-docking in the supply chain
- Vehicle routing with cross-docking
Approximation methods and heuristics in mathematical programming (90C59) Transportation, logistics and supply chain management (90B06)
Cites Work
- BoneRoute: An adaptive memory-based method for effective fleet management
- A hybrid evolution strategy for the open vehicle routing problem
- Vehicle routing with cross-docking
- Multiple crossdocks with inventory and time windows
- Integrated service network design for a cross-docking supply chain network
- Transshipment service through crossdocks with both soft and hard time windows
- A hybrid guided local search for the vehicle-routing problem with intermediate replenishment facilities
- Solving the vehicle routing problem with adaptive memory programming methodology
- Path relinking for the vehicle routing problem
Cited In (10)
- Synchronization in cross-docking networks: a research classification and framework
- A matheuristic based on large neighborhood search for the vehicle routing problem with cross-docking
- Vehicle routing with cross-dock selection
- A robust approach to multiple vehicle location-routing problems with time windows for optimization of cross-docking under uncertainty
- Direct \(k\)-routing versus cross-docking: worst-case results
- Moving products between location pairs: cross-docking versus direct-shipping
- Adaptive memory artificial bee colony algorithm for Green vehicle routing with cross-docking
- Adaptive neighborhood simulated annealing for the heterogeneous fleet vehicle routing problem with multiple cross-docks
- Integrating dock-door assignment and vehicle routing with cross-docking
- Just-in-time logistics for far-distant suppliers: scheduling truck departures from an intermediate cross-docking terminal
Uses Software
This page was built for publication: Adaptive multi-restart tabu search algorithm for the vehicle routing problem with cross-docking
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q376002)