IDEAS home Printed from https://ideas.repec.org/a/spr/comaot/v20y2014i4d10.1007_s10588-013-9171-0.html
   My bibliography  Save this article

Optimizing human activity patterns using global sensitivity analysis

Author

Listed:
  • Geoffrey Fairchild

    (Los Alamos National Laboratory)

  • Kyle S. Hickmann

    (Tulane University)

  • Susan M. Mniszewski

    (Los Alamos National Laboratory)

  • Sara Y. Del Valle

    (Los Alamos National Laboratory)

  • James M. Hyman

    (Tulane University)

Abstract

Implementing realistic activity patterns for a population is crucial for modeling, for example, disease spread, supply and demand, and disaster response. Using the dynamic activity simulation engine, DASim, we generate schedules for a population that capture regular (e.g., working, eating, and sleeping) and irregular activities (e.g., shopping or going to the doctor). We use the sample entropy (SampEn) statistic to quantify a schedule’s regularity for a population. We show how to tune an activity’s regularity by adjusting SampEn, thereby making it possible to realistically design activities when creating a schedule. The tuning process sets up a computationally intractable high-dimensional optimization problem. To reduce the computational demand, we use Bayesian Gaussian process regression to compute global sensitivity indices and identify the parameters that have the greatest effect on the variance of SampEn. We use the harmony search (HS) global optimization algorithm to locate global optima. Our results show that HS combined with global sensitivity analysis can efficiently tune the SampEn statistic with few search iterations. We demonstrate how global sensitivity analysis can guide statistical emulation and global optimization algorithms to efficiently tune activities and generate realistic activity patterns. Though our tuning methods are applied to dynamic activity schedule generation, they are general and represent a significant step in the direction of automated tuning and optimization of high-dimensional computer simulations.

