A simple and efficient tabu search heuristic for solving the open vehicle routing problem
From MaRDI portal
Publication:4933651
DOI10.1057/jors.2008.107zbMath1196.90022OpenAlexW2060469568MaRDI QIDQ4933651
No author found.
Publication date: 14 October 2010
Published in: Journal of the Operational Research Society (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1057/jors.2008.107
Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59)
Related Items (13)
An effective tabu search approach with improved loading algorithms for the 3L-CVRP ⋮ Models and hybrid methods for the onshore wells maintenance problem ⋮ Tabu search heuristics for the order batching problem in manual order picking systems ⋮ The open vehicle routing problem with decoupling points ⋮ Competitiveness based on logistic management: a real case study ⋮ Vehicle routing with compartments: applications, modelling and heuristics ⋮ Decision support for flexible liner shipping ⋮ An ILP improvement procedure for the open vehicle routing problem ⋮ OAR lib: an open source arc routing library ⋮ Fuel treatment planning: fragmenting high fuel load areas while maintaining availability and connectivity of faunal habitat ⋮ An open vehicle routing problem metaheuristic for examining wide solution neighborhoods ⋮ Memory and Learning in Metaheuristics ⋮ Collaborative vehicle-drone distribution network optimization for perishable products in the epidemic situation
This page was built for publication: A simple and efficient tabu search heuristic for solving the open vehicle routing problem
