A novel two-phase heuristic method for vehicle routing problem with backhauls

DOI10.1016/j.camwa.2008.10.045zbMath1186.90021OpenAlexW1980753494MaRDI QIDQ971756

Zhengguo Wang, Zhiwu Wang

Publication date: 16 May 2010

Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.camwa.2008.10.045

zbMATH Keywords

heuristictime dependentbackhaulsreactive tabu search

Mathematics Subject Classification ID

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

Related Items

Vehicle routing with backhauls: review and research perspectives ⋮ A distance function for computing on finite subsets of Euclidean spaces

Uses Software

• VRP

Cites Work

• VRP
• A memetic algorithm for a vehicle routing problem with backhauls
• Arc routing problems with time-dependent service costs
• Self-organizing feature maps for the vehicle routing problem with backhauls
• A heuristic algorithm for the symmetric and asymmetric vehicle routing problems with backhauls
• A reactive tabu search meta-heuristic for the vehicle routing problem with back-hauls
• Vehicle dispatching with time-dependent travel times
• A reactive tabu search for the vehicle routing problem
• Modelling Intra-City Time-Dependent Travel Speeds for Vehicle Scheduling Problems
• Time Dependent Vehicle Routing Problems: Formulations, Properties and Heuristic Algorithms
• The Reactive Tabu Search
• On-Line Vehicle Routing and Scheduling With Time-Varying Travel Speeds