SHELF SPACE OPTIMIZATION USINGMETAHEURISTIC ALGORITHMS

Efficient allocation of shelves in retail is essential to gain and maintain competitiveness. Shelf Space Allocation Problem (SSAP) is an extension of the knapsack problem; the objective is determination of the products and their locations on shelves to maximize expected profit. Various factors such...

Full description

Saved in:
Bibliographic Details
Published in:International journal of information, business and management business and management, 2013-05, Vol.5 (2), p.210
Main Authors: Bilsel, Murat, Ayhan, M Batuhan, Bulkan, Serol
Format: Article
Language:English
Subjects:
Algorithms
Allocations
Competitive advantage
Genetic algorithms
Heuristic
Inventory
Knapsack problem
Mutation
Neighborhoods
Optimization
Population
Profit margins
Profit maximization
Profitability
Retail stores
Retailing industry
Studies
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
cited_by
cites
container_end_page
container_issue 2
container_start_page 210
container_title International journal of information, business and management
container_volume 5
creator Bilsel, Murat
Ayhan, M Batuhan
Bulkan, Serol
description Efficient allocation of shelves in retail is essential to gain and maintain competitiveness. Shelf Space Allocation Problem (SSAP) is an extension of the knapsack problem; the objective is determination of the products and their locations on shelves to maximize expected profit. Various factors such as location within the store, product adjacencies and number of facings allocated for that particular product affect profitability of a product. Due to the size and complexity of the problem, metahuristic methods are preferred. This manuscript provides two metaheuristic solution algorithms to the model proposed by Ayhan et al. (2007), which is an extension of the model introduced by Yang (2001). This study has shown that for problems of various sizes both Tabu Search (TS) and Genetic Algorithm (GA) can provide better solutions than the greedy algorithm proposed by Ayhan et al. [PUBLICATION ABSTRACT]
format article
fullrecord <record><control><sourceid>proquest</sourceid><recordid>TN_cdi_proquest_journals_1511435933</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>3261000951</sourcerecordid><originalsourceid>FETCH-proquest_journals_15114359333</originalsourceid><addsrcrecordid>eNpjYuA0MjK00DUwMYtgAbINzM10LY0MjDgYeIuLswwMDAwNDUwNLSw4GcyCPVx93BSCAxydXRX8A0I8fT2jHEM8_f0UQoM9_dx9XUMcPVxDgzyDQzydFRx93P2DPEM8fIN5GFjTEnOKU3mhNDeDsptriLOHbkFRfmFpanFJfFZ-aVEeUCre0NTQ0MTY1NLY2Jg4VQDgtzJT</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>1511435933</pqid></control><display><type>article</type><title>SHELF SPACE OPTIMIZATION USINGMETAHEURISTIC ALGORITHMS</title><source>ABI/INFORM Global (ProQuest)</source><creator>Bilsel, Murat ; Ayhan, M Batuhan ; Bulkan, Serol</creator><creatorcontrib>Bilsel, Murat ; Ayhan, M Batuhan ; Bulkan, Serol</creatorcontrib><description>Efficient allocation of shelves in retail is essential to gain and maintain competitiveness. Shelf Space Allocation Problem (SSAP) is an extension of the knapsack problem; the objective is determination of the products and their locations on shelves to maximize expected profit. Various factors such as location within the store, product adjacencies and number of facings allocated for that particular product affect profitability of a product. Due to the size and complexity of the problem, metahuristic methods are preferred. This manuscript provides two metaheuristic solution algorithms to the model proposed by Ayhan et al. (2007), which is an extension of the model introduced by Yang (2001). This study has shown that for problems of various sizes both Tabu Search (TS) and Genetic Algorithm (GA) can provide better solutions than the greedy algorithm proposed by Ayhan et al. [PUBLICATION ABSTRACT]</description><identifier>ISSN: 2076-9202</identifier><identifier>EISSN: 2218-046X</identifier><language>eng</language><publisher>Chung-Li: Educational Research Multimedia &amp; Publications</publisher><subject>Algorithms ; Allocations ; Competitive advantage ; Genetic algorithms ; Heuristic ; Inventory ; Knapsack problem ; Mutation ; Neighborhoods ; Optimization ; Population ; Profit margins ; Profit maximization ; Profitability ; Retail stores ; Retailing industry ; Studies</subject><ispartof>International journal of information, business and management, 2013-05, Vol.5 (2), p.210</ispartof><rights>Copyright Educational Research Multimedia &amp; Publications May 2013</rights><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktopdf>$$Uhttps://www.proquest.com/docview/1511435933/fulltextPDF?pq-origsite=primo$$EPDF$$P50$$Gproquest$$H</linktopdf><linktohtml>$$Uhttps://www.proquest.com/docview/1511435933?pq-origsite=primo$$EHTML$$P50$$Gproquest$$H</linktohtml><link.rule.ids>314,780,784,11688,36060,44363,74767</link.rule.ids></links><search><creatorcontrib>Bilsel, Murat</creatorcontrib><creatorcontrib>Ayhan, M Batuhan</creatorcontrib><creatorcontrib>Bulkan, Serol</creatorcontrib><title>SHELF SPACE OPTIMIZATION USINGMETAHEURISTIC ALGORITHMS</title><title>International journal of information, business and management</title><description>Efficient allocation of shelves in retail is essential to gain and maintain competitiveness. Shelf Space Allocation Problem (SSAP) is an extension of the knapsack problem; the objective is determination of the products and their locations on shelves to maximize expected profit. Various factors such as location within the store, product adjacencies and number of facings allocated for that particular product affect profitability of a product. Due to the size and complexity of the problem, metahuristic methods are preferred. This manuscript provides two metaheuristic solution algorithms to the model proposed by Ayhan et al. (2007), which is an extension of the model introduced by Yang (2001). This study has shown that for problems of various sizes both Tabu Search (TS) and Genetic Algorithm (GA) can provide better solutions than the greedy algorithm proposed by Ayhan et al. [PUBLICATION ABSTRACT]</description><subject>Algorithms</subject><subject>Allocations</subject><subject>Competitive advantage</subject><subject>Genetic algorithms</subject><subject>Heuristic</subject><subject>Inventory</subject><subject>Knapsack problem</subject><subject>Mutation</subject><subject>Neighborhoods</subject><subject>Optimization</subject><subject>Population</subject><subject>Profit margins</subject><subject>Profit maximization</subject><subject>Profitability</subject><subject>Retail stores</subject><subject>Retailing industry</subject><subject>Studies</subject><issn>2076-9202</issn><issn>2218-046X</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2013</creationdate><recordtype>article</recordtype><sourceid>M0C</sourceid><recordid>eNpjYuA0MjK00DUwMYtgAbINzM10LY0MjDgYeIuLswwMDAwNDUwNLSw4GcyCPVx93BSCAxydXRX8A0I8fT2jHEM8_f0UQoM9_dx9XUMcPVxDgzyDQzydFRx93P2DPEM8fIN5GFjTEnOKU3mhNDeDsptriLOHbkFRfmFpanFJfFZ-aVEeUCre0NTQ0MTY1NLY2Jg4VQDgtzJT</recordid><startdate>20130501</startdate><enddate>20130501</enddate><creator>Bilsel, Murat</creator><creator>Ayhan, M Batuhan</creator><creator>Bulkan, Serol</creator><general>Educational Research Multimedia &amp; Publications</general><scope>3V.</scope><scope>7WY</scope><scope>7WZ</scope><scope>7XB</scope><scope>87Z</scope><scope>8FE</scope><scope>8FG</scope><scope>8FK</scope><scope>8FL</scope><scope>ABUWG</scope><scope>AFKRA</scope><scope>ARAPS</scope><scope>AZQEC</scope><scope>BENPR</scope><scope>BEZIV</scope><scope>BGLVJ</scope><scope>CCPQU</scope><scope>DWQXO</scope><scope>FRNLG</scope><scope>F~G</scope><scope>GNUQQ</scope><scope>HCIFZ</scope><scope>JQ2</scope><scope>K60</scope><scope>K6~</scope><scope>K7-</scope><scope>L.-</scope><scope>M0C</scope><scope>P5Z</scope><scope>P62</scope><scope>PQBIZ</scope><scope>PQBZA</scope><scope>PQEST</scope><scope>PQQKQ</scope><scope>PQUKI</scope><scope>PRINS</scope><scope>Q9U</scope></search><sort><creationdate>20130501</creationdate><title>SHELF SPACE OPTIMIZATION USINGMETAHEURISTIC ALGORITHMS</title><author>Bilsel, Murat ; Ayhan, M Batuhan ; Bulkan, Serol</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-proquest_journals_15114359333</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2013</creationdate><topic>Algorithms</topic><topic>Allocations</topic><topic>Competitive advantage</topic><topic>Genetic algorithms</topic><topic>Heuristic</topic><topic>Inventory</topic><topic>Knapsack problem</topic><topic>Mutation</topic><topic>Neighborhoods</topic><topic>Optimization</topic><topic>Population</topic><topic>Profit margins</topic><topic>Profit maximization</topic><topic>Profitability</topic><topic>Retail stores</topic><topic>Retailing industry</topic><topic>Studies</topic><toplevel>online_resources</toplevel><creatorcontrib>Bilsel, Murat</creatorcontrib><creatorcontrib>Ayhan, M Batuhan</creatorcontrib><creatorcontrib>Bulkan, Serol</creatorcontrib><collection>ProQuest Central (Corporate)</collection><collection>ABI/INFORM Collection</collection><collection>ABI/INFORM Global (PDF only)</collection><collection>ProQuest Central (purchase pre-March 2016)</collection><collection>ABI/INFORM Collection</collection><collection>ProQuest SciTech Collection</collection><collection>ProQuest Technology Collection</collection><collection>ProQuest Central (Alumni) (purchase pre-March 2016)</collection><collection>ABI/INFORM Collection (Alumni Edition)</collection><collection>ProQuest Central (Alumni)</collection><collection>ProQuest Central UK/Ireland</collection><collection>Advanced Technologies &amp; Aerospace Collection</collection><collection>ProQuest Central Essentials</collection><collection>AUTh Library subscriptions: ProQuest Central</collection><collection>Business Premium Collection</collection><collection>Technology Collection</collection><collection>ProQuest One Community College</collection><collection>ProQuest Central</collection><collection>Business Premium Collection (Alumni)</collection><collection>ABI/INFORM Global (Corporate)</collection><collection>ProQuest Central Student</collection><collection>SciTech Premium Collection (Proquest) (PQ_SDU_P3)</collection><collection>ProQuest Computer Science Collection</collection><collection>ProQuest Business Collection (Alumni Edition)</collection><collection>ProQuest Business Collection</collection><collection>Computer Science Database</collection><collection>ABI/INFORM Professional Advanced</collection><collection>ABI/INFORM Global (ProQuest)</collection><collection>ProQuest Advanced Technologies &amp; Aerospace Database</collection><collection>ProQuest Advanced Technologies &amp; Aerospace Collection</collection><collection>One Business (ProQuest)</collection><collection>ProQuest One Business (Alumni)</collection><collection>ProQuest One Academic Eastern Edition (DO NOT USE)</collection><collection>ProQuest One Academic</collection><collection>ProQuest One Academic UKI Edition</collection><collection>ProQuest Central China</collection><collection>ProQuest Central Basic</collection><jtitle>International journal of information, business and management</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Bilsel, Murat</au><au>Ayhan, M Batuhan</au><au>Bulkan, Serol</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>SHELF SPACE OPTIMIZATION USINGMETAHEURISTIC ALGORITHMS</atitle><jtitle>International journal of information, business and management</jtitle><date>2013-05-01</date><risdate>2013</risdate><volume>5</volume><issue>2</issue><spage>210</spage><pages>210-</pages><issn>2076-9202</issn><eissn>2218-046X</eissn><abstract>Efficient allocation of shelves in retail is essential to gain and maintain competitiveness. Shelf Space Allocation Problem (SSAP) is an extension of the knapsack problem; the objective is determination of the products and their locations on shelves to maximize expected profit. Various factors such as location within the store, product adjacencies and number of facings allocated for that particular product affect profitability of a product. Due to the size and complexity of the problem, metahuristic methods are preferred. This manuscript provides two metaheuristic solution algorithms to the model proposed by Ayhan et al. (2007), which is an extension of the model introduced by Yang (2001). This study has shown that for problems of various sizes both Tabu Search (TS) and Genetic Algorithm (GA) can provide better solutions than the greedy algorithm proposed by Ayhan et al. [PUBLICATION ABSTRACT]</abstract><cop>Chung-Li</cop><pub>Educational Research Multimedia &amp; Publications</pub></addata></record>
fulltext fulltext
identifier ISSN: 2076-9202
ispartof International journal of information, business and management, 2013-05, Vol.5 (2), p.210
issn 2076-9202
2218-046X
language eng
recordid cdi_proquest_journals_1511435933
source ABI/INFORM Global (ProQuest)
subjects Algorithms
Allocations
Competitive advantage
Genetic algorithms
Heuristic
Inventory
Knapsack problem
Mutation
Neighborhoods
Optimization
Population
Profit margins
Profit maximization
Profitability
Retail stores
Retailing industry
Studies
title SHELF SPACE OPTIMIZATION USINGMETAHEURISTIC ALGORITHMS
url http://sfxeu10.hosted.exlibrisgroup.com/loughborough?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-07T21%3A35%3A19IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=SHELF%20SPACE%20OPTIMIZATION%20USINGMETAHEURISTIC%20ALGORITHMS&rft.jtitle=International%20journal%20of%20information,%20business%20and%20management&rft.au=Bilsel,%20Murat&rft.date=2013-05-01&rft.volume=5&rft.issue=2&rft.spage=210&rft.pages=210-&rft.issn=2076-9202&rft.eissn=2218-046X&rft_id=info:doi/&rft_dat=%3Cproquest%3E3261000951%3C/proquest%3E%3Cgrp_id%3Ecdi_FETCH-proquest_journals_15114359333%3C/grp_id%3E%3Coa%3E%3C/oa%3E%3Curl%3E%3C/url%3E&rft_id=info:oai/&rft_pqid=1511435933&rft_id=info:pmid/&rfr_iscdi=true