國立虎尾科技大學 |

Evolutionary and Memetic Computing for Project Portfolio Selection and Scheduling

紀錄類型:	書目-語言資料,印刷品 : Monograph/item
正題名/作者:	Evolutionary and Memetic Computing for Project Portfolio Selection and Scheduling/ edited by Kyle Robert Harrison, Saber Elsayed, Ivan Leonidovich Garanovich, Terence Weir, Sharon G. Boswell, Ruhul Amin Sarker.
其他作者:	Harrison, Kyle Robert.
面頁冊數:	VIII, 214 p. 52 illus., 24 illus. in color.online resource. :
Contained By:	Springer Nature eBook
標題:	Computational intelligence. -
電子資源:	https://doi.org/10.1007/978-3-030-88315-7
ISBN:	9783030883157

Evolutionary and Memetic Computing for Project Portfolio Selection and Scheduling
Evolutionary and Memetic Computing for Project Portfolio Selection and Scheduling[electronic resource] /edited by Kyle Robert Harrison, Saber Elsayed, Ivan Leonidovich Garanovich, Terence Weir, Sharon G. Boswell, Ruhul Amin Sarker. - 1st ed. 2022. - VIII, 214 p. 52 illus., 24 illus. in color.online resource. - Adaptation, Learning, and Optimization,261867-4542 ;. - Adaptation, Learning, and Optimization,18.

Evolutionary and Memetic Computing for Project Portfolio Selection and Scheduling: An Introduction -- Evolutionary Approaches for Project Portfolio Optimization: An Overview -- An Introduction to Evolutionary and Memetic Algorithms for Parameter Optimization -- An Overall Characterization of the Project Portfolio Optimization Problem and an Approach Based on Evolutionary Algorithms to Address It -- A New Model for the Project Portfolio Selection and Scheduling Problem with Defence Capability Options -- Analysis of New Approaches used in Portfolio Optimization: A Systematic Literature Review -- A Temporal Knapsack Approach to Defence Portfolio Selection -- A Decision Support System for Planning Portfolios of Supply Chain Improvement Projects in the Semiconductor Industry.

This book consists of eight chapters, authored by distinguished researchers and practitioners, that highlight the state of the art and recent trends in addressing the project portfolio selection and scheduling problem (PPSSP) across a variety of domains, particularly defense, social programs, supply chains, and finance. Many organizations face the challenge of selecting and scheduling a subset of available projects subject to various resource and operational constraints. In the simplest scenario, the primary objective for an organization is to maximize the value added through funding and implementing a portfolio of projects, subject to the available budget. However, there are other major difficulties that are often associated with this problem such as qualitative project benefits, multiple conflicting objectives, complex project interdependencies, workforce and manufacturing constraints, and deep uncertainty regarding project costs, benefits, and completion times. It is well known that the PPSSP is an NP-hard problem and, thus, there is no known polynomial-time algorithm for this problem. Despite the complexity associated with solving the PPSSP, many traditional approaches to this problem make use of exact solvers. While exact solvers provide definitive optimal solutions, they quickly become prohibitively expensive in terms of computation time when the problem size is increased. In contrast, evolutionary and memetic computing afford the capability for autonomous heuristic approaches and expert knowledge to be combined and thereby provide an efficient means for high-quality approximation solutions to be attained. As such, these approaches can provide near real-time decision support information for portfolio design that can be used to augment and improve existing human-centric strategic decision-making processes. This edited book provides the reader with a broad overview of the PPSSP, its associated challenges, and approaches to addressing the problem using evolutionary and memetic computing.

ISBN: 9783030883157

Standard No.: 10.1007/978-3-030-88315-7doiSubjects--Topical Terms:

568984
Computational intelligence.

LC Class. No.: Q342

Dewey Class. No.: 006.3

