Bicriteria network location problems with criteria dependent lengths and minisum objectives

Bicriteria network location problems with criteria dependent lengths and minisum objectives

0.00 Avg rating0 Votes
Article ID: iaor20052051
Country: Netherlands
Volume: 156
Issue: 3
Start Page Number: 541
End Page Number: 549
Publication Date: Aug 2004
Journal: European Journal of Operational Research
Authors: , ,
Keywords: networks, programming: multiple criteria
Abstract:

We present a new location model, which is a generalization of the bicriteria median problem. We introduce two sum objectives and criteria dependent edge lengths. For this NP complete problem a solution method finding all the efficient solutions is presented. The method is a two-phases approach, which can easily be applied as an interactive method. In Phase 1 the supported solutions are found, and in Phase 2 the unsupported solutions are found. This method can be thought of as a general approach to bi-objective combinatorial optimization problems.

Reviews

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