A new tabu search heuristic for the open vehicle routing problem
From MaRDI portal
Publication:4680748
DOI10.1057/palgrave.jors.2601817zbMath1114.90003OpenAlexW2056299576MaRDI QIDQ4680748
Leon Li, Zhuo Fu, Richard W. Eglese
Publication date: 7 June 2005
Published in: Journal of the Operational Research Society (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1057/palgrave.jors.2601817
Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59) Traffic problems in operations research (90B20)
Related Items (16)
A new multi-objective competitive open vehicle routing problem solved by particle swarm optimization ⋮ A multi-start algorithm for a balanced real-world open vehicle routing problem ⋮ Rich vehicle routing problems: from a taxonomy to a definition ⋮ A variable neighbourhood search algorithm for the open vehicle routing problem ⋮ A simulated annealing heuristic for the open location-routing problem ⋮ The open vehicle routing problem: algorithms, large-scale test problems, and computational results ⋮ The open vehicle routing problem with decoupling points ⋮ Appointment scheduling and routing optimization of attended home delivery system with random customer behavior ⋮ A hybrid genetic algorithm for the multi-depot open vehicle routing problem ⋮ Integrating multi-product production and distribution in newspaper logistics ⋮ New exact solution approaches for the split delivery vehicle routing problem ⋮ The school bus routing and scheduling problem with transfers ⋮ An ILP improvement procedure for the open vehicle routing problem ⋮ A hybrid evolution strategy for the open vehicle routing problem ⋮ The school bus routing problem: a review ⋮ An open vehicle routing problem metaheuristic for examining wide solution neighborhoods
This page was built for publication: A new tabu search heuristic for the open vehicle routing problem