Evolutionary and Memetic Computing for Project Portfolio Selection and Scheduling
LDR:04395nam a22004095i 4500 001 1090683
003 DE-He213
005 20220114074702.0
007 cr nn 008mamaa
008 221228s2022 sz | s |||| 0|eng d
020 $a 9783030883157 $9 978-3-030-88315-7
024 7 $a 10.1007/978-3-030-88315-7 $2 doi
035 $a 978-3-030-88315-7
050 4 $a Q342
072 7 $a UYQ $2 bicssc
072 7 $a TEC009000 $2 bisacsh
072 7 $a UYQ $2 thema
082 0 4 $a 006.3 $2 23
245 1 0 $a Evolutionary and Memetic Computing for Project Portfolio Selection and Scheduling $h [electronic resource] / $c edited by Kyle Robert Harrison, Saber Elsayed, Ivan Leonidovich Garanovich, Terence Weir, Sharon G. Boswell, Ruhul Amin Sarker.
250 $a 1st ed. 2022.
264 1 $a Cham : $b Springer International Publishing : $b Imprint: Springer, $c 2022.
300 $a VIII, 214 p. 52 illus., 24 illus. in color. $b online resource.
336 $a text $b txt $2 rdacontent
337 $a computer $b c $2 rdamedia
338 $a online resource $b cr $2 rdacarrier
347 $a text file $b PDF $2 rda
490 1 $a Adaptation, Learning, and Optimization, $x 1867-4542 ; $v 26
505 0 $a Evolutionary and Memetic Computing for Project Portfolio Selection and Scheduling: An Introduction -- Evolutionary Approaches for Project Portfolio Optimization: An Overview -- An Introduction to Evolutionary and Memetic Algorithms for Parameter Optimization -- An Overall Characterization of the Project Portfolio Optimization Problem and an Approach Based on Evolutionary Algorithms to Address It -- A New Model for the Project Portfolio Selection and Scheduling Problem with Defence Capability Options -- Analysis of New Approaches used in Portfolio Optimization: A Systematic Literature Review -- A Temporal Knapsack Approach to Defence Portfolio Selection -- A Decision Support System for Planning Portfolios of Supply Chain Improvement Projects in the Semiconductor Industry.
520 $a This book consists of eight chapters, authored by distinguished researchers and practitioners, that highlight the state of the art and recent trends in addressing the project portfolio selection and scheduling problem (PPSSP) across a variety of domains, particularly defense, social programs, supply chains, and finance. Many organizations face the challenge of selecting and scheduling a subset of available projects subject to various resource and operational constraints. In the simplest scenario, the primary objective for an organization is to maximize the value added through funding and implementing a portfolio of projects, subject to the available budget. However, there are other major difficulties that are often associated with this problem such as qualitative project benefits, multiple conflicting objectives, complex project interdependencies, workforce and manufacturing constraints, and deep uncertainty regarding project costs, benefits, and completion times. It is well known that the PPSSP is an NP-hard problem and, thus, there is no known polynomial-time algorithm for this problem. Despite the complexity associated with solving the PPSSP, many traditional approaches to this problem make use of exact solvers. While exact solvers provide definitive optimal solutions, they quickly become prohibitively expensive in terms of computation time when the problem size is increased. In contrast, evolutionary and memetic computing afford the capability for autonomous heuristic approaches and expert knowledge to be combined and thereby provide an efficient means for high-quality approximation solutions to be attained. As such, these approaches can provide near real-time decision support information for portfolio design that can be used to augment and improve existing human-centric strategic decision-making processes. This edited book provides the reader with a broad overview of the PPSSP, its associated challenges, and approaches to addressing the problem using evolutionary and memetic computing.
650 0 $a Computational intelligence. $3 568984
650 0 $a Artificial intelligence. $3 559380
650 1 4 $a Computational Intelligence. $3 768837
650 2 4 $a Artificial Intelligence. $3 646849
700 1 $a Harrison, Kyle Robert. $e editor. $1 https://orcid.org/0000-0002-1443-3005 $4 edt $4 http://id.loc.gov/vocabulary/relators/edt $3 1398148
700 1 $a Elsayed, Saber. $4 edt $4 http://id.loc.gov/vocabulary/relators/edt $3 1248779
700 1 $a Garanovich, Ivan Leonidovich. $e editor. $1 https://orcid.org/0000-0001-6676-6584 $4 edt $4 http://id.loc.gov/vocabulary/relators/edt $3 1398149
700 1 $a Weir, Terence. $e editor. $4 edt $4 http://id.loc.gov/vocabulary/relators/edt $3 1398150
700 1 $a Boswell, Sharon G. $e editor. $4 edt $4 http://id.loc.gov/vocabulary/relators/edt $3 1398151
700 1 $a Sarker, Ruhul Amin. $e editor. $4 edt $4 http://id.loc.gov/vocabulary/relators/edt $3 1398152
710 2 $a SpringerLink (Online service) $3 593884
773 0 $t Springer Nature eBook
776 0 8 $i Printed edition: $z 9783030883140
776 0 8 $i Printed edition: $z 9783030883164
776 0 8 $i Printed edition: $z 9783030883171
830 0 $a Adaptation, Learning, and Optimization, $x 1867-4534 ; $v 18 $3 1261891
856 4 0 $u https://doi.org/10.1007/978-3-030-88315-7
912 $a ZDB-2-INR
912 $a ZDB-2-SXIT
950 $a Intelligent Technologies and Robotics (SpringerNature-42732)
950 $a Intelligent Technologies and Robotics (R0) (SpringerNature-43728)