The scientific and industrial communities are often unaware of the work of each other. We aim to provide a service where you can find all the information you require, for a specicific specialisation, all on the same web site. We would welcome suggestions for other areas.
We are currently preparing this page to outline some of the common (and not so common) models that are used to represent Vehicle Routing Problems.
The surveys page would also be a good place to look if you are looking for a particular model, or just general information about the models that are available.
If you believe that any are missing, please let us know (email: firstname.lastname@example.org)
This model, for the Capacitated Vehicle Routing Problem, is one of the moset general models. It is based on set-partitioning and the general idea is to minimise the cost, which is represented by cj. The cost could be, for example, the distance. We have a fixed number of customers (V> and also a fixed number of vehicles (K. Note that we are not trying to minimise the number of vehicles used, which is the case in some other formulations.
The model can be formally stated as follows.
We hope you find these pages useful and we welcome your feedback. If you have any comments, please email us at email@example.com.
If you would like to be informed when changes are made to these pages please join our mailing list.