An interactive GRAMPS algorithm for the heterogeneous fixed fleet vehicle routing problem with and without backhauls

DOI10.1016/j.ejor.2009.03.044zbMath1180.90027MaRDI QIDQ1037690

G. Yazgı Tütüncü

Publication date: 16 November 2009

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

Full work available at URL: https://doi.org/10.1016/j.ejor.2009.03.044

zbMATH Keywords

metaheuristics; routing; backhauls; heterogeneous fixed fleet; GRAMPS

Mathematics Subject Classification ID

90B06: Transportation, logistics and supply chain management

90C59: Approximation methods and heuristics in mathematical programming

Uses Software

• VRP

Cites Work

• Greedy random adaptive memory programming search for the capacitated clustering problem
• A heuristic method for the vehicle routing problem with mixed deliveries and pickups
• The fleet size and mix vehicle routing problem
• A heuristic algorithm for the symmetric and asymmetric vehicle routing problems with backhauls
• A tabu search heuristic for the heterogeneous fleet vehicle routing problem
• A threshold accepting metaheuristic for the heterogeneous fixed fleet vehicle routing problem.
• Efficient heuristics for the heterogeneous fleet multitrip VRP with application to a large-scale real case
• A visual interactive approach to vehicle routing
• Further Inprovements to Vehicle Routeing Heuristics
• Parallel iterative search methods for vehicle routing problems
• Improved Constructive Multistart Strategies for the Quadratic Assignment Problem Using Adaptive Memory
• A list based threshold accepting metaheuristic for the heterogeneous fixed fleet vehicle routing problem