The bi-objective stochastic covering tour problem

Select |




Print


Tricoire, Fabien; Graf, Alexandra; Gutjahr, Walter

Tricoire, Fabien; Graf, Alexandra; Gutjahr, Walter


2011-09-17


Journal Article


Computers and Operations Research


39


7


1582-1592


We formulate a bi-objective covering tour model with stochastic demand where the two objectives are given by (i) cost (opening cost for distribution centers plus routing cost for a fleet of vehicles) and (ii) expected uncovered demand. In the model, it is assumed that depending on the distance, a certain percentage of clients go from their homes to the nearest distribution center. An application in humanitarian logistics is envisaged. For the computational solution of the resulting bi-objective two-stage stochastic program with recourse, a branch-and-cut technique, applied to a sample-average version of the problem obtained from a fixed random sample of demand vectors, is used within an epsilon-constraint algorithm. Computational results on real-world data for rural communities in Senegal show the viability of the approach.


Multi-objective optimization; Stochastic optimization; Branch-and-cut; Covering tour problem; Disaster relief


https://doi.org/10.1016/j.cor.2011.09.009


nicta:5363


Tricoire, Fabien; Graf, Alexandra; Gutjahr, Walter. The bi-objective stochastic covering tour problem. Computers and Operations Research. 2011-09-17; 39(7):1582-1592. https://doi.org/10.1016/j.cor.2011.09.009



Loading citation data...

Citation counts
(Requires subscription to view)