IDEAS home Printed from https://ideas.repec.org/a/taf/transp/v33y2010i4p395-406.html
   My bibliography  Save this article

Optimal tank-trailer routing using the ILOG constraint programming -- a Taiwan case study

Author

Listed:
  • Pei-Chun Lin
  • Tai Chiu Edwin Cheng
  • Juo-Yi Chang
  • Jenhung Wang

Abstract

This paper investigates the routing of pressurized tank trailers and proposes a scheduling plan which ensures the practical delivery of industrial gases under the objective of reducing transportation costs. Using constraint programming, we solve a combinatorial optimization problem that incorporates both hard and soft constraints for routing and scheduling tank trailers. Hard constraints are resource and safety/regulation constraints, whereas soft constraints are utilization and efficiency constraints. This approach enables tank-trailer routing and scheduling management to consider different combinations of parameters and view the results in ‘real-time.’ The routing and scheduling results based on a case study in Taiwan fulfil the goals of avoiding risks associated with transporting industrial gases, and attaining efficient delivery while conforming to regulations and consistent with good business practice. The results also suggest that significant economies in distribution costs are possible.

Suggested Citation

  • Pei-Chun Lin & Tai Chiu Edwin Cheng & Juo-Yi Chang & Jenhung Wang, 2010. "Optimal tank-trailer routing using the ILOG constraint programming -- a Taiwan case study," Transportation Planning and Technology, Taylor & Francis Journals, vol. 33(4), pages 395-406, May.
    • Handle: RePEc:taf:transp:v:33:y:2010:i:4:p:395-406
    DOI: 10.1080/03081060.2010.494031
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/03081060.2010.494031
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1080/03081060.2010.494031?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:transp:v:33:y:2010:i:4:p:395-406. 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/GTPT20 .

    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.