Approaches and mathematical models for robust solutions to optimization problems with stochastic problem data instances

Niraj Ramesh Dayama; Ketki Kulkarni

doi:10.1007/978-3-642-35926-2_9

Approaches and mathematical models for robust solutions to optimization problems with stochastic problem data instances

Niraj Ramesh Dayama^*, Ketki Kulkarni

^*Motsvarande författare för detta arbete

HUMLOG - The Humanitarian Logistics and Supply Chain Research Institute, Helsingfors

Indian Institute of Technology Bombay

Forskningsoutput: Kapitel i bok/rapport/konferenshandling › Konferensbidrag › Vetenskaplig › Peer review

Sammanfattning

Practical applications of scheduling, routing and other generic constrained optimization problems often involve an uncertainty in the values of the data presented in the problem data instances. On the contrary, most of the established algorithms for typical classes of well-studied problems in the field of constrained optimization assume that deterministic precise values of data would be known. Hence, any solution developed for a specific optimization problem with a given problem data instance would become non-optimal and/or infeasible when applied to another data instance with even slight perturbation. We argue the fallacy of using solutions developed based on the mean values of data for real life problems having stochastic data.

Originalspråk	Engelska
Titel på värdpublikation	Combinatorial Algorithms : 23rd International Workshop, IWOCA 2012, Krishnankoil, India, July 19-21, 2012, Revised Selected Papers
Redaktörer	S. Arumugam, W.F. Smyth
Antal sidor	5
Förlag	Springer
Utgivningsdatum	2012
Sidor	76-80
ISBN (tryckt)	978-3-642-35925-5
DOI	https://doi.org/10.1007/978-3-642-35926-2_9
Status	Publicerad - 2012
MoE-publikationstyp	A4 Artikel i en konferenspublikation
Evenemang	23rd International Workshop on Combinatorial Algorithms, IWOCA 2012 - Tamil Nadu, Indien Varaktighet: 19.07.2012 → 21.07.2012

Publikationsserier

Namn	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volym	7643 LNCS
ISSN (tryckt)	0302-9743
ISSN (elektroniskt)	1611-3349

Nyckelord

113 Data- och informationsvetenskap

Åtkomst av dokument

10.1007/978-3-642-35926-2_9

OpenUrl-tillgänglighet

Fulltext

Andra filer och länkar

Link to publication in Scopus

Citera det här

Dayama, N. R., & Kulkarni, K. (2012). Approaches and mathematical models for robust solutions to optimization problems with stochastic problem data instances. I S. Arumugam, & W. F. Smyth (Red.), Combinatorial Algorithms: 23rd International Workshop, IWOCA 2012, Krishnankoil, India, July 19-21, 2012, Revised Selected Papers (s. 76-80). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 7643 LNCS). Springer. https://doi.org/10.1007/978-3-642-35926-2_9

Dayama, Niraj Ramesh ; Kulkarni, Ketki. / Approaches and mathematical models for robust solutions to optimization problems with stochastic problem data instances. Combinatorial Algorithms: 23rd International Workshop, IWOCA 2012, Krishnankoil, India, July 19-21, 2012, Revised Selected Papers. redaktör / S. Arumugam ; W.F. Smyth. Springer, 2012. s. 76-80 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{db03bbbd3dd549d68dcbd20a0ab6ec31,

title = "Approaches and mathematical models for robust solutions to optimization problems with stochastic problem data instances",

abstract = "Practical applications of scheduling, routing and other generic constrained optimization problems often involve an uncertainty in the values of the data presented in the problem data instances. On the contrary, most of the established algorithms for typical classes of well-studied problems in the field of constrained optimization assume that deterministic precise values of data would be known. Hence, any solution developed for a specific optimization problem with a given problem data instance would become non-optimal and/or infeasible when applied to another data instance with even slight perturbation. We argue the fallacy of using solutions developed based on the mean values of data for real life problems having stochastic data.",

keywords = "113 Computer and information sciences",

author = "Dayama, {Niraj Ramesh} and Ketki Kulkarni",

year = "2012",

doi = "10.1007/978-3-642-35926-2_9",

language = "English",

isbn = "978-3-642-35925-5",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer",

pages = "76--80",

editor = "S. Arumugam and W.F. Smyth",

booktitle = "Combinatorial Algorithms",

address = "International",

note = "23rd International Workshop on Combinatorial Algorithms, IWOCA 2012 ; Conference date: 19-07-2012 Through 21-07-2012",

}

