AN ASP-BASED MODEL EMPLOYING A TABU SEARCH METHOD FOR MAKING e-LOGISTICS DECISIONS
From MaRDI portal
Publication:5405793
DOI10.1080/01969720500320791zbMath1284.93034MaRDI QIDQ5405793
Publication date: 3 April 2014
Published in: Cybernetics and Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/01969720500320791
90B18: Communication networks in operations research
90B50: Management decision making, including multiple objectives
Related Items
Uses Software
Cites Work
- A note on two problems in connexion with graphs
- BoneRoute: An adaptive memory-based method for effective fleet management
- Probabilistic diversification and intensification in local search for vehicle routing
- A heuristic method for the open vehicle routing problem
- An Integer L-Shaped Algorithm for the Capacitated Vehicle Routing Problem with Stochastic Demands
- A Tabu Search Heuristic for the Vehicle Routing Problem with Soft Time Windows
- A Branch-and-Cut Procedure for the Vehicle Routing Problem with Time Windows
- A List Based Threshold Accepting Algorithm for the Capacitated Vehicle Routing Problem
- Partially dynamic vehicle routing—models and algorithms
- Tabu search variants for the mix fleet vehicle routing problem
- New assignment algorithms for the multi-depot vehicle routing problem
- A list based threshold accepting metaheuristic for the heterogeneous fixed fleet vehicle routing problem
- Node-ejection chains for the vehicle routing problem: Sequential and parallel algorithms
