Location Routing Problems on Simple Graphs

@inproceedings{Aroz2015LocationRP,
  title={Location Routing Problems on Simple Graphs},
  author={Juli{\'a}n Ar{\'a}oz and Elena Fern{\'a}ndez and Salvador Rueda},
  year={2015}
}
This paper addresses combined location/routing problems defined on trees. Several problems are studied, which consider service demand both at the vertices and the edges of the input tree. Greedy type optimal heuristics are presented for the cases when all vertices have to be visited and facilities have no set-up costs. Facilities set-up costs can also be handled with interchange heuristics of low order. More general problems where not all vertices have to be necessarily visited require more… CONTINUE READING
Highly Cited
This paper has 50 citations. REVIEW CITATIONS

From This Paper

Figures, tables, and topics from this paper.

Citations

Publications citing this paper.
Showing 1-10 of 32 extracted citations

51 Citations

051015'14'16'18
Citations per Year
Semantic Scholar estimates that this publication has 51 citations based on the available data.

See our FAQ for additional information.

References

Publications referenced by this paper.
Showing 1-10 of 16 references

Location-routing and location–arc routing

M. Albareda-Sambola
Location Science. G. Laporte, S. Nickel and F. Saldanha da Gama(eds), Springer, • 2015
View 1 Excerpt

A survey of recent research on location-routing problems

European Journal of Operational Research • 2014
View 1 Excerpt

Location-routing: Issues, models and methods

European Journal of Operational Research • 2007
View 1 Excerpt

A compact model and tight bounds for a combined location-routing problem

M. Albareda-Sambola, J. A. Dı́az, E. Fernández
Computers & Operations Research, • 2005
View 1 Excerpt

Similar Papers

Loading similar papers…