IDEAS home Printed from https://ideas.repec.org/h/spr/sprchp/978-3-642-38391-5_103.html
   My bibliography  Save this book chapter

Integer Linear Programming Model and Greedy Algorithm for Camping Along the Big Long River Problem

In: The 19th International Conference on Industrial Engineering and Engineering Management

Author

Listed:
  • Zhen-ping Li

    (Beijing Wuzi University)

  • Xiao-dong Huang

    (Beijing Wuzi University)

Abstract

In this paper, we investigate the problem of camping along the Big Long River: How to schedule the X trips in a rafting season of the Big Long River so that the total meets of any boats are minimal? By introducing the proper variables, the problem is formulated into an integer linear programming model. For small size problem, this integer linear programming can be solved by Lingo software; for large size problem, we design a greedy algorithm to arrange the schedule of the given X boats. Finally, we do some simulations of the above model and algorithm and obtain the optimal solution.

Suggested Citation

  • Zhen-ping Li & Xiao-dong Huang, 2013. "Integer Linear Programming Model and Greedy Algorithm for Camping Along the Big Long River Problem," Springer Books, in: Ershi Qi & Jiang Shen & Runliang Dou (ed.), The 19th International Conference on Industrial Engineering and Engineering Management, edition 127, chapter 0, pages 973-982, Springer.
    • Handle: RePEc:spr:sprchp:978-3-642-38391-5_103
    DOI: 10.1007/978-3-642-38391-5_103
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a search for a similarly titled item that would be available.

    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:spr:sprchp:978-3-642-38391-5_103. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.