Minisum collection depots location problem with multiple facilities on a network

Minisum collection depots location problem with multiple facilities on a network

0.00 Avg rating0 Votes
Article ID: iaor20051250
Country: United Kingdom
Volume: 55
Issue: 7
Start Page Number: 769
End Page Number: 779
Publication Date: Jul 2004
Journal: Journal of the Operational Research Society
Authors: ,
Keywords: facilities, networks
Abstract:

We investigate the problem of locating a set of service facilities that need to service customers on a network. To provide service, a server has to visit both the demand node and one of several collection depots. We employ the criterion of minimizing the weighted sum of round trip distances. We prove that there exists a dominating location set for the problem on a general network. The properties of the solution on a tree and on a cycle are discussed. The problem of locating service facilities and collection depots simultaneously is also studied. To solve the problem on a general network, we suggest a Lagrangian relaxation imbedded branch-and-bound algorithm. Computational results are reported.

Reviews

Required fields are marked *. Your email address will not be published.