• Login
    View Item 
    •   DORA Home
    • Faculty of Computing, Engineering and Media
    • School of Computer Science and Informatics
    • View Item
    •   DORA Home
    • Faculty of Computing, Engineering and Media
    • School of Computer Science and Informatics
    • View Item
    JavaScript is disabled for your browser. Some features of this site may not work without it.

    Greedy random adaptive memory programming search for the capacitated clustering problem

    Thumbnail
    Date
    2005-04-01
    Author
    Ahmadi, Samad;
    Osman, Ibrahim H.
    Metadata
    Show attachments and full item record
    Description
    This paper was one of the first examples of research on using memory for information generated during the search process to improve the selection of centres in clustering problems. This opened up a large number of possibilities for selecting which parts of data are to be recorded, and overcomes the main weakness of blind search algorithms that ignore information from the search history. Also, our selective approach in recording only the significant parts of data reduces the possibility of recording large quantities of unnecessary information.
    Citation : Ahmadi, S. and Osman, I.H. (2005) Greedy random adaptive memory programming search for the capacitated clustering problem. European Journal of Operational Research, 162(1), pp. 30-44.
    URI
    http://hdl.handle.net/2086/261
    DOI
    http://dx.doi.org/10.1016/j.ejor.2003.08.066
    ISSN : 0377-2217
    Research Group : Software Technology Research Laboratory (STRL)
    Collections
    • School of Computer Science and Informatics [3008]

    Submission Guide | Reporting Guide | Reporting Tool | DMU Open Access Libguide | Take Down Policy | Connect with DORA
    DMU LIbrary
     

     

    Browse

    All of DORACommunities & CollectionsAuthorsTitlesSubjects/KeywordsResearch InstituteBy Publication DateBy Submission DateThis CollectionAuthorsTitlesSubjects/KeywordsResearch InstituteBy Publication DateBy Submission Date

    My Account

    Login

    Submission Guide | Reporting Guide | Reporting Tool | DMU Open Access Libguide | Take Down Policy | Connect with DORA
    DMU LIbrary