A hybrid simulated annealing for capacitated vehicle routing problems with the independent route length
From MaRDI portal
Publication:2495966
DOI10.1016/j.amc.2005.09.040zbMath1149.90312MaRDI QIDQ2495966
Reza Tavakkoli-Moghaddam, Nima Safaei, Y. Gholipour
Publication date: 30 June 2006
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.amc.2005.09.040
90C10: Integer programming
90B06: Transportation, logistics and supply chain management
90C59: Approximation methods and heuristics in mathematical programming
90C27: Combinatorial optimization
Related Items
Experimental evaluation of simulated annealing algorithms for the time-cost trade-off problem, A memetic algorithm for a vehicle routing problem with backhauls, The museum visitor routing problem, Industrial aspects and literature survey: fleet composition and routing, An improved ant colony optimization for vehicle routing problem, Routing a Heterogeneous Fleet of Vehicles
Cites Work
- Unnamed Item
- Optimization by Simulated Annealing
- Threshold accepting: A general purpose optimization algorithm appearing superior to simulated annealing
- A tabu search heuristic for the heterogeneous fleet vehicle routing problem
- An adaptive memory heuristic for a class of vehicle routing problems with minmax objective
- A threshold accepting metaheuristic for the heterogeneous fixed fleet vehicle routing problem.
- Simulated annealing metaheuristics for the vehicle routing problem with time windows
- Solving real-life vehicle routing problems efficiently using tabu search
- Optimal Solution of Vehicle Routing Problems Using Minimum K-Trees
- A Backtracking Adaptive Threshold Accepting Algorithm for the Vehicle Routing Problem
- A heuristic column generation method for the heterogeneous fleet VRP
- A Tabu Search Heuristic for the Vehicle Routing Problem
- A Location Based Heuristic for General Routing Problems
