Design of a Retail Chain Stocking Up Policy with a Hybrid Evolutionary Algorithm
In this paper we address the joint problem of minimising both the transport and inventory costs of a retail chain that is supplied from a central warehouse. We propose a hybrid evolutionary algorithm where the delivery patterns are evolved for each shop, while the delivery routes are obtained employ...
Gespeichert in:
| Hauptverfasser: | , , , , |
|---|---|
| Format: | Tagungsbericht |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | 60 |
|---|---|
| container_issue | |
| container_start_page | 49 |
| container_title | |
| container_volume | |
| creator | Esparcia-Alcázar, Anna I. Lluch-Revert, Lidia Cardós, Manuel Sharman, Ken Andrés-Romano, Carlos |
| description | In this paper we address the joint problem of minimising both the transport and inventory costs of a retail chain that is supplied from a central warehouse. We propose a hybrid evolutionary algorithm where the delivery patterns are evolved for each shop, while the delivery routes are obtained employing the multistart sweep algorithm. The experiments performed show that this method can obtain acceptable results consistently and within a reasonable timescale. The results are also of a lower cost than those obtained by other strategies employed in previous research. Furthermore, they confirm the interest of addressing the optimisation problem jointly, rather than minimising separately inventory and transport. |
| doi_str_mv | 10.1007/11730095_5 |
| format | Conference Proceeding |
| fullrecord | <record><control><sourceid>pascalfrancis_sprin</sourceid><recordid>TN_cdi_pascalfrancis_primary_19913897</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>19913897</sourcerecordid><originalsourceid>FETCH-LOGICAL-p218t-28ee318ba794536c043f91e002f53c7e9d6969d151103020a4ce8513f51887163</originalsourceid><addsrcrecordid>eNpFkE9PwkAQR9d_iYBc_AR7MfFSnel0u7tHgigmJBKVc7OUbVkpXdKtGr69JWg8zeG9TF5-jF0j3CGAvEeUBKBFJk5Yn0QCRCh1csp6mCJGRIk-Y0Mt1R9TcM56QBBHWiZ0yfohfABALHXcY_MHG1xZc19ww19ta1zFx2vjav7W-nzj6pIvdnzuK5fv-bdr15023S8bt-KTL199ts7XptnzUVX6psPbK3ZRmCrY4e8dsMXj5H08jWYvT8_j0SzaxajaKFbWEqql6dIFpTkkVGi0XVYhKJdWr1Kd6hUKxEM6mCS3SiAVApWSmNKA3Rz_7kzITVU0ps5dyHaN23Y9GWqNpLTsvNujFzpUl7bJlt5vQoaQHebM_uekH4LkX7k</addsrcrecordid><sourcetype>Index Database</sourcetype><iscdi>true</iscdi><recordtype>conference_proceeding</recordtype></control><display><type>conference_proceeding</type><title>Design of a Retail Chain Stocking Up Policy with a Hybrid Evolutionary Algorithm</title><source>Springer Books</source><creator>Esparcia-Alcázar, Anna I. ; Lluch-Revert, Lidia ; Cardós, Manuel ; Sharman, Ken ; Andrés-Romano, Carlos</creator><contributor>Raidl, Günther R. ; Gottlieb, Jens</contributor><creatorcontrib>Esparcia-Alcázar, Anna I. ; Lluch-Revert, Lidia ; Cardós, Manuel ; Sharman, Ken ; Andrés-Romano, Carlos ; Raidl, Günther R. ; Gottlieb, Jens</creatorcontrib><description>In this paper we address the joint problem of minimising both the transport and inventory costs of a retail chain that is supplied from a central warehouse. We propose a hybrid evolutionary algorithm where the delivery patterns are evolved for each shop, while the delivery routes are obtained employing the multistart sweep algorithm. The experiments performed show that this method can obtain acceptable results consistently and within a reasonable timescale. The results are also of a lower cost than those obtained by other strategies employed in previous research. Furthermore, they confirm the interest of addressing the optimisation problem jointly, rather than minimising separately inventory and transport.</description><identifier>ISSN: 0302-9743</identifier><identifier>ISBN: 9783540331780</identifier><identifier>ISBN: 3540331786</identifier><identifier>EISSN: 1611-3349</identifier><identifier>EISBN: 3540331794</identifier><identifier>EISBN: 9783540331797</identifier><identifier>DOI: 10.1007/11730095_5</identifier><language>eng</language><publisher>Berlin, Heidelberg: Springer Berlin Heidelberg</publisher><subject>Applied sciences ; Exact sciences and technology ; Flows in networks. Combinatorial problems ; Inventory Cost ; Operational research and scientific management ; Operational research. Management science ; Retail Chain ; Transportation Cost ; Travel Salesman Problem ; Vehicle Rout Problem</subject><ispartof>Evolutionary Computation in Combinatorial Optimization, 2006, p.49-60</ispartof><rights>Springer-Verlag Berlin Heidelberg 2006</rights><rights>2008 INIST-CNRS</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktopdf>$$Uhttps://link.springer.com/content/pdf/10.1007/11730095_5$$EPDF$$P50$$Gspringer$$H</linktopdf><linktohtml>$$Uhttps://link.springer.com/10.1007/11730095_5$$EHTML$$P50$$Gspringer$$H</linktohtml><link.rule.ids>309,310,775,776,780,785,786,789,4036,4037,27904,38234,41421,42490</link.rule.ids><backlink>$$Uhttp://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=19913897$$DView record in Pascal Francis$$Hfree_for_read</backlink></links><search><contributor>Raidl, Günther R.</contributor><contributor>Gottlieb, Jens</contributor><creatorcontrib>Esparcia-Alcázar, Anna I.</creatorcontrib><creatorcontrib>Lluch-Revert, Lidia</creatorcontrib><creatorcontrib>Cardós, Manuel</creatorcontrib><creatorcontrib>Sharman, Ken</creatorcontrib><creatorcontrib>Andrés-Romano, Carlos</creatorcontrib><title>Design of a Retail Chain Stocking Up Policy with a Hybrid Evolutionary Algorithm</title><title>Evolutionary Computation in Combinatorial Optimization</title><description>In this paper we address the joint problem of minimising both the transport and inventory costs of a retail chain that is supplied from a central warehouse. We propose a hybrid evolutionary algorithm where the delivery patterns are evolved for each shop, while the delivery routes are obtained employing the multistart sweep algorithm. The experiments performed show that this method can obtain acceptable results consistently and within a reasonable timescale. The results are also of a lower cost than those obtained by other strategies employed in previous research. Furthermore, they confirm the interest of addressing the optimisation problem jointly, rather than minimising separately inventory and transport.</description><subject>Applied sciences</subject><subject>Exact sciences and technology</subject><subject>Flows in networks. Combinatorial problems</subject><subject>Inventory Cost</subject><subject>Operational research and scientific management</subject><subject>Operational research. Management science</subject><subject>Retail Chain</subject><subject>Transportation Cost</subject><subject>Travel Salesman Problem</subject><subject>Vehicle Rout Problem</subject><issn>0302-9743</issn><issn>1611-3349</issn><isbn>9783540331780</isbn><isbn>3540331786</isbn><isbn>3540331794</isbn><isbn>9783540331797</isbn><fulltext>true</fulltext><rsrctype>conference_proceeding</rsrctype><creationdate>2006</creationdate><recordtype>conference_proceeding</recordtype><recordid>eNpFkE9PwkAQR9d_iYBc_AR7MfFSnel0u7tHgigmJBKVc7OUbVkpXdKtGr69JWg8zeG9TF5-jF0j3CGAvEeUBKBFJk5Yn0QCRCh1csp6mCJGRIk-Y0Mt1R9TcM56QBBHWiZ0yfohfABALHXcY_MHG1xZc19ww19ta1zFx2vjav7W-nzj6pIvdnzuK5fv-bdr15023S8bt-KTL199ts7XptnzUVX6psPbK3ZRmCrY4e8dsMXj5H08jWYvT8_j0SzaxajaKFbWEqql6dIFpTkkVGi0XVYhKJdWr1Kd6hUKxEM6mCS3SiAVApWSmNKA3Rz_7kzITVU0ps5dyHaN23Y9GWqNpLTsvNujFzpUl7bJlt5vQoaQHebM_uekH4LkX7k</recordid><startdate>2006</startdate><enddate>2006</enddate><creator>Esparcia-Alcázar, Anna I.</creator><creator>Lluch-Revert, Lidia</creator><creator>Cardós, Manuel</creator><creator>Sharman, Ken</creator><creator>Andrés-Romano, Carlos</creator><general>Springer Berlin Heidelberg</general><general>Springer</general><scope>IQODW</scope></search><sort><creationdate>2006</creationdate><title>Design of a Retail Chain Stocking Up Policy with a Hybrid Evolutionary Algorithm</title><author>Esparcia-Alcázar, Anna I. ; Lluch-Revert, Lidia ; Cardós, Manuel ; Sharman, Ken ; Andrés-Romano, Carlos</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-p218t-28ee318ba794536c043f91e002f53c7e9d6969d151103020a4ce8513f51887163</frbrgroupid><rsrctype>conference_proceedings</rsrctype><prefilter>conference_proceedings</prefilter><language>eng</language><creationdate>2006</creationdate><topic>Applied sciences</topic><topic>Exact sciences and technology</topic><topic>Flows in networks. Combinatorial problems</topic><topic>Inventory Cost</topic><topic>Operational research and scientific management</topic><topic>Operational research. Management science</topic><topic>Retail Chain</topic><topic>Transportation Cost</topic><topic>Travel Salesman Problem</topic><topic>Vehicle Rout Problem</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Esparcia-Alcázar, Anna I.</creatorcontrib><creatorcontrib>Lluch-Revert, Lidia</creatorcontrib><creatorcontrib>Cardós, Manuel</creatorcontrib><creatorcontrib>Sharman, Ken</creatorcontrib><creatorcontrib>Andrés-Romano, Carlos</creatorcontrib><collection>Pascal-Francis</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Esparcia-Alcázar, Anna I.</au><au>Lluch-Revert, Lidia</au><au>Cardós, Manuel</au><au>Sharman, Ken</au><au>Andrés-Romano, Carlos</au><au>Raidl, Günther R.</au><au>Gottlieb, Jens</au><format>book</format><genre>proceeding</genre><ristype>CONF</ristype><atitle>Design of a Retail Chain Stocking Up Policy with a Hybrid Evolutionary Algorithm</atitle><btitle>Evolutionary Computation in Combinatorial Optimization</btitle><date>2006</date><risdate>2006</risdate><spage>49</spage><epage>60</epage><pages>49-60</pages><issn>0302-9743</issn><eissn>1611-3349</eissn><isbn>9783540331780</isbn><isbn>3540331786</isbn><eisbn>3540331794</eisbn><eisbn>9783540331797</eisbn><abstract>In this paper we address the joint problem of minimising both the transport and inventory costs of a retail chain that is supplied from a central warehouse. We propose a hybrid evolutionary algorithm where the delivery patterns are evolved for each shop, while the delivery routes are obtained employing the multistart sweep algorithm. The experiments performed show that this method can obtain acceptable results consistently and within a reasonable timescale. The results are also of a lower cost than those obtained by other strategies employed in previous research. Furthermore, they confirm the interest of addressing the optimisation problem jointly, rather than minimising separately inventory and transport.</abstract><cop>Berlin, Heidelberg</cop><pub>Springer Berlin Heidelberg</pub><doi>10.1007/11730095_5</doi><tpages>12</tpages></addata></record> |
| fulltext | fulltext |
| identifier | ISSN: 0302-9743 |
| ispartof | Evolutionary Computation in Combinatorial Optimization, 2006, p.49-60 |
| issn | 0302-9743 1611-3349 |
| language | eng |
| recordid | cdi_pascalfrancis_primary_19913897 |
| source | Springer Books |
| subjects | Applied sciences Exact sciences and technology Flows in networks. Combinatorial problems Inventory Cost Operational research and scientific management Operational research. Management science Retail Chain Transportation Cost Travel Salesman Problem Vehicle Rout Problem |
| title | Design of a Retail Chain Stocking Up Policy with a Hybrid Evolutionary Algorithm |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-27T23%3A23%3A53IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-pascalfrancis_sprin&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=proceeding&rft.atitle=Design%20of%20a%20Retail%20Chain%20Stocking%20Up%20Policy%20with%20a%20Hybrid%20Evolutionary%20Algorithm&rft.btitle=Evolutionary%20Computation%20in%20Combinatorial%20Optimization&rft.au=Esparcia-Alc%C3%A1zar,%20Anna%20I.&rft.date=2006&rft.spage=49&rft.epage=60&rft.pages=49-60&rft.issn=0302-9743&rft.eissn=1611-3349&rft.isbn=9783540331780&rft.isbn_list=3540331786&rft_id=info:doi/10.1007/11730095_5&rft_dat=%3Cpascalfrancis_sprin%3E19913897%3C/pascalfrancis_sprin%3E%3Curl%3E%3C/url%3E&rft.eisbn=3540331794&rft.eisbn_list=9783540331797&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true |