• Login
    View Item 
    •   IIMA Institutional Repository Home
    • Working Papers
    • Working Papers
    • View Item
    •   IIMA Institutional Repository Home
    • Working Papers
    • Working Papers
    • View Item
    JavaScript is disabled for your browser. Some features of this site may not work without it.

    A heuristic procedure for one dimensional bin packing problem with additional constraints

    Thumbnail
    View/Open
    2003-11-02satyendra.pdf (225.1Kb)
    Date
    2010-03-31
    Author
    Kumar, Satyendra
    Rao, V. Venkata
    Tirupati, Devanath
    Metadata
    Show full item record
    Abstract
    We proposed a heuristic algorithm to solve the one-dimensional bin-packing problem with additional constraints. The proposed algorithm has been applied to solve a practical vehicle-allocation problem. The experimental results show that our proposed heuristic provides optimal or near-optimal results, and performs better than the first fit decreasing algorithm modified to incorporate additional constraints.
    URI
    http://hdl.handle.net/11718/1818
    Collections
    • Working Papers [2602]

    DSpace software copyright © 2002-2016  DuraSpace
    Contact Us | Send Feedback
    Theme by 
    Atmire NV
     

     

    Browse

    All of IIMA Institutional RepositoryCommunities & CollectionsBy Issue DateAuthorsTitlesSubjectsThis CollectionBy Issue DateAuthorsTitlesSubjects

    My Account

    Login

    Statistics

    View Usage Statistics

    DSpace software copyright © 2002-2016  DuraSpace
    Contact Us | Send Feedback
    Theme by 
    Atmire NV