A heuristic method for the open vehicle routing problem

DOI10.1057/PALGRAVE.JORS.2600924MaRDI QIDQ3156577zbMATH OpenOpenAlexFDO

Authors

Publication date 10 January 2005

Published in The Journal of the Operational Research Society (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1057/palgrave.jors.2600924

zbMATH Keywords

distribution managementheuristicsopen vehicle routing problem

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• A new tabu search heuristic for the open vehicle routing problem
• The open vehicle routing problem: algorithms, large-scale test problems, and computational results
• A simple and efficient tabu search heuristic for solving the open vehicle routing problem
• A tabu search algorithm for the open vehicle routing problem
• A variable neighbourhood search algorithm for the open vehicle routing problem

Cited in

(33)

• A hybrid evolution strategy for the open vehicle routing problem
• An open vehicle routing problem metaheuristic for examining wide solution neighborhoods
• Combination of geographical information system and efficient routing algorithms for real life distribution operations.
• An open source spreadsheet solver for vehicle routing problems
• The open vehicle routing problem with decoupling points
• New exact solution approaches for the split delivery vehicle routing problem
• The close-open mixed vehicle routing problem
• Mathematical formulations and improvements for the multi-depot open vehicle routing problem
• The doubly open park-and-loop routing problem
• A memory-based iterated local search algorithm for the multi-depot open vehicle routing problem
• A web-based decision support system for waste lube oils collection and recycling
• A variable neighbourhood search algorithm for 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
• A new multi-objective competitive open vehicle routing problem solved by particle swarm optimization
• A simulated annealing heuristic for the open location-routing problem
• A new tabu search heuristic for the open vehicle routing problem
• A simple and efficient tabu search heuristic for solving the open vehicle routing problem
• AN ASP-BASED MODEL EMPLOYING A TABU SEARCH METHOD FOR MAKING e-LOGISTICS DECISIONS
• The open vehicle routing problem with time windows
• Solving the open vehicle routeing problem via a single parameter metaheuristic algorithm
• A threshold accepting approach to the Open Vehicle Routing problem
• An improved formulation for the multi-depot open vehicle routing problem
• A matheuristic for the MinMax capacitated open vehicle routing problem
• Approximating split delivery path routing problems
• A hybrid simulated annealing and variable neighborhood search algorithm for the close-open electric vehicle routing problem
• Convex-hull based two-phase algorithm to solve capacitated vehicle routing problem
• A tabu search algorithm for the open vehicle routing problem
• The service-centric vehicle routing problem with crowdshipping
• A generalized set partitioning model for MinMax vehicle routing
• A general heuristic for vehicle routing problems
• The open vehicle routing problem: algorithms, large-scale test problems, and computational results
• An ILP improvement procedure for the open vehicle routing problem

This page was built for publication: A heuristic method for the open vehicle routing problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3156577)