IDEAS home Printed from https://ideas.repec.org/a/taf/tprsxx/v63y2025i13p4617-4638.html
   My bibliography  Save this article

Land layout optimisation for virtual land sales in the metaverse: two-dimensional assortment problem

Author

Listed:
  • Yao-Huei Huang
  • Bohan Hu
  • F. J. Hwang

Abstract

With the growing popularity of the metaverse, the virtual real estate in the metaverse has generated immense investment enthusiasm. Considering the virtual land sale mode allowing the potential buyers to request the purchase of rectangular land parcels of a specified size, this study investigates how to lay out the requested land parcels for minimising the size of the required rectangular open land, which can be formulated completely as the two-dimensional assortment problem (2DAP). Due to the strong NP-hardness of the 2DAP, an effective and efficient heuristic solution approach named binary adjoining algorithm (BAA) is presented for tackling the 2DAPs in large scales. The conducted computational experiments show that the BAA can outperform the state-of-the-art piecewise-linearisation mixed integer linear programming model as well as four existing advanced metaheuristic techniques designed for the 2DAP, in both solution quality and computational time, on the small-size instances. The superiority of the BAA over either foregoing reference method on the large-size instances with up to 60 requested land parcels is also demonstrated.

Suggested Citation

  • Yao-Huei Huang & Bohan Hu & F. J. Hwang, 2025. "Land layout optimisation for virtual land sales in the metaverse: two-dimensional assortment problem," International Journal of Production Research, Taylor & Francis Journals, vol. 63(13), pages 4617-4638, July.
  • Handle: RePEc:taf:tprsxx:v:63:y:2025:i:13:p:4617-4638
    DOI: 10.1080/00207543.2024.2440786
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/00207543.2024.2440786
    Download Restriction: Access to full text is restricted to subscribers.

    File URL: https://libkey.io/10.1080/00207543.2024.2440786?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

    for a different version of it.

    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:taf:tprsxx:v:63:y:2025:i:13:p:4617-4638. 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: Chris Longhurst (email available below). General contact details of provider: http://www.tandfonline.com/TPRS20 .

    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.