Solving a rich vehicle routing and inventory problem using column generation
The livestock collection problem (LCP) is a rich vehicle routing problem (VRP) extended with inventory constraints. The LCP is a complex planning problem taken from the meat industry, and the goal is to construct a set of vehicle routes to collect animals from farms for slaughter at a slaughterhouse...
Gespeichert in:
| Veröffentlicht in: | Computers & operations research 2010-07, Vol.37 (7), p.1308-1317 |
|---|---|
| Hauptverfasser: | , , |
| Format: | Artikel |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | 1317 |
|---|---|
| container_issue | 7 |
| container_start_page | 1308 |
| container_title | Computers & operations research |
| container_volume | 37 |
| creator | Oppen, Johan Løkketangen, Arne Desrosiers, Jacques |
| description | The livestock collection problem (LCP) is a rich vehicle routing problem (VRP) extended with inventory constraints. The LCP is a complex planning problem taken from the meat industry, and the goal is to construct a set of vehicle routes to collect animals from farms for slaughter at a slaughterhouse. Several constraints dealing with animal welfare are added, some of these lead to a loading problem where the vehicle capacity depends on the loading sequence. In addition, global constraints to handle production and inventory at the slaughterhouse are needed. This paper presents an exact solution method for the LCP, based on column generation, that solves much larger instances to optimality than what has been done before. The algorithm presented here also solves a richer model that is closer to the underlying real-world problem than previously published work on exact methods for this problem is based on. |
| doi_str_mv | 10.1016/j.cor.2009.09.014 |
| format | Article |
| fullrecord | <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_journals_195837022</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><els_id>S0305054809002329</els_id><sourcerecordid>1914001591</sourcerecordid><originalsourceid>FETCH-LOGICAL-c385t-58f8b6735dd874a5f897c10a30668e36b27b48b1996437d51042ab6897a98783</originalsourceid><addsrcrecordid>eNp9kEtLxDAQx4MouK5-AG9F8NiaR_MonmTxBQse3IO3kKbpbko3WZN2Yb-9qbt4dBgYmPnN6w_ALYIFgog9dIX2ocAQVsXkqDwDMyQ4yTmjX-dgBgmkOaSluARXMXYwGcdoBpafvt9bt85UFqzeZHuzsbo3WfDj8Jt2TWbd3rjBh0O2C77uzTYb41TTvh-3LlsbZ4IarHfX4KJVfTQ3pzgHq5fn1eItX368vi-elrkmgg45Fa2oGSe0aQQvFW1FxTWCikDGhCGsxrwuRY2qipWENxTBEquaJUpVggsyB3fHsemc79HEQXZ-DC5tlKiignCIcYLQEdLBxxhMK3fBblU4SATlJJnsZJJMTpLJyVGZeu5Pg1XUqm-DctrGv0aMS4oJqhL3eORMenJvTZBRW-O0aWwwepCNt_9s-QEUDYAV</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>195837022</pqid></control><display><type>article</type><title>Solving a rich vehicle routing and inventory problem using column generation</title><source>Elsevier ScienceDirect Journals</source><creator>Oppen, Johan ; Løkketangen, Arne ; Desrosiers, Jacques</creator><creatorcontrib>Oppen, Johan ; Løkketangen, Arne ; Desrosiers, Jacques</creatorcontrib><description>The livestock collection problem (LCP) is a rich vehicle routing problem (VRP) extended with inventory constraints. The LCP is a complex planning problem taken from the meat industry, and the goal is to construct a set of vehicle routes to collect animals from farms for slaughter at a slaughterhouse. Several constraints dealing with animal welfare are added, some of these lead to a loading problem where the vehicle capacity depends on the loading sequence. In addition, global constraints to handle production and inventory at the slaughterhouse are needed. This paper presents an exact solution method for the LCP, based on column generation, that solves much larger instances to optimality than what has been done before. The algorithm presented here also solves a richer model that is closer to the underlying real-world problem than previously published work on exact methods for this problem is based on.</description><identifier>ISSN: 0305-0548</identifier><identifier>EISSN: 1873-765X</identifier><identifier>EISSN: 0305-0548</identifier><identifier>DOI: 10.1016/j.cor.2009.09.014</identifier><identifier>CODEN: CMORAP</identifier><language>eng</language><publisher>Kidlington: Elsevier Ltd</publisher><subject>Algorithms ; Applied sciences ; Column generation ; Exact sciences and technology ; Flows in networks. Combinatorial problems ; Inventory control, production control. Distribution ; Inventory management ; Logistics ; Meat industry ; Operational research and scientific management ; Operational research. Management science ; Operations research ; Rich VRP ; Routing ; Studies ; Vehicle routing and inventory problem ; VRP with inventory constraints</subject><ispartof>Computers & operations research, 2010-07, Vol.37 (7), p.1308-1317</ispartof><rights>2009 Elsevier Ltd</rights><rights>2015 INIST-CNRS</rights><rights>Copyright Pergamon Press Inc. Jul 2010</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c385t-58f8b6735dd874a5f897c10a30668e36b27b48b1996437d51042ab6897a98783</citedby><cites>FETCH-LOGICAL-c385t-58f8b6735dd874a5f897c10a30668e36b27b48b1996437d51042ab6897a98783</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://www.sciencedirect.com/science/article/pii/S0305054809002329$$EHTML$$P50$$Gelsevier$$H</linktohtml><link.rule.ids>314,776,780,3537,27901,27902,65306</link.rule.ids><backlink>$$Uhttp://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=22452319$$DView record in Pascal Francis$$Hfree_for_read</backlink></links><search><creatorcontrib>Oppen, Johan</creatorcontrib><creatorcontrib>Løkketangen, Arne</creatorcontrib><creatorcontrib>Desrosiers, Jacques</creatorcontrib><title>Solving a rich vehicle routing and inventory problem using column generation</title><title>Computers & operations research</title><description>The livestock collection problem (LCP) is a rich vehicle routing problem (VRP) extended with inventory constraints. The LCP is a complex planning problem taken from the meat industry, and the goal is to construct a set of vehicle routes to collect animals from farms for slaughter at a slaughterhouse. Several constraints dealing with animal welfare are added, some of these lead to a loading problem where the vehicle capacity depends on the loading sequence. In addition, global constraints to handle production and inventory at the slaughterhouse are needed. This paper presents an exact solution method for the LCP, based on column generation, that solves much larger instances to optimality than what has been done before. The algorithm presented here also solves a richer model that is closer to the underlying real-world problem than previously published work on exact methods for this problem is based on.</description><subject>Algorithms</subject><subject>Applied sciences</subject><subject>Column generation</subject><subject>Exact sciences and technology</subject><subject>Flows in networks. Combinatorial problems</subject><subject>Inventory control, production control. Distribution</subject><subject>Inventory management</subject><subject>Logistics</subject><subject>Meat industry</subject><subject>Operational research and scientific management</subject><subject>Operational research. Management science</subject><subject>Operations research</subject><subject>Rich VRP</subject><subject>Routing</subject><subject>Studies</subject><subject>Vehicle routing and inventory problem</subject><subject>VRP with inventory constraints</subject><issn>0305-0548</issn><issn>1873-765X</issn><issn>0305-0548</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2010</creationdate><recordtype>article</recordtype><recordid>eNp9kEtLxDAQx4MouK5-AG9F8NiaR_MonmTxBQse3IO3kKbpbko3WZN2Yb-9qbt4dBgYmPnN6w_ALYIFgog9dIX2ocAQVsXkqDwDMyQ4yTmjX-dgBgmkOaSluARXMXYwGcdoBpafvt9bt85UFqzeZHuzsbo3WfDj8Jt2TWbd3rjBh0O2C77uzTYb41TTvh-3LlsbZ4IarHfX4KJVfTQ3pzgHq5fn1eItX368vi-elrkmgg45Fa2oGSe0aQQvFW1FxTWCikDGhCGsxrwuRY2qipWENxTBEquaJUpVggsyB3fHsemc79HEQXZ-DC5tlKiignCIcYLQEdLBxxhMK3fBblU4SATlJJnsZJJMTpLJyVGZeu5Pg1XUqm-DctrGv0aMS4oJqhL3eORMenJvTZBRW-O0aWwwepCNt_9s-QEUDYAV</recordid><startdate>20100701</startdate><enddate>20100701</enddate><creator>Oppen, Johan</creator><creator>Løkketangen, Arne</creator><creator>Desrosiers, Jacques</creator><general>Elsevier Ltd</general><general>Elsevier</general><general>Pergamon Press Inc</general><scope>IQODW</scope><scope>AAYXX</scope><scope>CITATION</scope><scope>7SC</scope><scope>8FD</scope><scope>JQ2</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope></search><sort><creationdate>20100701</creationdate><title>Solving a rich vehicle routing and inventory problem using column generation</title><author>Oppen, Johan ; Løkketangen, Arne ; Desrosiers, Jacques</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c385t-58f8b6735dd874a5f897c10a30668e36b27b48b1996437d51042ab6897a98783</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2010</creationdate><topic>Algorithms</topic><topic>Applied sciences</topic><topic>Column generation</topic><topic>Exact sciences and technology</topic><topic>Flows in networks. Combinatorial problems</topic><topic>Inventory control, production control. Distribution</topic><topic>Inventory management</topic><topic>Logistics</topic><topic>Meat industry</topic><topic>Operational research and scientific management</topic><topic>Operational research. Management science</topic><topic>Operations research</topic><topic>Rich VRP</topic><topic>Routing</topic><topic>Studies</topic><topic>Vehicle routing and inventory problem</topic><topic>VRP with inventory constraints</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Oppen, Johan</creatorcontrib><creatorcontrib>Løkketangen, Arne</creatorcontrib><creatorcontrib>Desrosiers, Jacques</creatorcontrib><collection>Pascal-Francis</collection><collection>CrossRef</collection><collection>Computer and Information Systems Abstracts</collection><collection>Technology 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>Computers & operations research</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Oppen, Johan</au><au>Løkketangen, Arne</au><au>Desrosiers, Jacques</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Solving a rich vehicle routing and inventory problem using column generation</atitle><jtitle>Computers & operations research</jtitle><date>2010-07-01</date><risdate>2010</risdate><volume>37</volume><issue>7</issue><spage>1308</spage><epage>1317</epage><pages>1308-1317</pages><issn>0305-0548</issn><eissn>1873-765X</eissn><eissn>0305-0548</eissn><coden>CMORAP</coden><abstract>The livestock collection problem (LCP) is a rich vehicle routing problem (VRP) extended with inventory constraints. The LCP is a complex planning problem taken from the meat industry, and the goal is to construct a set of vehicle routes to collect animals from farms for slaughter at a slaughterhouse. Several constraints dealing with animal welfare are added, some of these lead to a loading problem where the vehicle capacity depends on the loading sequence. In addition, global constraints to handle production and inventory at the slaughterhouse are needed. This paper presents an exact solution method for the LCP, based on column generation, that solves much larger instances to optimality than what has been done before. The algorithm presented here also solves a richer model that is closer to the underlying real-world problem than previously published work on exact methods for this problem is based on.</abstract><cop>Kidlington</cop><pub>Elsevier Ltd</pub><doi>10.1016/j.cor.2009.09.014</doi><tpages>10</tpages></addata></record> |
| fulltext | fulltext |
| identifier | ISSN: 0305-0548 |
| ispartof | Computers & operations research, 2010-07, Vol.37 (7), p.1308-1317 |
| issn | 0305-0548 1873-765X 0305-0548 |
| language | eng |
| recordid | cdi_proquest_journals_195837022 |
| source | Elsevier ScienceDirect Journals |
| subjects | Algorithms Applied sciences Column generation Exact sciences and technology Flows in networks. Combinatorial problems Inventory control, production control. Distribution Inventory management Logistics Meat industry Operational research and scientific management Operational research. Management science Operations research Rich VRP Routing Studies Vehicle routing and inventory problem VRP with inventory constraints |
| title | Solving a rich vehicle routing and inventory problem using column generation |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-02-06T04%3A04%3A30IST&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=Solving%20a%20rich%20vehicle%20routing%20and%20inventory%20problem%20using%20column%20generation&rft.jtitle=Computers%20&%20operations%20research&rft.au=Oppen,%20Johan&rft.date=2010-07-01&rft.volume=37&rft.issue=7&rft.spage=1308&rft.epage=1317&rft.pages=1308-1317&rft.issn=0305-0548&rft.eissn=1873-765X&rft.coden=CMORAP&rft_id=info:doi/10.1016/j.cor.2009.09.014&rft_dat=%3Cproquest_cross%3E1914001591%3C/proquest_cross%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=195837022&rft_id=info:pmid/&rft_els_id=S0305054809002329&rfr_iscdi=true |