TLHSA and SACA: two heuristic algorithms for two variant VRP models
From MaRDI portal
Publication:2084658
Recommendations
- Solving Dynamic Vehicle Routing Problem with Soft Time Window by iLNS and hPSO
- Dynamic vehicle routing with time windows in theory and practice
- Dynamic vehicle routing using an improved variable neighborhood search algorithm
- Dynamic vehicle routing problems with enhanced ant colony optimization
- A general heuristic for vehicle routing problems
Cites work
- A New Optimization Algorithm for the Vehicle Routing Problem with Time Windows
- A hybrid algorithm for the vehicle routing problem with pickup and delivery and three-dimensional loading constraints
- A review of dynamic vehicle routing problems
- Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
- An ILP-based local search procedure for the VRP with pickups and deliveries
- An improved LNS algorithm for real-time vehicle routing problem with time windows
- Ant colony system for a dynamic vehicle routing problem
- Dynamic pickup and delivery problems
- Dynamic vehicle routing using genetic algorithms
- Dynamic vehicle routing with time windows in theory and practice
- Fresh seafood delivery routing problem using an improved ant colony optimization
- Parallel Tabu Search for Real-Time Vehicle Routing and Dispatching
- Static pickup and delivery problems: a classification scheme and survey. (With comments and rejoinder)
- Waiting and Buffering Strategies for the Dynamic Pickup and Delivery Problem with Time Windows
Cited in
(3)
This page was built for publication: TLHSA and SACA: two heuristic algorithms for two variant VRP models
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2084658)