A Lagrangean relaxation heuristic for vehicle routing

https://doi.org/10.1016/0377-2217(84)90050-XGet rights and content

Abstract

This paper presents a new heuristic algorithm for the vehicle routing problem (VRP) which makes use of Lagrangean relaxation to transform the VRP into a modified m-traveling salesman problem. Application of the proposed algorithm to test problems from the literature has produced new best-known solutions.

References (13)

  • B.E. Gillett et al.

    Mult-terminal vehicle-dispatch algorithm

    Omega

    (1976)
  • N. Christofides et al.

    An algorithm for the vehicle dispatching problem

    Operational. Res. Quart.

    (1969)
  • N. Christofides et al.

    Exact algorithms for the vehicle routing problem, based on spanning tree and shortest path relaxations

    Math. Programming

    (1981)
  • G. Clarke et al.

    Scheduling of vehicles from a central depot to a number of delivery points

    Operations Res.

    (1964)
  • G. Croes

    A method for solving traveling salesman problems

    Operations Res.

    (1958)
  • F. Cullen et al.

    Set partitioning based heuristics for interactive routing

    Networks

    (1981)
There are more references available in the full text version of this article.

Cited by (0)

View full text