IDEAS home Printed from https://ideas.repec.org/a/wly/syseng/v18y2015i1p45-58.html
   My bibliography  Save this article

Technology Portfolio Planning by Weighted Graph Analysis of System Architectures

Author

Listed:
  • Peter Davison
  • Bruce Cameron
  • Edward F. Crawley

Abstract

Many systems undergo significant architecture‐level change throughout their lifecycles in order to adapt to new operating and funding contexts, to react to failed technology development, or to incorporate new technologies. In all cases early architecture selection and technology investment decisions will constrain the system to certain regions of the tradespace, which can limit the evolvability of the system and its robustness to exogenous changes. In this paper we present a method for charting development pathways within a tradespace of potential architectures, with a view to enabling robustness to technology portfolio realization and later architectural changes. The tradespace is first transformed into a weighted, directed graph of architecture nodes with connectivity determined by relationships between technology portfolios and functional architecture. The tradespace exploration problem is then restated as a shortest path problem through this graph. This method is applied to the tradespace of in‐space transportation architectures for missions to Mars, finding that knowledge of pathways through the tradespace can identify negative coupling between functional architectures and particular technologies, as well as identify ways to prioritize future technology investments.

Suggested Citation

  • Peter Davison & Bruce Cameron & Edward F. Crawley, 2015. "Technology Portfolio Planning by Weighted Graph Analysis of System Architectures," Systems Engineering, John Wiley & Sons, vol. 18(1), pages 45-58, January.
    • Handle: RePEc:wly:syseng:v:18:y:2015:i:1:p:45-58
    DOI: 10.1002/sys.21287
    as

    Download full text from publisher

    File URL: https://doi.org/10.1002/sys.21287
    Download Restriction: no
    File URL: https://libkey.io/10.1002/sys.21287?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    References listed on IDEAS

    as
    1. Rudolf Smaling & Olivier de Weck, 2007. "Assessing risks and opportunities of technology infusion in system design," Systems Engineering, John Wiley & Sons, vol. 10(1), pages 1-25, March.
    2. Jin Y. Yen, 1971. "Finding the K Shortest Loopless Paths in a Network," Management Science, INFORMS, vol. 17(11), pages 712-716, July.
    3. Day, William H. E., 1981. "The complexity of computing metric distances between partitions," Mathematical Social Sciences, Elsevier, vol. 1(3), pages 269-287, May.
    4. Michel Benaroch & Robert J. Kauffman, 1999. "A Case for Using Real Options Pricing Analysis to Evaluate Information Technology Project Investments," Information Systems Research, INFORMS, vol. 10(1), pages 70-86, March.
    5. Zvi Covaliu & Robert M. Oliver, 1995. "Representation and Solution of Decision Problems Using Sequential Decision Diagrams," Management Science, INFORMS, vol. 41(12), pages 1860-1881, December.
    6. Ram Kumar & Haya Ajjan & Yuan Niu, 2008. "Information Technology Portfolio Management: Literature Review, Framework, and Research Issues," Information Resources Management Journal (IRMJ), IGI Global, vol. 21(3), pages 64-87, July.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Alejandro Salado, 2015. "Defining Better Test Strategies with Tradespace Exploration Techniques and Pareto Fronts: Application in an Industrial Project," Systems Engineering, John Wiley & Sons, vol. 18(6), pages 639-658, November.
    2. Yuskevich, Ilya & Smirnova, Ksenia & Vingerhoeds, Rob & Golkar, Alessandro, 2021. "Model-based approaches for technology planning and roadmapping: Technology forecasting and game-theoretic modeling," Technological Forecasting and Social Change, Elsevier, vol. 168(C).

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Yonggu Kim & Keeyoung Shin & Joseph Ahn & Eul-Bum Lee, 2017. "Probabilistic Cash Flow-Based Optimal Investment Timing Using Two-Color Rainbow Options Valuation for Economic Sustainability Appraisement," Sustainability, MDPI, vol. 9(10), pages 1-16, October.
    2. Huili Zhang & Yinfeng Xu & Xingang Wen, 2015. "Optimal shortest path set problem in undirected graphs," Journal of Combinatorial Optimization, Springer, vol. 29(3), pages 511-530, April.
    3. Morgan Dwyer & Bruce Cameron & Zoe Szajnfarber, 2015. "A Framework for Studying Cost Growth on Complex Acquisition Programs," Systems Engineering, John Wiley & Sons, vol. 18(6), pages 568-583, November.
    4. Daria Dzyabura & Srikanth Jagabathula, 2018. "Offline Assortment Optimization in the Presence of an Online Channel," Management Science, INFORMS, vol. 64(6), pages 2767-2786, June.
    5. Cassimon, Danny & Engelen, Peter-Jan & Yordanov, Vilimir, 2011. "Compound Real Option Valuation with Phase-Specific Volatility: a Multi-phase Mobile Payments Case Study," MPRA Paper 46053, University Library of Munich, Germany.
    6. Bielza, Concha & Gómez, Manuel & Shenoy, Prakash P., 2011. "A review of representation issues and modeling challenges with influence diagrams," Omega, Elsevier, vol. 39(3), pages 227-241, June.
    7. Melchiori, Anna & Sgalambro, Antonino, 2020. "A branch and price algorithm to solve the Quickest Multicommodity k-splittable Flow Problem," European Journal of Operational Research, Elsevier, vol. 282(3), pages 846-857.
    8. Michel Benaroch, 2018. "Real Options Models for Proactive Uncertainty-Reducing Mitigations and Applications in Cybersecurity Investment Decision Making," Information Systems Research, INFORMS, vol. 29(2), pages 315-340, June.
    9. Bettina Freitag & Lukas Häfner & Verena Pfeuffer & Jochen Übelhör, 2020. "Evaluating investments in flexible on-demand production capacity: a real options approach," Business Research, Springer;German Academic Association for Business Research, vol. 13(1), pages 133-161, April.
    10. Luss, Hanan & Wong, Richard T., 2005. "Graceful reassignment of excessively long communications paths in networks," European Journal of Operational Research, Elsevier, vol. 160(2), pages 395-415, January.
    11. Rinaldi, Marco & Viti, Francesco, 2017. "Exact and approximate route set generation for resilient partial observability in sensor location problems," Transportation Research Part B: Methodological, Elsevier, vol. 105(C), pages 86-119.
    12. Salvador Cruz Rambaud & Joaquín López Pascual & Juan Carlos Meléndez Rodríguez, 2021. "Sustainability in the Aerospace Sector, a Transition to Clean Energy: The E 2 -EVM Valuation Model," Sustainability, MDPI, vol. 13(12), pages 1-17, June.
    13. Timothy M. Sweda & Irina S. Dolinskaya & Diego Klabjan, 2017. "Adaptive Routing and Recharging Policies for Electric Vehicles," Transportation Science, INFORMS, vol. 51(4), pages 1326-1348, November.
    14. Chia-Chi Lu & Weifeng Hung & Jyh-Jian Sheu & Pai-Ta Shih, 2011. "Investment with network externality under uncertainty," Review of Quantitative Finance and Accounting, Springer, vol. 36(4), pages 555-564, May.
    15. Chen, Bi Yu & Chen, Xiao-Wei & Chen, Hui-Ping & Lam, William H.K., 2020. "Efficient algorithm for finding k shortest paths based on re-optimization technique," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 133(C).
    16. Sinha, Pankaj & Mudgal, Hemant, 2011. "Valuation of 3G spectrum license in India: A real option approach," MPRA Paper 31281, University Library of Munich, Germany.
    17. Doan, Xuan Vinh, 2022. "Distributionally robust optimization under endogenous uncertainty with an application in retrofitting planning," European Journal of Operational Research, Elsevier, vol. 300(1), pages 73-84.
    18. Prakash Shenoy, 1998. "Game Trees For Decision Analysis," Theory and Decision, Springer, vol. 44(2), pages 149-171, April.
    19. Hela Masri & Saoussen Krichen, 2018. "Exact and approximate approaches for the Pareto front generation of the single path multicommodity flow problem," Annals of Operations Research, Springer, vol. 267(1), pages 353-377, August.
    20. Fernández, Elena & Pozo, Miguel A. & Puerto, Justo & Scozzari, Andrea, 2017. "Ordered Weighted Average optimization in Multiobjective Spanning Tree Problem," European Journal of Operational Research, Elsevier, vol. 260(3), pages 886-903.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:wly:syseng:v:18:y:2015:i:1:p:45-58. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Wiley Content Delivery (email available below). General contact details of provider: https://doi.org/10.1002/(ISSN)1520-6858 .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.