IDEAS home Printed from https://ideas.repec.org/a/ids/ijetma/v26y2023i6p457-469.html
   My bibliography  Save this article

An optimisation method of urban road green space landscape layout based on leapfrog algorithm

Author

Listed:
  • Yuanying Li
  • Linlin Zheng

Abstract

To improve the effect of green space landscape layout optimisation and shorten the time-consuming of view layout optimisation, this paper proposes an urban road green space landscape layout optimisation method based on leapfrog algorithm. Firstly, GIS is used to collect road landscape layout data. Then, the index weight is calculated by analytic hierarchy process. The frog-leaping algorithm is used to construct the fitness objective function and solve the fitness value. Finally, the fitness values are sorted from good to bad to judge whether the current output optimal value is the global optimal value, and the final landscape layout optimisation scheme is obtained. The experimental results show that the green space landscape layout optimisation time of this method is only 8.3 s, and the rationality of landscape layout is as high as 99.02%, which shows that this method can have a good effect of road green space landscape layout optimisation.

Suggested Citation

  • Yuanying Li & Linlin Zheng, 2023. "An optimisation method of urban road green space landscape layout based on leapfrog algorithm," International Journal of Environmental Technology and Management, Inderscience Enterprises Ltd, vol. 26(6), pages 457-469.
    • Handle: RePEc:ids:ijetma:v:26:y:2023:i:6:p:457-469
    as

    Download full text from publisher

    File URL: http://www.inderscience.com/link.php?id=134323
    Download Restriction: Access to full text is restricted to subscribers.
    ---><---

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

    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:ids:ijetma:v:26:y:2023:i:6:p:457-469. 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.

    We have no bibliographic references for this item. You can help adding them by using 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: Sarah Parker (email available below). General contact details of provider: http://www.inderscience.com/browse/index.php?journalID=11 .

    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.