A branch and bound algorithm for class based storage location assignment

Class-based storage implementation decisions have significant impact on the required storage space and the material handling cost in a warehouse. In this paper, a nonlinear integer programming model is proposed to capture the above. Effects of storage area reduction on order picking and storage spac...

Full description

Saved in:
Bibliographic Details
Published in:European journal of operational research 2008-09, Vol.189 (2), p.492-507
Main Authors: Muppani (Muppant), Venkata Reddy, Adil, Gajendra Kumar
Format: Article
Language:English
Subjects:
Algorithms
Applied sciences
Branch & bound algorithms
Branch and bound
Class based storage
Cost reduction
Exact sciences and technology
Firm modelling
Integer programming
Operational research and scientific management
Operational research. Management science
Order picking
Storage
Storage space
Studies
Warehouse storage planning
Warehouses
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
cited_by cdi_FETCH-LOGICAL-c479t-108b4fd0629e17b64d68a21a682fa7e43fca5edd84dbf64c382fd1a105a55b953
cites cdi_FETCH-LOGICAL-c479t-108b4fd0629e17b64d68a21a682fa7e43fca5edd84dbf64c382fd1a105a55b953
container_end_page 507
container_issue 2
container_start_page 492
container_title European journal of operational research
container_volume 189
creator Muppani (Muppant), Venkata Reddy
Adil, Gajendra Kumar
description Class-based storage implementation decisions have significant impact on the required storage space and the material handling cost in a warehouse. In this paper, a nonlinear integer programming model is proposed to capture the above. Effects of storage area reduction on order picking and storage space cost are incorporated. A branch and bound algorithm is developed to solve the model. Computational experience with randomly generated data sets and an industrial case shows that branch and bound algorithm is computationally more efficient than a baseline dynamic programming algorithm. It is further observed that the class based policy results in lower total cost of order picking and storage space than the dedicated policy.
doi_str_mv 10.1016/j.ejor.2007.05.050
format article
fullrecord <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_journals_204142506</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><els_id>S0377221707005152</els_id><sourcerecordid>1440904091</sourcerecordid><originalsourceid>FETCH-LOGICAL-c479t-108b4fd0629e17b64d68a21a682fa7e43fca5edd84dbf64c382fd1a105a55b953</originalsourceid><addsrcrecordid>eNp9UE1r3DAQFaWBbtP-gZ5MoUdvR7I-bOglhCYpCeTSnoUsjXdlvNZW8gby7zNmQ44R8yGk994Mj7FvHLYcuP45bnFMeSsAzBYUBXxgG94aUetWw0e2gcaYWghuPrHPpYwAwBVXG3Z3VfXZzX5fuTlUfTpRddMu5bjsD9WQcuUnV0rVu4KhKkvKbofVlLxbYpor-oq7-YDz8oVdDG4q-PW1X7J_N7__Xt_VD4-3f66vHmovTbfUHNpeDgG06JCbXsugWye4060YnEHZDN4pDKGVoR-09A29B-44KKdU36nmkn0_6x5z-n_CstgxnfJMI60AyaVQoAkkziCfUykZB3vM8eDys-VgV8PsaFfD7GqYBUUBRLo_kzIe0b8xkA5Bsdgn2zjedlSfKYnaUovrlfJIKTthFQnulwOp_Xjd0xXvpmE1OZY3VQHr6MYQ7tcZh2TaU8Rsi484ewwxo19sSPG9pV8AiwuaKw</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>204142506</pqid></control><display><type>article</type><title>A branch and bound algorithm for class based storage location assignment</title><source>ScienceDirect Freedom Collection</source><creator>Muppani (Muppant), Venkata Reddy ; Adil, Gajendra Kumar</creator><creatorcontrib>Muppani (Muppant), Venkata Reddy ; Adil, Gajendra Kumar</creatorcontrib><description>Class-based storage implementation decisions have significant impact on the required storage space and the material handling cost in a warehouse. In this paper, a nonlinear integer programming model is proposed to capture the above. Effects of storage area reduction on order picking and storage space cost are incorporated. A branch and bound algorithm is developed to solve the model. Computational experience with randomly generated data sets and an industrial case shows that branch and bound algorithm is computationally more efficient than a baseline dynamic programming algorithm. It is further observed that the class based policy results in lower total cost of order picking and storage space than the dedicated policy.</description><identifier>ISSN: 0377-2217</identifier><identifier>EISSN: 1872-6860</identifier><identifier>DOI: 10.1016/j.ejor.2007.05.050</identifier><identifier>CODEN: EJORDT</identifier><language>eng</language><publisher>Amsterdam: Elsevier B.V</publisher><subject>Algorithms ; Applied sciences ; Branch &amp; bound algorithms ; Branch and bound ; Class based storage ; Cost reduction ; Exact sciences and technology ; Firm modelling ; Integer programming ; Operational research and scientific management ; Operational research. Management science ; Order picking ; Storage ; Storage space ; Studies ; Warehouse storage planning ; Warehouses</subject><ispartof>European journal of operational research, 2008-09, Vol.189 (2), p.492-507</ispartof><rights>2007 Elsevier B.V.</rights><rights>2008 INIST-CNRS</rights><rights>Copyright Elsevier Sequoia S.A. Sep 1, 2008</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c479t-108b4fd0629e17b64d68a21a682fa7e43fca5edd84dbf64c382fd1a105a55b953</citedby><cites>FETCH-LOGICAL-c479t-108b4fd0629e17b64d68a21a682fa7e43fca5edd84dbf64c382fd1a105a55b953</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>314,776,780,27901,27902</link.rule.ids><backlink>$$Uhttp://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&amp;idt=20200737$$DView record in Pascal Francis$$Hfree_for_read</backlink><backlink>$$Uhttp://econpapers.repec.org/article/eeeejores/v_3a189_3ay_3a2008_3ai_3a2_3ap_3a492-507.htm$$DView record in RePEc$$Hfree_for_read</backlink></links><search><creatorcontrib>Muppani (Muppant), Venkata Reddy</creatorcontrib><creatorcontrib>Adil, Gajendra Kumar</creatorcontrib><title>A branch and bound algorithm for class based storage location assignment</title><title>European journal of operational research</title><description>Class-based storage implementation decisions have significant impact on the required storage space and the material handling cost in a warehouse. In this paper, a nonlinear integer programming model is proposed to capture the above. Effects of storage area reduction on order picking and storage space cost are incorporated. A branch and bound algorithm is developed to solve the model. Computational experience with randomly generated data sets and an industrial case shows that branch and bound algorithm is computationally more efficient than a baseline dynamic programming algorithm. It is further observed that the class based policy results in lower total cost of order picking and storage space than the dedicated policy.</description><subject>Algorithms</subject><subject>Applied sciences</subject><subject>Branch &amp; bound algorithms</subject><subject>Branch and bound</subject><subject>Class based storage</subject><subject>Cost reduction</subject><subject>Exact sciences and technology</subject><subject>Firm modelling</subject><subject>Integer programming</subject><subject>Operational research and scientific management</subject><subject>Operational research. Management science</subject><subject>Order picking</subject><subject>Storage</subject><subject>Storage space</subject><subject>Studies</subject><subject>Warehouse storage planning</subject><subject>Warehouses</subject><issn>0377-2217</issn><issn>1872-6860</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2008</creationdate><recordtype>article</recordtype><recordid>eNp9UE1r3DAQFaWBbtP-gZ5MoUdvR7I-bOglhCYpCeTSnoUsjXdlvNZW8gby7zNmQ44R8yGk994Mj7FvHLYcuP45bnFMeSsAzBYUBXxgG94aUetWw0e2gcaYWghuPrHPpYwAwBVXG3Z3VfXZzX5fuTlUfTpRddMu5bjsD9WQcuUnV0rVu4KhKkvKbofVlLxbYpor-oq7-YDz8oVdDG4q-PW1X7J_N7__Xt_VD4-3f66vHmovTbfUHNpeDgG06JCbXsugWye4060YnEHZDN4pDKGVoR-09A29B-44KKdU36nmkn0_6x5z-n_CstgxnfJMI60AyaVQoAkkziCfUykZB3vM8eDys-VgV8PsaFfD7GqYBUUBRLo_kzIe0b8xkA5Bsdgn2zjedlSfKYnaUovrlfJIKTthFQnulwOp_Xjd0xXvpmE1OZY3VQHr6MYQ7tcZh2TaU8Rsi484ewwxo19sSPG9pV8AiwuaKw</recordid><startdate>20080901</startdate><enddate>20080901</enddate><creator>Muppani (Muppant), Venkata Reddy</creator><creator>Adil, Gajendra Kumar</creator><general>Elsevier B.V</general><general>Elsevier</general><general>Elsevier Sequoia S.A</general><scope>IQODW</scope><scope>DKI</scope><scope>X2L</scope><scope>AAYXX</scope><scope>CITATION</scope><scope>7SC</scope><scope>7TB</scope><scope>8FD</scope><scope>FR3</scope><scope>JQ2</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope></search><sort><creationdate>20080901</creationdate><title>A branch and bound algorithm for class based storage location assignment</title><author>Muppani (Muppant), Venkata Reddy ; Adil, Gajendra Kumar</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c479t-108b4fd0629e17b64d68a21a682fa7e43fca5edd84dbf64c382fd1a105a55b953</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2008</creationdate><topic>Algorithms</topic><topic>Applied sciences</topic><topic>Branch &amp; bound algorithms</topic><topic>Branch and bound</topic><topic>Class based storage</topic><topic>Cost reduction</topic><topic>Exact sciences and technology</topic><topic>Firm modelling</topic><topic>Integer programming</topic><topic>Operational research and scientific management</topic><topic>Operational research. Management science</topic><topic>Order picking</topic><topic>Storage</topic><topic>Storage space</topic><topic>Studies</topic><topic>Warehouse storage planning</topic><topic>Warehouses</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Muppani (Muppant), Venkata Reddy</creatorcontrib><creatorcontrib>Adil, Gajendra Kumar</creatorcontrib><collection>Pascal-Francis</collection><collection>RePEc IDEAS</collection><collection>RePEc</collection><collection>CrossRef</collection><collection>Computer and Information Systems Abstracts</collection><collection>Mechanical &amp; Transportation Engineering Abstracts</collection><collection>Technology Research Database</collection><collection>Engineering Research Database</collection><collection>ProQuest Computer Science Collection</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>Computer and Information Systems Abstracts – Academic</collection><collection>Computer and Information Systems Abstracts Professional</collection><jtitle>European journal of operational research</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Muppani (Muppant), Venkata Reddy</au><au>Adil, Gajendra Kumar</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>A branch and bound algorithm for class based storage location assignment</atitle><jtitle>European journal of operational research</jtitle><date>2008-09-01</date><risdate>2008</risdate><volume>189</volume><issue>2</issue><spage>492</spage><epage>507</epage><pages>492-507</pages><issn>0377-2217</issn><eissn>1872-6860</eissn><coden>EJORDT</coden><abstract>Class-based storage implementation decisions have significant impact on the required storage space and the material handling cost in a warehouse. In this paper, a nonlinear integer programming model is proposed to capture the above. Effects of storage area reduction on order picking and storage space cost are incorporated. A branch and bound algorithm is developed to solve the model. Computational experience with randomly generated data sets and an industrial case shows that branch and bound algorithm is computationally more efficient than a baseline dynamic programming algorithm. It is further observed that the class based policy results in lower total cost of order picking and storage space than the dedicated policy.</abstract><cop>Amsterdam</cop><pub>Elsevier B.V</pub><doi>10.1016/j.ejor.2007.05.050</doi><tpages>16</tpages></addata></record>
fulltext fulltext
identifier ISSN: 0377-2217
ispartof European journal of operational research, 2008-09, Vol.189 (2), p.492-507
issn 0377-2217
1872-6860
language eng
recordid cdi_proquest_journals_204142506
source ScienceDirect Freedom Collection
subjects Algorithms
Applied sciences
Branch & bound algorithms
Branch and bound
Class based storage
Cost reduction
Exact sciences and technology
Firm modelling
Integer programming
Operational research and scientific management
Operational research. Management science
Order picking
Storage
Storage space
Studies
Warehouse storage planning
Warehouses
title A branch and bound algorithm for class based storage location assignment
url http://sfxeu10.hosted.exlibrisgroup.com/loughborough?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-02-15T17%3A59%3A57IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_cross&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=A%20branch%20and%20bound%20algorithm%20for%20class%20based%20storage%20location%20assignment&rft.jtitle=European%20journal%20of%20operational%20research&rft.au=Muppani%20(Muppant),%20Venkata%20Reddy&rft.date=2008-09-01&rft.volume=189&rft.issue=2&rft.spage=492&rft.epage=507&rft.pages=492-507&rft.issn=0377-2217&rft.eissn=1872-6860&rft.coden=EJORDT&rft_id=info:doi/10.1016/j.ejor.2007.05.050&rft_dat=%3Cproquest_cross%3E1440904091%3C/proquest_cross%3E%3Cgrp_id%3Ecdi_FETCH-LOGICAL-c479t-108b4fd0629e17b64d68a21a682fa7e43fca5edd84dbf64c382fd1a105a55b953%3C/grp_id%3E%3Coa%3E%3C/oa%3E%3Curl%3E%3C/url%3E&rft_id=info:oai/&rft_pqid=204142506&rft_id=info:pmid/&rfr_iscdi=true