Extrapolating from limited uncertain information in large-scale combinatorial optimization problems to obtain robust solutions
dc.contributor.author | Climent, Laura | |
dc.contributor.author | Wallace, Richard J. | |
dc.contributor.author | O'Sullivan, Barry | |
dc.contributor.author | Freuder, Eugene C. | |
dc.contributor.funder | Science Foundation Ireland | en |
dc.date.accessioned | 2021-04-27T10:39:38Z | |
dc.date.available | 2021-04-27T10:39:38Z | |
dc.date.issued | 2016-02 | |
dc.date.updated | 2021-04-27T10:30:59Z | |
dc.description | This paper is an extended version of L. Climent et al. in Proceedings of ICTAI-2014. International Journal On Artificial Intelligence Tools, 25 (1) Special Issue on 26th IEEE International Conference on Tools with Artificial Intelligence (ICTAI-2014); Guest Editor: George Angelos Papadopoulos | |
dc.description.abstract | Data uncertainty in real-life problems is a current challenge in many areas, including Operations Research (OR) and Constraint Programming (CP). This is especially true given the continual and accelerating increase in the amount of data associated with real life problems, to which Large Scale Combinatorial Optimization (LSCO) techniques may be applied. Although data uncertainty has been studied extensively in the literature, many approaches do not take into account the partial or complete lack of information about uncertainty in real-life settings. To meet this challenge, in this paper we present a strategy for extrapolating data from limited uncertain information to ensure a certain level of robustness in the solutions obtained. Our approach is motivated and evaluated with real-world applications of harvesting and supplying timber from forests to mills and the well known knapsack problem with uncertainty. | en |
dc.description.status | Peer reviewed | en |
dc.description.version | Accepted Version | en |
dc.format.mimetype | application/pdf | en |
dc.identifier.citation | Climent, L., Wallace, R. J., O'Sullivan, B. and Freuder, E. C. (2016) 'Extrapolating from Limited Uncertain Information in Large-Scale Combinatorial Optimization Problems to Obtain Robust Solutions', International Journal On Artificial Intelligence Tools, 25 (01), doi: 10.1142/S0218213016600058 | en |
dc.identifier.doi | 10.1142/S0218213016600058 | en |
dc.identifier.eissn | 1793-6349 | |
dc.identifier.endpage | 20 | en |
dc.identifier.issn | 0218-2130 | |
dc.identifier.issued | 01 | en |
dc.identifier.journaltitle | International Journal On Artificial Intelligence Tools | en |
dc.identifier.startpage | 1 | en |
dc.identifier.uri | https://hdl.handle.net/10468/11224 | |
dc.identifier.volume | 25 | en |
dc.language.iso | en | en |
dc.publisher | World Scientific Publishing | en |
dc.relation.ispartof | 2014 IEEE 26th International Conference on Tools with Artificial Intelligence (ICTAI) Nov. 10 2014 to Nov. 12 2014, Limassol, Cyprus | en |
dc.relation.project | info:eu-repo/grantAgreement/SFI/SFI Research Centres/12/RC/2289/IE/INSIGHT - Irelands Big Data and Analytics Research Centre/ | en |
dc.relation.uri | https://www.worldscientific.com/doi/pdf/10.1142/S0218213016600058 | |
dc.rights | © 2016 World Scientific Publishing Company. This is the accepted version of an article published in International Journal on Artificial Intelligence Tools Vol. 25, No. 01, https://www.worldscientific.com/doi/pdf/10.1142/S0218213016600058 | en |
dc.subject | Uncertainty | en |
dc.subject | Robustness | en |
dc.subject | Optimization | en |
dc.title | Extrapolating from limited uncertain information in large-scale combinatorial optimization problems to obtain robust solutions | en |
dc.type | Article (peer-reviewed) | en |