Dayama, NR & Kulkarni, K 2012, Approaches and mathematical models for robust solutions to optimization problems with stochastic problem data instances. i S Arumugam & WF Smyth (red), Combinatorial Algorithms: 23rd International Workshop, IWOCA 2012, Krishnankoil, India, July 19-21, 2012, Revised Selected Papers. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 7643 LNCS, Springer, s. 76-80, 23rd International Workshop on Combinatorial Algorithms, IWOCA 2012, Tamil Nadu, Indien, 19.07.2012. https://doi.org/10.1007/978-3-642-35926-2_9

Approaches and mathematical models for robust solutions to optimization problems with stochastic problem data instances. / Dayama, Niraj Ramesh; Kulkarni, Ketki.
Combinatorial Algorithms: 23rd International Workshop, IWOCA 2012, Krishnankoil, India, July 19-21, 2012, Revised Selected Papers. red. / S. Arumugam; W.F. Smyth. Springer, 2012. s. 76-80 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 7643 LNCS).

Forskningsoutput: Kapitel i bok/rapport/konferenshandling › Konferensbidrag › Vetenskaplig › Peer review

TY - GEN

T1 - Approaches and mathematical models for robust solutions to optimization problems with stochastic problem data instances

AU - Dayama, Niraj Ramesh

AU - Kulkarni, Ketki

PY - 2012

Y1 - 2012

N2 - Practical applications of scheduling, routing and other generic constrained optimization problems often involve an uncertainty in the values of the data presented in the problem data instances. On the contrary, most of the established algorithms for typical classes of well-studied problems in the field of constrained optimization assume that deterministic precise values of data would be known. Hence, any solution developed for a specific optimization problem with a given problem data instance would become non-optimal and/or infeasible when applied to another data instance with even slight perturbation. We argue the fallacy of using solutions developed based on the mean values of data for real life problems having stochastic data.

AB - Practical applications of scheduling, routing and other generic constrained optimization problems often involve an uncertainty in the values of the data presented in the problem data instances. On the contrary, most of the established algorithms for typical classes of well-studied problems in the field of constrained optimization assume that deterministic precise values of data would be known. Hence, any solution developed for a specific optimization problem with a given problem data instance would become non-optimal and/or infeasible when applied to another data instance with even slight perturbation. We argue the fallacy of using solutions developed based on the mean values of data for real life problems having stochastic data.

KW - 113 Computer and information sciences

UR - http://www.scopus.com/inward/record.url?scp=84871667173&partnerID=8YFLogxK

U2 - 10.1007/978-3-642-35926-2_9

DO - 10.1007/978-3-642-35926-2_9

M3 - Conference contribution

AN - SCOPUS:84871667173

SN - 978-3-642-35925-5

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 76

EP - 80

BT - Combinatorial Algorithms

A2 - Arumugam, S.

A2 - Smyth, W.F.

PB - Springer

T2 - 23rd International Workshop on Combinatorial Algorithms, IWOCA 2012

Y2 - 19 July 2012 through 21 July 2012

ER -

Dayama NR, Kulkarni K. Approaches and mathematical models for robust solutions to optimization problems with stochastic problem data instances. I Arumugam S, Smyth WF, redaktörer, Combinatorial Algorithms: 23rd International Workshop, IWOCA 2012, Krishnankoil, India, July 19-21, 2012, Revised Selected Papers. Springer. 2012. s. 76-80. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/978-3-642-35926-2_9

Approaches and mathematical models for robust solutions to optimization problems with stochastic problem data instances

Sammanfattning

Publikationsserier

Nyckelord

Åtkomst av dokument

OpenUrl-tillgänglighet

Andra filer och länkar

Fingeravtryck

Citera det här