DC FieldValueLanguage
dc.contributor.authorMladenović, Nenaden
dc.contributor.authorMoreno, Joseen
dc.contributor.authorMoreno-Vega, J. Marcosen
dc.date.accessioned2020-05-02T16:42:17Z-
dc.date.available2020-05-02T16:42:17Z-
dc.date.issued1996-01-01en
dc.identifier.issn0354-0243en
dc.identifier.urihttp://researchrepository.mi.sanu.ac.rs/handle/123456789/2569-
dc.description.abstractThis paper describes a new Tabu search-like technique for solving combinatorial optimization problems. The chain-interchange move is introduced., which is an extension of the well-known 1-interchange move. Instead of interchanging one solution attribute that is in the solution with one that is not, four attributes are interchanged. In that way the Tabu search recency-based memory is easily obtained, i.e., the possibility of getting out of the local optimum trap can be achieved without additional efforts. Some location-allocation problems that could be solved by the same chain-interchange algorithm by only changing the objective function are listed. Moreover, most of the problems listed are suggested for the first time to be solved by Tabu search method (TS). Computer results are reported.en
dc.publisherFaculty of Organizational Sciences, University of Belgrade-
dc.relation.ispartofYugoslav Journal of Operations Researchen
dc.titleChain-interchange heuristic methoden
dc.typeArticleen
dc.identifier.scopus2-s2.0-0029734983en
dc.relation.firstpage41en
dc.relation.lastpage54en
dc.relation.issue1en
dc.relation.volume6en
item.cerifentitytypePublications-
item.grantfulltextnone-
item.openairetypeArticle-
item.openairecristypehttp://purl.org/coar/resource_type/c_18cf-
item.fulltextNo Fulltext-
crisitem.author.orcid0000-0001-6655-0409-
Show simple item record

SCOPUSTM   
Citations

17
checked on Jun 23, 2024

Page view(s)

46
checked on May 9, 2024

Google ScholarTM

Check


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.