Exact and heuristic algorithms for the uncapacitated multiple allocation p-hub median problem

Exact and heuristic algorithms for the uncapacitated multiple allocation p-hub median problem

0.00 Avg rating0 Votes
Article ID: iaor19992208
Country: Netherlands
Volume: 104
Issue: 1
Start Page Number: 100
End Page Number: 112
Publication Date: Jan 1998
Journal: European Journal of Operational Research
Authors: ,
Keywords: programming: linear, programming: integer
Abstract:

In this paper new mixed integer linear programming formulations for the multiple allocation p-hub median problem are presented. These require fewer variables and constraints than those traditionally used in the literature. An efficient heuristic algorithm, based on shortest paths, is described. Linear programming based solution methods as well as an explicit enumeration algorithm are developed to obtain exact solutions. Computational results are presented for well known problems from the literature which show that exact solutions can be found in a reasonable amount of computational time. Our algorithms are also benchmarked on a different data set. This data set, which includes problems that are larger than those used in the literature, is based on a postal delivery network and has been treated by the authors in an earlier paper.

Reviews

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