TLHSA and SACA: two heuristic algorithms for two variant VRP models
From MaRDI portal
Publication:2084658
DOI10.1007/s10878-021-00831-0zbMath1504.90115OpenAlexW3211984739MaRDI QIDQ2084658
Hejiao Huang, Songhu Guo, Xuhong Cai, Li Jiang, Hongwei David Du
Publication date: 18 October 2022
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10878-021-00831-0
Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Cites Work
- A hybrid algorithm for the vehicle routing problem with pickup and delivery and three-dimensional loading constraints
- Dynamic pickup and delivery problems
- An ILP-based local search procedure for the VRP with pickups and deliveries
- Fresh seafood delivery routing problem using an improved ant colony optimization
- An improved LNS algorithm for real-time vehicle routing problem with time windows
- A review of dynamic vehicle routing problems
- Dynamic vehicle routing with time windows in theory and practice
- Dynamic vehicle routing using genetic algorithms
- Ant colony system for a dynamic vehicle routing problem
- Static pickup and delivery problems: a classification scheme and survey. (With comments and rejoinder)
- Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
- A New Optimization Algorithm for the Vehicle Routing Problem with Time Windows
- Parallel Tabu Search for Real-Time Vehicle Routing and Dispatching
- Waiting and Buffering Strategies for the Dynamic Pickup and Delivery Problem with Time Windows