A Unified Modeling and Solution Framework for Vehicle Routing and Local Search-Based Metaheuristics
From MaRDI portal
Publication:2901011
DOI10.1287/ijoc.1070.0239zbMath1243.90225OpenAlexW2116141722MaRDI QIDQ2901011
Publication date: 28 July 2012
Published in: INFORMS Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/ijoc.1070.0239
Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59)
Related Items
A hybrid genetic algorithm with adaptive diversity management for a large class of vehicle routing problems with time-windows ⋮ A general variable neighborhood search for the one-commodity pickup-and-delivery travelling salesman problem ⋮ Coupling ant colony systems with strong local searches ⋮ How managerial perspectives affect the optimal fleet size and mix model: a multi-objective approach ⋮ A relax-and-repair heuristic for the swap-body vehicle routing problem ⋮ Inter-depot moves and dynamic-radius search for multi-depot vehicle routing problems ⋮ A general variable neighborhood search for the traveling salesman problem with time windows under various objectives ⋮ Vehicle Routing Problems with Inter-Tour Resource Constraints ⋮ New mixed integer-programming model for the pickup-and-delivery problem with transshipment ⋮ A parallelised large neighbourhood search heuristic for the asymmetric two-echelon vehicle routing problem with swap containers for cargo-bicycles ⋮ Multi-depot vehicle routing problem with time windows under shared depot resources ⋮ A 3/2-Approximation Algorithm for the Multiple TSP with a Fixed Number of Depots ⋮ A unified solution framework for multi-attribute vehicle routing problems ⋮ On the one-to-one pickup-and-delivery problem with time windows and trailers