Suggested Citation

  • Geoffrey Fairchild & Kyle S. Hickmann & Susan M. Mniszewski & Sara Y. Del Valle & James M. Hyman, 2014. "Optimizing human activity patterns using global sensitivity analysis," Computational and Mathematical Organization Theory, Springer, vol. 20(4), pages 394-416, December.
    • Handle: RePEc:spr:comaot:v:20:y:2014:i:4:d:10.1007_s10588-013-9171-0
    DOI: 10.1007/s10588-013-9171-0
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10588-013-9171-0
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10588-013-9171-0?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
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Marrel, Amandine & Iooss, Bertrand & Laurent, Béatrice & Roustant, Olivier, 2009. "Calculations of Sobol indices for the Gaussian process metamodel," Reliability Engineering and System Safety, Elsevier, vol. 94(3), pages 742-751.
    2. S. M. Mniszewski & S. Y. Del Valle & P. D. Stroud & J. M. Riese & S. J. Sydoriak, 2008. "Pandemic simulation of antivirals + school closures: buying time until strain-specific vaccine is available," Computational and Mathematical Organization Theory, Springer, vol. 14(3), pages 209-221, September.
    3. Bhat, Chandra R. & Frusti, Teresa & Zhao, Huimin & Schönfelder, Stefan & Axhausen, Kay W., 2004. "Intershopping duration: an analysis using multiweek data," Transportation Research Part B: Methodological, Elsevier, vol. 38(1), pages 39-60, January.
    4. Higdon, Dave & Gattiker, James & Williams, Brian & Rightley, Maria, 2008. "Computer Model Calibration Using High-Dimensional Output," Journal of the American Statistical Association, American Statistical Association, vol. 103, pages 570-583, June.
    5. Fred Glover, 1990. "Tabu Search—Part II," INFORMS Journal on Computing, INFORMS, vol. 2(1), pages 4-32, February.
    6. Kitamura, Ryuichi & Yamamoto, Toshiyuki & Susilo, Yusak O. & Axhausen, Kay W., 2006. "How routine is a routine? An analysis of the day-to-day variability in prism vertex location," Transportation Research Part A: Policy and Practice, Elsevier, vol. 40(3), pages 259-279, March.
    7. Fred Glover, 1989. "Tabu Search---Part I," INFORMS Journal on Computing, INFORMS, vol. 1(3), pages 190-206, August.
    8. Phillip Stroud & Sara Del Valle & Stephen Sydoriak & Jane Riese & Susan Mniszewski, 2007. "Spatial Dynamics of Pandemic Influenza in a Massive Artificial Society," Journal of Artificial Societies and Social Simulation, Journal of Artificial Societies and Social Simulation, vol. 10(4), pages 1-9.
    9. Ryuichi Kitamura & Cynthia Chen & Ram Pendyala & Ravi Narayanan, 2000. "Micro-simulation of daily activity-travel patterns for travel demand forecasting," Transportation, Springer, vol. 27(1), pages 25-51, February.
    10. Robert Schlich & Kay Axhausen, 2003. "Habitual travel behaviour: Evidence from a six-week travel diary," Transportation, Springer, vol. 30(1), pages 13-36, February.
    11. Jeremy E. Oakley & Anthony O'Hagan, 2004. "Probabilistic sensitivity analysis of complex models: a Bayesian approach," Journal of the Royal Statistical Society Series B, Royal Statistical Society, vol. 66(3), pages 751-769, August.
    12. Richard M. Burton, 2003. "Computational Laboratories for Organization Science: Questions, Validity and Docking," Computational and Mathematical Organization Theory, Springer, vol. 9(2), pages 91-108, July.
    13. D. Brockmann & L. Hufnagel & T. Geisel, 2006. "The scaling laws of human travel," Nature, Nature, vol. 439(7075), pages 462-465, January.
    14. Jeremy Oakley, 2002. "Bayesian inference for the uncertainty distribution of computer model outputs," Biometrika, Biometrika Trust, vol. 89(4), pages 769-784, December.
    15. Vittoria Colizza & Alain Barrat & Marc Barthelemy & Alain-Jacques Valleron & Alessandro Vespignani, 2007. "Modeling the Worldwide Spread of Pandemic Influenza: Baseline Case and Containment Interventions," PLOS Medicine, Public Library of Science, vol. 4(1), pages 1-16, January.
    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. Davide Secchi & Raffaello Seri, 2017. "Controlling for false negatives in agent-based models: a review of power analysis in organizational research," Computational and Mathematical Organization Theory, Springer, vol. 23(1), pages 94-121, March.
    2. Behrouz Pirouz & Sina Shaffiee Haghshenas & Sami Shaffiee Haghshenas & Patrizia Piro, 2020. "Investigating a Serious Challenge in the Sustainable Development Process: Analysis of Confirmed cases of COVID-19 (New Type of Coronavirus) Through a Binary Classification Using Artificial Intelligenc," Sustainability, MDPI, vol. 12(6), pages 1-21, March.
    3. Jin Hee Yoon & Zong Woo Geem, 2021. "Empirical Convergence Theory of Harmony Search Algorithm for Box-Constrained Discrete Optimization of Convex Function," Mathematics, MDPI, vol. 9(5), pages 1-13, March.

    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. Mohammad Javad Feizollahi & Igor Averbakh, 2014. "The Robust (Minmax Regret) Quadratic Assignment Problem with Interval Flows," INFORMS Journal on Computing, INFORMS, vol. 26(2), pages 321-335, May.
    2. C N Potts & V A Strusevich, 2009. "Fifty years of scheduling: a survey of milestones," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 60(1), pages 41-68, May.
    3. Cazzaro, Davide & Fischetti, Martina & Fischetti, Matteo, 2020. "Heuristic algorithms for the Wind Farm Cable Routing problem," Applied Energy, Elsevier, vol. 278(C).
    4. Huang, Yeran & Yang, Lixing & Tang, Tao & Gao, Ziyou & Cao, Fang, 2017. "Joint train scheduling optimization with service quality and energy efficiency in urban rail transit networks," Energy, Elsevier, vol. 138(C), pages 1124-1147.
    5. B Dengiz & C Alabas-Uslu & O Dengiz, 2009. "Optimization of manufacturing systems using a neural network metamodel with a new training approach," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 60(9), pages 1191-1197, September.
    6. S-W Lin & K-C Ying, 2008. "A hybrid approach for single-machine tardiness problems with sequence-dependent setup times," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 59(8), pages 1109-1119, August.
    7. Joseph B. Mazzola & Robert H. Schantz, 1997. "Multiple‐facility loading under capacity‐based economies of scope," Naval Research Logistics (NRL), John Wiley & Sons, vol. 44(3), pages 229-256, April.
    8. Abdmouleh, Zeineb & Gastli, Adel & Ben-Brahim, Lazhar & Haouari, Mohamed & Al-Emadi, Nasser Ahmed, 2017. "Review of optimization techniques applied for the integration of distributed generation from renewable energy sources," Renewable Energy, Elsevier, vol. 113(C), pages 266-280.
    9. Masoud Yaghini & Mohammad Karimi & Mohadeseh Rahbar, 2015. "A set covering approach for multi-depot train driver scheduling," Journal of Combinatorial Optimization, Springer, vol. 29(3), pages 636-654, April.
    10. Chris S. K. Leung & Henry Y. K. Lau, 2018. "Multiobjective Simulation-Based Optimization Based on Artificial Immune Systems for a Distribution Center," Journal of Optimization, Hindawi, vol. 2018, pages 1-15, May.
    11. Ilfat Ghamlouche & Teodor Gabriel Crainic & Michel Gendreau, 2003. "Cycle-Based Neighbourhoods for Fixed-Charge Capacitated Multicommodity Network Design," Operations Research, INFORMS, vol. 51(4), pages 655-667, August.
    12. Olli Bräysy & Michel Gendreau, 2005. "Vehicle Routing Problem with Time Windows, Part II: Metaheuristics," Transportation Science, INFORMS, vol. 39(1), pages 119-139, February.
    13. Andaryan, Abdullah Zareh & Mousighichi, Kasra & Ghaffarinasab, Nader, 2024. "A heuristic approach to the stochastic capacitated single allocation hub location problem with Bernoulli demands," European Journal of Operational Research, Elsevier, vol. 312(3), pages 954-968.
    14. Panta Lučić & Dušan Teodorović, 2007. "Metaheuristics approach to the aircrew rostering problem," Annals of Operations Research, Springer, vol. 155(1), pages 311-338, November.
    15. Haluk Yapicioglu, 2018. "Multiperiod Multi Traveling Salesmen Problem Considering Time Window Constraints with an Application to a Real World Case," Networks and Spatial Economics, Springer, vol. 18(4), pages 773-801, December.
    16. Daniel O’Malley & Velimir V Vesselinov & Boian S Alexandrov & Ludmil B Alexandrov, 2018. "Nonnegative/Binary matrix factorization with a D-Wave quantum annealer," PLOS ONE, Public Library of Science, vol. 13(12), pages 1-12, December.
    17. Marco Antonio Boschetti & Vittorio Maniezzo, 2022. "Matheuristics: using mathematics for heuristic design," 4OR, Springer, vol. 20(2), pages 173-208, June.
    18. C-H Lan & C-C Chen, 2007. "Optimal purchase of two-itemized drugs for a disease," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 58(3), pages 309-316, March.
    19. G Lulli & U Pietropaoli & N Ricciardi, 2011. "Service network design for freight railway transportation: the Italian case," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 62(12), pages 2107-2119, December.
    20. Cheung, Kam-Fung & Bell, Michael G.H., 2021. "Improving connectivity of compromised digital networks via algebraic connectivity maximisation," European Journal of Operational Research, Elsevier, vol. 294(1), pages 353-364.

    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:spr:comaot:v:20:y:2014:i:4:d:10.1007_s10588-013-9171-0. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.