A hybrid algorithm of local search for the heterogeneous fixed fleet vehicle routing problem

DOI10.1134/S1990478915040079zbMath1349.90443MaRDI QIDQ3186841

A. Khmelev, Yury A. Kochetov

Publication date: 12 August 2016

Published in: Journal of Applied and Industrial Mathematics (Search for Journal in Brave)

zbMATH Keywords

Lagrangian relaxationlocal searchsubgradient optimizationexponential neighborhood

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Stochastic scheduling theory in operations research (90B36)

Related Items (4)

Integrating territory design and routing problems ⋮ MineReduce: an approach based on data mining for problem size reduction ⋮ Hybrid data mining heuristics for the heterogeneous fleet vehicle routing problem ⋮ A branch and cut heuristic for a runway scheduling problem

Cites Work

• Unnamed Item
• Fast metaheuristics for the discrete \((r|p)\)-centroid problem
• Efficient frameworks for greedy split and new depth first search split procedures for routing problems
• A tabu search algorithm for the heterogeneous fixed fleet vehicle routing problem
• A record-to-record travel algorithm for solving the heterogeneous fleet vehicle routing problem
• Methods for routing with time windows
• 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 hybrid algorithm for the heterogeneous fleet vehicle routing problem
• A deterministic tabu search algorithm for the fleet size and mix vehicle routing problem
• A unified exact method for solving different classes of vehicle routing problems
• A unified solution framework for multi-attribute vehicle routing problems
• Routing a Heterogeneous Fleet of Vehicles
• A guided tabu search for the heterogeneous vehicle routeing problem
• A heuristic column generation method for the heterogeneous fleet VRP
• A list based threshold accepting metaheuristic for the heterogeneous fixed fleet vehicle routing problem
• The variable neighborhood search for the two machine flow shop problem with a passive prefetch
• Local search with an exponential neighborhood for the servers load balancing problem

This page was built for publication: A hybrid algorithm of local search for the heterogeneous fixed fleet vehicle routing problem