A robust approach to multiple vehicle location-routing problems with time windows for optimization of cross-docking under uncertainty
DOI10.3233/JIFS-151050zbMath1366.90131OpenAlexW2571715347MaRDI QIDQ5275867
Behnam Vahdani, S. Meysam Mousavi
Publication date: 14 July 2017
Published in: Journal of Intelligent & Fuzzy Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3233/jifs-151050
robust optimizationlocationmeta-heuristic algorithmsvehicle routing schedulingmixed-integer linear programming modelcross-docking planning
Mixed integer programming (90C11) Linear programming (90C05) Deterministic scheduling theory in operations research (90B35) Discrete location and assignment (90B80)
Related Items (2)
Cites Work
- Unnamed Item
- Synchronization in cross-docking networks: a research classification and framework
- Adaptive multi-restart tabu search algorithm for the vehicle routing problem with cross-docking
- Selected topics in robust convex optimization
- Robust solutions of linear programming problems contaminated with uncertain data
- A simulated annealing methodology to distribution network design and management
- Multiple crossdocks with inventory and time windows
- Robust Convex Optimization
- An exact algorithm for a cross-docking supply chain network design problem
- Robust Solutions to Uncertain Semidefinite Programs
- Integrated service network design for a cross-docking supply chain network
- Crossdocking—JIT scheduling with time windows
- Vehicle routing with cross-docking
- Introduction to Genetic Algorithms
- Technical Note—Convex Programming with Set-Inclusive Constraints and Applications to Inexact Linear Programming
This page was built for publication: A robust approach to multiple vehicle location-routing problems with time windows for optimization of cross-docking under uncertainty