Please use this identifier to cite or link to this item:
https://hdl.handle.net/10316/44383
Title: | Bicriteria path problem minimizing the cost and minimizing the number of labels | Authors: | Pascoal, Marta Captivo, M. Eugénia Clímaco, João Laranjeira, Ana |
Issue Date: | 2013 | Publisher: | Springer | Serial title, monograph or event: | 4OR | Volume: | 11 | Issue: | 3 | Abstract: | We address a bicriterion path problem where each arc is assigned with a cost value and a label (such as a color). The first criterion intends to minimize the total cost of the path (the summation of its arc costs), while the second intends to get the solution with a minimal number of different labels. Since these criteria, in general, are conflicting criteria we develop an algorithm to generate the set of non-dominated paths. Computational experiments are presented and results are discussed. | URI: | https://hdl.handle.net/10316/44383 | DOI: | 10.1007/s10288-013-0229-0 10.1007/s10288-013-0229-0 |
Rights: | embargoedAccess |
Appears in Collections: | FCTUC Matemática - Artigos em Revistas Internacionais |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
2013PascoalEtAl.pdf | 199.7 kB | Adobe PDF | View/Open |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.