Capacitated depot location for the vehicle routing problem

  • Mingozzi A
  • Prins C
  • Calvo R
  • 5


    Mendeley users who have this article in their library.
  • 0


    Citations of this article.


In this working paper we consider the problem of opening one or more depots on a given set of a priori defined depot locations and to design for each opened depot a number of routes in order to supply a given set of customers. With each location is associated a fixed cost for opening a depot and a depot-capacity that limits the quantity that can be delivered to customers. All vehicles are identical. Each route must start and finish at the same depot. The route cost is equal to the distance traveled. The objective is to minimize the sum of the fixed costs of the opened depots and of the costs of the routes operated by the depots. We describe a lower bound and the framework of an exact method that is based on a set partitioning (SP) like formulation of the problem that is a generalization of the SP formulation of the capacitated vehicle routing problem and of the multi-depot capacitated vehicle routing problem

Author-supplied keywords

  • Additive bounding
  • Columns generation
  • Location routing

Get free article suggestions today

Mendeley saves you time finding and organizing research

Sign up here
Already have an account ?Sign in

Find this document

Get full text


  • Aristide Mingozzi

  • Christian Prins

  • Roberto Wolfler Calvo

Cite this document

Choose a citation style from the tabs below

Save time finding and organizing research with Mendeley

Sign up for free