Solving the multiple level warehouse layout problem using ant colony optimization
dc.authorid | 0000-0003-1590-4494 | |
dc.authorid | 0000-0001-6774-0933 | |
dc.contributor.author | Arnaout, Jean Paul M. | en_US |
dc.contributor.author | ElKhoury, Caline | en_US |
dc.contributor.author | Karayaz, Gamze | en_US |
dc.date.accessioned | 2019-08-31T12:10:23Z | |
dc.date.accessioned | 2019-08-05T16:04:53Z | |
dc.date.available | 2019-08-31T12:10:23Z | |
dc.date.available | 2019-08-05T16:04:53Z | |
dc.date.issued | 2020-03-01 | |
dc.department | Işık Üniversitesi, İktisadi ve İdari Bilimler Fakültesi, İşletme Bölümü | en_US |
dc.department | Işık University, Faculty of Economics and Administrative Sciences, Department of Management | en_US |
dc.description.abstract | This paper addresses the multiple level warehouse layout problem, which involves assigning items to cells and levels with the objective of minimizing transportation costs. A monthly demand and an inventory requirement are associated with every item type along with vertical and horizontal unit transportation costs. The warehouse has one port to transport items vertically from ground floor to the other levels, where each item must be assigned to exactly one cell on the assigned level. An ant colony optimization (ACO) algorithm is adapted to this NP-complete problem and its performance is evaluated by comparing its solutions to the ones obtained using genetic algorithms (GA) as well as the optimal solutions for small problems. The computational results reflected the superiority of ACO in large-size problem instances, with a marginally better performance than GA in smaller ones, while solving the tested instances within a reasonable computational time. Furthermore, ACO was able to attain most of the known optimal solutions for small-size problem instances. | en_US |
dc.description.version | Publisher's Version | en_US |
dc.identifier.citation | Arnaout, J., ElKhoury, C. & Karayaz, G. (2020). Solving the multiple level warehouse layout problem using ant colony optimization. Operational Research, , 20(1), 473-490. doi:10.1007/s12351-017-0334-5 | en_US |
dc.identifier.doi | 10.1007/s12351-017-0334-5 | |
dc.identifier.endpage | 490 | |
dc.identifier.issn | 1109-2858 | |
dc.identifier.issn | 1866-1505 | |
dc.identifier.issue | 1 | |
dc.identifier.scopus | 2-s2.0-85026907551 | |
dc.identifier.scopusquality | Q2 | |
dc.identifier.startpage | 473 | |
dc.identifier.uri | https://hdl.handle.net/11729/1850 | |
dc.identifier.uri | https://dx.doi.org/10.1007/s12351-017-0334-5 | |
dc.identifier.volume | 20 | |
dc.identifier.wos | WOS:000512993700019 | |
dc.identifier.wosquality | Q2 | |
dc.indekslendigikaynak | Web of Science | en_US |
dc.indekslendigikaynak | Scopus | en_US |
dc.indekslendigikaynak | Science Citation Index Expanded (SCI-EXPANDED) | en_US |
dc.indekslendigikaynak | Social Sciences Citation Index (SSCI) | en_US |
dc.institutionauthor | Karayaz, Gamze | en_US |
dc.institutionauthorid | 0000-0001-6774-0933 | |
dc.language.iso | en | en_US |
dc.peerreviewed | Yes | en_US |
dc.publicationstatus | Published | en_US |
dc.publisher | Springer Verlag | en_US |
dc.relation.ispartof | Operational Research | en_US |
dc.relation.publicationcategory | Makale - Uluslararası Hakemli Dergi - Kurum Öğretim Elemanı | en_US |
dc.rights | info:eu-repo/semantics/closedAccess | en_US |
dc.subject | Ant colony optimization | en_US |
dc.subject | Metaheuristic | en_US |
dc.subject | Multiple level warehouse layout problem | en_US |
dc.subject | Storage assignment | en_US |
dc.subject | Storage (materials) | en_US |
dc.subject | Warehouses | en_US |
dc.title | Solving the multiple level warehouse layout problem using ant colony optimization | en_US |
dc.type | Article | en_US |
dspace.entity.type | Publication |
Dosyalar
Orijinal paket
1 - 1 / 1
Küçük Resim Yok
- İsim:
- 1850.pdf
- Boyut:
- 874.53 KB
- Biçim:
- Adobe Portable Document Format
- Açıklama:
- Publisher's Version