Metaheuristic algorithms for combinatorial optimization problems. (Abstract of thesis)
From MaRDI portal
Publication:816435
DOI10.1007/s10288-005-0052-3zbMath1134.90300OpenAlexW1963661129MaRDI QIDQ816435
Publication date: 9 March 2006
Published in: 4OR (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10288-005-0052-3
Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Computational methods for problems pertaining to operations research and mathematical programming (90-08)
Related Items
A hybrid genetic algorithm for the vehicle routing problem with three-dimensional loading constraints, A guided tabu search for the vehicle routing problem with two-dimensional loading constraints, A hybrid approach for the vehicle routing problem with three-dimensional loading constraints, An effective tabu search approach with improved loading algorithms for the 3L-CVRP, Routing problems with loading constraints, Heuristic and exact algorithms for the multi-pile vehicle routing problem, Ant colony optimization for the two-dimensional loading vehicle routing problem, Using biased randomization for solving the two-dimensional loading vehicle routing problem with heterogeneous fleet, A biased‐randomized algorithm for the two‐dimensional vehicle routing problem with and without item rotations
