A Branch and Cut method for the Capacitated Location-Routing Problem

Author

Belenguer, Jose-Manuel ; Benavent, Enrique ; Prins, Christian ; Prodhon, Caroline ; Wolfler-Calvo, Roberto

Author_Institution

Dept. d´´Estadistica i Investigacio Operativa, Valencia Univ.

Volume

2

fYear

2006

Firstpage

1541

Lastpage

1546

Abstract

Most of the time in a distribution system, depot location and vehicle routing are interdependent and recent researches have shown that the overall system cost may be excessive if routing decisions are ignored when locating depots. The location routing problem (LRP) overcomes this drawback by simultaneously tackling location and routing decisions. This paper presents two formulations of the location-routing problem with capacities on routes and depots and proposes an exact method based on a branch and cut approach using these formulations. The method is evaluated on two sets of randomly generated instances, and compared to heuristics and another lower bound

Keywords

facility location; linear programming; transportation; branch and cut method; capacitated location-routing problem; linear programming; vehicle routing problem; Costs; Fitting; Iterative algorithms; Lagrangian functions; Logistics; Routing; Simulated annealing; Stochastic processes; Testing; Vehicles; Branch and Cut; Location-Routing; Lower Bound;

fLanguage

English

Publisher

ieee

Conference_Titel

Service Systems and Service Management, 2006 International Conference on

Conference_Location

Troyes

Print_ISBN

1-4244-0450-9

Electronic_ISBN

1-4244-0451-7

Type

conf

DOI

10.1109/ICSSSM.2006.320765

Filename

4114720