Optimization Online


Location Routing Problems on Simple Graphs

Julian Araoz (julian.araoz***at***upc.edu)
Elena Fernandez (e.fernandez***at***upc.edu)
Salvador Rueda (e.fernandez***at***upc.edu)

Abstract: 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 sophisticated solution methods. Low order optimal algorithms based on recursions are proposed for such problems.

Keywords: Location, Routing, Trees

Category 1: Combinatorial Optimization


Download: [PDF]

Entry Submitted: 09/29/2015
Entry Accepted: 09/29/2015
Entry Last Modified: 07/28/2017

Modify/Update this entry

  Visitors Authors More about us Links
  Subscribe, Unsubscribe
Digest Archive
Search, Browse the Repository


Coordinator's Board
Classification Scheme
Give us feedback
Optimization Journals, Sites, Societies
Mathematical Optimization Society