Research@Lincoln
    • Login
     
    View Item 
    •   Research@Lincoln Home
    • Research Centres and Units
    • Centre for Advanced Computational Solutions
    • Centre for Advanced Computational Solutions
    • View Item
    •   Research@Lincoln Home
    • Research Centres and Units
    • Centre for Advanced Computational Solutions
    • Centre for Advanced Computational Solutions
    • View Item
    JavaScript is disabled for your browser. Some features of this site may not work without it.

    Optimisation of a complex simulation model

    Liu, D.; Post, Elizabeth A.; Kulasiri, Gamalathge D.; Sherlock, R.
    Abstract
    In this paper we describe techniques utilised in the development of a scheme for identifying the regions in an 8-dimensional parameter space that gave optimal (or near-optimal) performance in a computational simulation of a real-world system. The system model, developed by Dexcel Ltd, attempts a detailed representation of pastoral dairying scenarios. It incorporates sub-models, themselves complex in many cases, of pasture growth, animal metabolism etc. Each evaluation of the objective function, a composite 'farm performance index', requires simulation of at least a one-year period of farm operation with a daily time-step and hence is computationally expensive. Since similar situations are likely to arise in other practical optimisation exercises, the results presented should have some quite general applicability.Two quite different methods of optimisation - Genetic Algorithm (GA) and Lipschitz Branch-and-Bound (LBB) algorithm are investigated and contrasted. Practical issues related to their efficient implementation in a Linux cluster parallel processing environment are discussed and their performance on the above problem is compared. The problem of visualisation of the objective function (response surface) in high-dimensional spaces is also considered in the context of the farm optimisation problem (where from a practical viewpoint knowledge of its behaviour in the region of optima is actually more important than the precise positions or values of the optima themselves). An adaption of the Parallel Coordinates visualization is described which helps visualise some important properties of the model’s output topography.... [Show full abstract]
    Keywords
    Lipschitz Branch-and-Bound; black-box optimisation; Genetic Algorithm; parallel coordinates; black-box optimization
    Date
    2003-07
    Type
    Conference Contribution - published (Conference Paper)
    Collections
    • Centre for Advanced Computational Solutions [53]
    Thumbnail
    View/Open
    kulasiri_modsim_03.pdf
    Share this

    on Twitter on Facebook on LinkedIn on Reddit on Tumblr by Email

    Metadata
     Expand record
    © 2005 Modelling & Simulation Society of Australia & New Zealand Inc.
    Citation
    Liu, D. S., Post, E., Kulasiri, D., Sherlock, R. A. (2003). Optimisation of a complex simulation model. In In Post, D. A. (ed) MODSIM 2003 International Congress on Modelling and Simulation: Integrative Modelling of Biophysical, Social, and Economic Systems for Resource Management Solutions. Modelling and Simulation Society of Australia and New Zealand, July 2003.
    This service is maintained by Learning, Teaching and Library
    • Archive Policy
    • Copyright and Reuse
    • Deposit Guidelines and FAQ
    • Contact Us
     

     

    Browse

    All of Research@LincolnCommunities & CollectionsTitlesAuthorsKeywordsBy Issue DateThis CollectionTitlesAuthorsKeywordsBy Issue Date

    My Account

    LoginRegister

    Statistics

    View Usage Statistics
    This service is maintained by Learning, Teaching and Library
    • Archive Policy
    • Copyright and Reuse
    • Deposit Guidelines and FAQ
    • Contact Us