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

Network optimisation for transporting liquefied natural gas from stations to end customers

Author

Listed:
  • Luping Zhang
  • Sicheng Zhang
  • Chunxia Yu

Abstract

This paper presents an approach to optimise the liquefied natural gas (LNG) transportation network. As the Chinese government put forward the coal to gas heating convention project in its Jing-Jin-Yi area, demands of LNG increased dramatically in 2017, rising an emergent need for optimisation of current LNG transportation network. A number of tanker trucks with limited capacity, parking at truck centres are available for LNG transportation. Each truck loads LNG at refuelling stations, transports LNG to customers, and returns to the truck centre after the delivery. According to the size of orders, the problem is divided into two sub-problems: a big order problem (BOP) to deal with integral trucks of LNG demands, and a small order problem to fulfil fractional demands. Trucks can be sent from multiple truck centres; and trucks need to move the LNG in gas stations – pickup locations – to a series of customers – delivery locations. We formulate the BOP with integer programming, and provide a decomposition approach. For small order problem, a network representation and a mathematical model are presented. A tailored object-coding genetic algorithm is developed to solve the small order problem. Four purposely designed experiments are conducted to test its performance.

Suggested Citation

  • Luping Zhang & Sicheng Zhang & Chunxia Yu, 2021. "Network optimisation for transporting liquefied natural gas from stations to end customers," International Journal of Production Research, Taylor & Francis Journals, vol. 59(6), pages 1791-1813, March.
  • Handle: RePEc:taf:tprsxx:v:59:y:2021:i:6:p:1791-1813
    DOI: 10.1080/00207543.2020.1725682
    as

    Download full text from publisher

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

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

    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:59:y:2021:i:6:p:1791-1813. 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.