An adaptive tabu-simulated annealing for concave cost transportation problems

dc.contributor.authorAltıparmak, Fulya
dc.contributor.authorKaraoğlan, İsmail
dc.date.accessioned2020-03-26T17:26:23Z
dc.date.available2020-03-26T17:26:23Z
dc.date.issued2008
dc.departmentSelçuk Üniversitesien_US
dc.description.abstractThe transportation problem (TP) is one of the most popular network problems because of its theoretical and practical importance. If the transportation cost linearly depends on the transported amount of the product, then TP is solvable in polynomial time with linear programming methods. However, in the real world, the transportation costs are generally nonlinear, frequently concave where the unit cost for transporting products decreases as the amount of products increases. Since concave cost transportation problems (ccTPs) are NP-hard, solving large-scale problems is time consuming. In this study, we propose a hybrid algorithm based on the concepts borrowed from tabu search (TS) and simulated annealing ( SA) to solve the ccTP. This algorithm, called ATSA ( adaptive tabu-simulated annealing), is an SA approach supplemented with a tabu list and adaptive cooling strategy. The effectiveness of ATSA has been investigated in two stages using a set of TPs with different sizes. The first stage includes performance analysis of ATSA using SA, ASA ( adaptive simulated anealing) and TS, which are basic forms of ATSA. In the second stage, ATSA has been compared with the heuristic approaches given in the literature for ccTP. Statistical analysis shows that ATSA exhibits better performance than its basic forms and heuristic approaches.en_US
dc.identifier.doi10.1057/palgrave.jors.2602301en_US
dc.identifier.endpage341en_US
dc.identifier.issn0160-5682en_US
dc.identifier.issn1476-9360en_US
dc.identifier.issue3en_US
dc.identifier.scopusqualityQ1en_US
dc.identifier.startpage331en_US
dc.identifier.urihttps://dx.doi.org/10.1057/palgrave.jors.2602301
dc.identifier.urihttps://hdl.handle.net/20.500.12395/22192
dc.identifier.volume59en_US
dc.identifier.wosWOS:000254299100007en_US
dc.identifier.wosqualityQ3en_US
dc.indekslendigikaynakWeb of Scienceen_US
dc.indekslendigikaynakScopusen_US
dc.language.isoenen_US
dc.publisherTAYLOR & FRANCIS LTDen_US
dc.relation.ispartofJOURNAL OF THE OPERATIONAL RESEARCH SOCIETYen_US
dc.relation.publicationcategoryMakale - Uluslararası Hakemli Dergi - Kurum Öğretim Elemanıen_US
dc.rightsinfo:eu-repo/semantics/closedAccessen_US
dc.selcuk20240510_oaigen_US
dc.subjecttransportation problemen_US
dc.subjectconcave costen_US
dc.subjectsimulated annealingen_US
dc.subjecttabu searchen_US
dc.subjecthybrid algorithmsen_US
dc.subjectadaptive cooling strategyen_US
dc.titleAn adaptive tabu-simulated annealing for concave cost transportation problemsen_US
dc.typeArticleen_US

Dosyalar