A Metaheuristic for the Periodic Location-Routing Problem - Université de technologie de Troyes Access content directly
Conference Papers Year : 2007

A Metaheuristic for the Periodic Location-Routing Problem


The well-known Vehicle Routing Problem (VRP) has been generalized toward tactical or strategic decision levels of companies but not both. The tactical extension or Periodic VRP (PVRP) plans trips over a multi-period horizon, subject to frequency constraints. The strategic extension or Location-Routing Problem (LRP) tackles location and routing decisions simultaneously as in most distribution systems interdependence between these decisions leads to low-quality solutions if depots are located first, regardless the future routes. Our goal is to combine for the first time the PVRP and LRP into the Periodic LRP or PLRP. A metaheuristic is proposed to solve large size instances of the PLRP. It is based on our Randomized Extended Clarke and Wright Algorithm (RECWA) for the LRP and it tries to take into consideration several decision levels when making a choice during the construction of a solution. The method is evaluated on three sets of instances and results are promising. Solutions are compared to the literature on particular cases such as one-day horizon (LRP) or one available depot (PVRP).
No file

Dates and versions

hal-02891662 , version 1 (07-07-2020)



Caroline Prodhon. A Metaheuristic for the Periodic Location-Routing Problem. Annual International Conference of the German Operations Research Society (GOR) 2007, Sep 2007, Saarbrücken, Germany. pp.159-164, ⟨10.1007/978-3-540-77903-2_25⟩. ⟨hal-02891662⟩


11 View
0 Download



Gmail Mastodon Facebook X LinkedIn More