An interactive procedure dedicated to a bicriteria plant location model

Authors:
Joana Dias;M. Eugénia;João Clímaco
Affiliations:
Faculdade de Economia and INESC, Universidade de Coimbra, Av. Dias da Silva, 3000 Coimbra, Portugal;DEIO and CIO, Faculdade de Ciências da Universidade de Lisboa, Campo Grande, Bloco C2, Piso 2, 1749-016, Lisboa, Portugal;Faculdade de Economia and INESC, Universidade de Coimbra, Av. Dias da Silva, 3000 Coimbra, Portugal
Venue:
Computers and Operations Research
Year:
2003

Citing 2
Cited 2

Generating the noninferior set in mixed integer biobjective linear programs: an application to a location problem

Computers and Operations Research
Network flows: theory, algorithms, and applications

Network flows: theory, algorithms, and applications

A GIS embedded decision support system for bicriteria location problems

Proceedings of the 2010 conference on Bridging the Socio-technical Gap in Decision Support Systems: Challenges for the Next Decade
A DSS for bicriteria location problems

Decision Support Systems

Quantified Score

Hi-index	0.01

Visualization

Abstract

In this paper a new algorithm is described which aims at solving efficiently a simple plant location problem with two additional constraints. Such a problem arises in the calculation phase of an interactive decision aid process that helps the decision-maker finding the non-dominated solutions for a bicriteria simple plant location problem. The two additional constraints impose upper limits on the values of each objective function. If they are relaxed, the problem turns into a simple plant location problem, which can be solved using Dualoc by Erlenkotter (oper. Res. 26(6) (1978) 992). The algorithm developed uses a slightly modified version of-Dualoc (Erlenkotter, 1978) integrated into a branch and bound procedure. The results of several computational experiments are shown, showing that the new algorithm is superior both in the computational time and memory needed, when compared with a general solver.