A tabu search algorithm for the open vehicle routing problem

DOI10.1016/S0377-2217(03)00238-8zbMath1068.90026OpenAlexW1963972489MaRDI QIDQ703907

José Brandão

Publication date: 12 January 2005

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0377-2217(03)00238-8

zbMATH Keywords

Tabu searchHamiltonian pathVehicle routingOpen vehicle routing

Mathematics Subject Classification ID

Search theory (90B40) Traffic problems in operations research (90B20)

Related Items

A new multi-objective competitive open vehicle routing problem solved by particle swarm optimization, A stochastic vehicle routing problem with travel time uncertainty: trade-off between cost and customer service, Rich vehicle routing problems: from a taxonomy to a definition, A deterministic tabu search algorithm for the fleet size and mix vehicle routing problem, A variable neighbourhood search algorithm for the open vehicle routing problem, A simulated annealing heuristic for the open location-routing problem, A general heuristic for vehicle routing problems, The open vehicle routing problem: algorithms, large-scale test problems, and computational results, A memory-based iterated local search algorithm for the multi-depot open vehicle routing problem, The close-open mixed vehicle routing problem, The open vehicle routing problem with decoupling points, A general VNS for the multi-depot open vehicle routing problem with time windows, A threshold accepting approach to the Open Vehicle Routing problem, A hybrid genetic algorithm for the multi-depot open vehicle routing problem, Integrating multi-product production and distribution in newspaper logistics, Multiobjective mathematical models and solution approaches for heterogeneous fixed fleet vehicle routing problems, New exact solution approaches for the split delivery vehicle routing problem, A new tabu search algorithm for the vehicle routing problem with backhauls, An ILP improvement procedure for the open vehicle routing problem, Multi-objective microzone-based vehicle routing for courier companies: from tactical to operational planning, An improved formulation for the multi-depot open vehicle routing problem, A hybrid evolution strategy for the open vehicle routing problem, An open vehicle routing problem metaheuristic for examining wide solution neighborhoods

Uses Software

• VRP

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The vehicle routing problem: An overview of exact and approximate algorithms
• A tabu search algorithm for the multi-trip vehicle routing and scheduling problem
• Probabilistic diversification and intensification in local search for vehicle routing
• Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem
• The Granular Tabu Search and Its Application to the Vehicle-Routing Problem
• A heuristic method for the open vehicle routing problem
• The multi-trip vehicle routing problem
• Exact algorithms for the vehicle routing problem, based on spanning tree and shortest path relaxations
• New Insertion and Postoptimization Procedures for the Traveling Salesman Problem
• Parallel iterative search methods for vehicle routing problems
• Optimal Solution of Vehicle Routing Problems Using Minimum K-Trees
• A Polynomial Algorithm for the Degree-Constrained Minimum K-Tree Problem
• A Network Flow-Based Tabu Search Heuristic for the Vehicle Routing Problem
• A Tabu Search Heuristic for the Vehicle Routing Problem
• Comparing descent heuristics and metaheuristics for the vehicle routing problem