A column generation-based algorithm for solving combined inventory and routing problems
This paper presents a column generation algorithm for solving combined vehicle and inventory problems. This problem is based on the idea of coordinating customer inventory levels through a minimum routing cost. This is a combinatory decision problem since vehicle routing and inventory problems, are...
Saved in:
| Published in | Ingeniare. Revista chilena de ingeniería Vol. 24; no. 2; pp. 305 - 313 |
|---|---|
| Main Authors | , |
| Format | Journal Article |
| Language | English |
| Published |
Universidad de Tarapacá
01.04.2016
|
| Subjects | |
| Online Access | Get full text |
| ISSN | 0718-3305 0718-3291 0718-3305 |
| DOI | 10.4067/S0718-33052016000200012 |
Cover
| Abstract | This paper presents a column generation algorithm for solving combined vehicle and inventory problems. This problem is based on the idea of coordinating customer inventory levels through a minimum routing cost. This is a combinatory decision problem since vehicle routing and inventory problems, are combined. Using the column generation method, we can iteratively generate interesting routes to the system, based on their dual costs, this is routes that will improve the quality of the objective function because its reduced costs are negatives. The initial mixed integer problem has to be relaxed for getting its reduced costs. The sub problem is defined as the shortest path problem that returns a set of desirable routes. Finally, when the set of desirable routes is obtained, the mixed integer model should select a set of routes that fulfill both minimum shipping costs and the constraints of the system. |
|---|---|
| AbstractList | This paper presents a column generation algorithm for solving combined vehicle and inventory problems. This problem is based on the idea of coordinating customer inventory levels through a minimum routing cost. This is a combinatory decision problem since vehicle routing and inventory problems, are combined. Using the column generation method, we can iteratively generate interesting routes to the system, based on their dual costs, this is routes that will improve the quality of the objective function because its reduced costs are negatives. The initial mixed integer problem has to be relaxed for getting its reduced costs. The sub problem is defined as the shortest path problem that returns a set of desirable routes. Finally, when the set of desirable routes is obtained, the mixed integer model should select a set of routes that fulfill both minimum shipping costs and the constraints of the system. |
| Author | Figueroa-García, Juan Carlos Franco-Franco, Carlos |
| AuthorAffiliation | Universidad Distrital Francisco José de Caldas |
| AuthorAffiliation_xml | – name: Universidad Distrital Francisco José de Caldas |
| Author_xml | – sequence: 1 givenname: Carlos surname: Franco-Franco fullname: Franco-Franco, Carlos – sequence: 2 givenname: Juan Carlos surname: Figueroa-García fullname: Figueroa-García, Juan Carlos |
| BookMark | eNp1kN1qAjEQhUOxULV9hu4LrE2ym-x60QuR_oHQC1t6GcbsrI1kE0lWi2_ftRYpFi_CBM58M2fOgPScd0jILaOjnMribk4LVqZZRgWnTFJKefcYvyD9o9D7878igxhXlIqxFLxPPiaJ9nbTuGSJDgO0xrt0ARGrBOzSB9N-NkntQxK93Rq37LqbhXGdbNwWXevDLgFXJcFv2r28Dn5hsYnX5LIGG_Hmtw7J--PD2_Q5nb0-vUwns1RzSXmaV4UUJZeds5zTTGgE0Kg5Yo1MYCGA53WBpRa6GgvMxhVIYMgLCbnMgWVDUh7mbtwadl9grVoH00DYKUbVPiAV97erfwF16OiARm3QerXym-A6r2p-Frg_ADr4GAPWSpv2J7E2gLHHhef54oQ_tXqO_AYXzoxA |
| CitedBy_id | crossref_primary_10_14483_23448393_18468 |
| ContentType | Journal Article |
| Copyright | This work is licensed under a Creative Commons Attribution 4.0 International License. |
| Copyright_xml | – notice: This work is licensed under a Creative Commons Attribution 4.0 International License. |
| DBID | AAYXX CITATION GPN ADTOC UNPAY |
| DOI | 10.4067/S0718-33052016000200012 |
| DatabaseName | CrossRef SciELO Unpaywall for CDI: Periodical Content Unpaywall |
| DatabaseTitle | CrossRef |
| DatabaseTitleList | |
| Database_xml | – sequence: 1 dbid: UNPAY name: Unpaywall url: https://proxy.k.utb.cz/login?url=https://unpaywall.org/ sourceTypes: Open Access Repository |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Engineering |
| DocumentTitleAlternate | Algoritmo basado en generación de columnas para resolver problemas combinados de ruteo e inventarios |
| EISSN | 0718-3305 |
| EndPage | 313 |
| ExternalDocumentID | 10.4067/s0718-33052016000200012 S0718_33052016000200012 10_4067_S0718_33052016000200012 |
| GroupedDBID | 123 2WC 635 69Q 8FE 8FG 8G5 8R4 8R5 AAFWJ AAYXX ABDBF ABJCF ABUWG ABXHO ACIWK ACUHS ADBBV AFKRA AFPKN ALMA_UNASSIGNED_HOLDINGS APOWU AZFZN AZQEC B14 BCNDV BENPR BGLVJ BPHCQ C1A CCPQU CITATION CLZPN DWQXO E3Z EFA ESX FAEIB GNUQQ GROUPED_DOAJ GUQSH HCIFZ I-F IPNFZ KQ8 L6V M2O M7S MK~ OK1 PHGZM PHGZT PIMPY PQGLB PQQKQ PROAC PTHSS PUEGO Q2X RDY RIG RSD SCD ~8M GPN ADTOC UNPAY |
| ID | FETCH-LOGICAL-c2602-4d76582633042035ceaacec2eefe15e75a24f7e8c5cd95e39da6a1e276a464a13 |
| IEDL.DBID | UNPAY |
| ISSN | 0718-3305 0718-3291 |
| IngestDate | Tue Aug 19 09:15:38 EDT 2025 Tue Sep 16 20:25:30 EDT 2025 Wed Oct 01 04:52:36 EDT 2025 Thu Apr 24 22:50:14 EDT 2025 |
| IsDoiOpenAccess | true |
| IsOpenAccess | true |
| IsPeerReviewed | true |
| IsScholarly | true |
| Issue | 2 |
| Keywords | pulse algorithm Column generation routing problem shortest path problem Generación de columnas ruta más corta inventarios inventory costeo ruteo de vehículos algoritmo pulse pricing |
| Language | English |
| License | This work is licensed under a Creative Commons Attribution 4.0 International License. http://creativecommons.org/licenses/by/4.0 cc-by |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-c2602-4d76582633042035ceaacec2eefe15e75a24f7e8c5cd95e39da6a1e276a464a13 |
| OpenAccessLink | https://proxy.k.utb.cz/login?url=https://scielo.conicyt.cl/pdf/ingeniare/v24n2/art12.pdf |
| PageCount | 9 |
| ParticipantIDs | unpaywall_primary_10_4067_s0718_33052016000200012 scielo_journals_S0718_33052016000200012 crossref_citationtrail_10_4067_S0718_33052016000200012 crossref_primary_10_4067_S0718_33052016000200012 |
| ProviderPackageCode | CITATION AAYXX |
| PublicationCentury | 2000 |
| PublicationDate | 2016-04-00 20160401 |
| PublicationDateYYYYMMDD | 2016-04-01 |
| PublicationDate_xml | – month: 04 year: 2016 text: 2016-04-00 |
| PublicationDecade | 2010 |
| PublicationTitle | Ingeniare. Revista chilena de ingeniería |
| PublicationTitleAlternate | Ingeniare. Rev. chil. ing |
| PublicationYear | 2016 |
| Publisher | Universidad de Tarapacá |
| Publisher_xml | – name: Universidad de Tarapacá |
| References | Federguen, A; Zipkin, P 1983; 32 Henrik, A 2010; 37 Hemmelmayr, V.C; Doerner, K.F; Hartl, R.F 2009; 95 Oppen, J; Lokketangen, A; Desrosiers, J 2010; 37 Aghezzaf, E.-H; Raa, B; Landeghem, H.V 2006; 169 Mehmet, S; Jacqueline, M; Bloemhof-Ruwaard,; Rene, H; Jack Van der Vorst, G.A.J 2015; 164 Archetti, C; Bertazzi, L; Laporte, G; Speranza, M.G 2007; 41 Bertazzi, L; Paletta, G; Speranza, M.G 2002; 36 Savelsbergh, M; Song, J.-H 2008; 35 Moin, N; Salhi, S; Aziz, N 2011; 133 Coelho, L.C; Cordeau, J.-F; Laporte, G 2012; 40 Lozano, L.; Medaglia, A.L 2013; 40 Solyali, O; Sural, H 2011; 45 Archetti, C; Bertazzi, L; Hertz, A; Speranza, M.G 2011; 24 Hugues, D; Pierre, D; Nicoleta, N; Thomas, Y 2012 Coelho, L.C; Cordeau, J.-F; Laporte, G 2012; 24 Zhao, Q.-H; Wang, S.-Y; Lai, K 2007; 177 |
| References_xml | – volume: 95 start-page: 91 issue: 1 year: 2009 end-page: 802 article-title: A variable neighborhood search heuristic for periodic routing problem publication-title: European Journal of Operational Research – volume: 41 start-page: 382 issue: 3 year: 2007 end-page: 391 article-title: A branch-and-cut algorithm for a vendor-managed inventory-routing problem publication-title: Transportation Sciences – volume: 24 start-page: 270 year: 2012 end-page: 287 article-title: Consistency in multi-vehicle inventory-routing publication-title: Transportation Research – volume: 35 start-page: 2266 year: 2008 end-page: 2282 article-title: An optimization algorithm for the inventory routing problem with continous moves publication-title: Computers & Operations Resarch – volume: 24 start-page: 101 issue: 1 year: 2011 end-page: 116 article-title: A hybrid heuristic for an inventory routing problem publication-title: INFORMS Journal on Computing – volume: 36 start-page: 119 year: 2002 end-page: 132 article-title: Deterministic order-up-to level policies in an inventory routing problem publication-title: Transportation Science – volume: 37 start-page: 1515 year: 2010 end-page: 1536 article-title: Industrial aspects and literature survey: Combined inventory management and routing publication-title: Computers & Operations Research – volume: 164 start-page: 118 year: 2015 end-page: 133 article-title: Modeling an Inventory Routing Problem for perishable products with environmental considerations and demand uncertainty publication-title: International Journal of Production Economics – volume: 32 start-page: 1019 issue: 5 year: 1983 end-page: 1035 article-title: A combined vehicle routing and inventory allocation model publication-title: Operations Research – volume: 45 start-page: 335 year: 2011 end-page: 345 article-title: A branch and cut algorithm using a strong formulation and a priori tour based heuristic for an inventory-routing problem publication-title: Transportation Science – volume: 37 start-page: 1308 year: 2010 end-page: 1317 article-title: Solving a rich vehicle routing and inventory problem using column generation publication-title: Computers & Operations Research – volume: 40 start-page: 558 year: 2012 end-page: 565 article-title: The exact solution of several classes of inventory-routing problems publication-title: Computers & Operations Research – year: 2012 – volume: 177 start-page: 786 year: 2007 end-page: 802 article-title: A partition approach to the inventory/routing problem publication-title: European Journal of Operational Research – volume: 40 start-page: 378 year: 2013 end-page: 384 article-title: On an exact method for the constrained shortest path problem publication-title: Computers & Operations Research – volume: 133 start-page: 334 year: 2011 end-page: 343 article-title: An efficient hybrid genetic algorithm for the multi-product multi-period inventory routing problem publication-title: International Journal in Production Economics – volume: 169 start-page: 1048 year: 2006 end-page: 1063 article-title: Modeling inventory routing problems in supply chains of high consumption products publication-title: European Journal of Operational Research |
| SSID | ssj0059652 ssj0051382 |
| Score | 1.9951304 |
| Snippet | This paper presents a column generation algorithm for solving combined vehicle and inventory problems. This problem is based on the idea of coordinating... |
| SourceID | unpaywall scielo crossref |
| SourceType | Open Access Repository Enrichment Source Index Database |
| StartPage | 305 |
| SubjectTerms | ENGINEERING, MULTIDISCIPLINARY |
| Title | A column generation-based algorithm for solving combined inventory and routing problems |
| URI | http://www.scielo.cl/scielo.php?script=sci_arttext&pid=S0718-33052016000200012&lng=en&tlng=en https://scielo.conicyt.cl/pdf/ingeniare/v24n2/art12.pdf |
| UnpaywallVersion | publishedVersion |
| Volume | 24 |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| journalDatabaseRights | – providerCode: PRVAFT databaseName: Open Access Digital Library customDbUrl: eissn: 0718-3305 dateEnd: 99991231 omitProxy: true ssIdentifier: ssj0059652 issn: 0718-3305 databaseCode: KQ8 dateStart: 20060101 isFulltext: true titleUrlDefault: http://grweb.coalliance.org/oadl/oadl.html providerName: Colorado Alliance of Research Libraries – providerCode: PRVAFT databaseName: Open Access Digital Library customDbUrl: eissn: 0718-3305 dateEnd: 99991231 omitProxy: true ssIdentifier: ssj0059652 issn: 0718-3305 databaseCode: KQ8 dateStart: 20060801 isFulltext: true titleUrlDefault: http://grweb.coalliance.org/oadl/oadl.html providerName: Colorado Alliance of Research Libraries – providerCode: PRVAON databaseName: DOAJ Directory of Open Access Journals customDbUrl: eissn: 0718-3305 dateEnd: 99991231 omitProxy: true ssIdentifier: ssj0059652 issn: 0718-3305 databaseCode: DOA dateStart: 20060101 isFulltext: true titleUrlDefault: https://www.doaj.org/ providerName: Directory of Open Access Journals – providerCode: PRVEBS databaseName: Academic Search Ultimate - eBooks customDbUrl: https://search.ebscohost.com/login.aspx?authtype=ip,shib&custid=s3936755&profile=ehost&defaultdb=asn eissn: 0718-3305 dateEnd: 99991231 omitProxy: true ssIdentifier: ssj0059652 issn: 0718-3305 databaseCode: ABDBF dateStart: 20060501 isFulltext: true titleUrlDefault: https://search.ebscohost.com/direct.asp?db=asn providerName: EBSCOhost – providerCode: PRVPQU databaseName: ProQuest Central customDbUrl: http://www.proquest.com/pqcentral?accountid=15518 eissn: 0718-3305 dateEnd: 99991231 omitProxy: true ssIdentifier: ssj0059652 issn: 0718-3305 databaseCode: BENPR dateStart: 20060101 isFulltext: true titleUrlDefault: https://www.proquest.com/central providerName: ProQuest – providerCode: PRVPQU databaseName: ProQuest Technology Collection customDbUrl: eissn: 0718-3305 dateEnd: 99991231 omitProxy: true ssIdentifier: ssj0059652 issn: 0718-3305 databaseCode: 8FG dateStart: 20060101 isFulltext: true titleUrlDefault: https://search.proquest.com/technologycollection1 providerName: ProQuest |
| link | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV3fa9swED66ZDD6sK37wTraoIfBntzEsiRHj9loKYWF0i00ezKyJHdhrhOcZCP763cnO6VrNwZ9M7bOyL6T7ruT9B3AO1X4waAwLtJCukjEAsec1kXkEj1MciosG3gKPo3V6UScTeW0TV3QWRia90tarKxmdoOxZ9lfuKIfzhnNTO37P7ioeB__aowBoSseQVdJBOEd6E7G56OvgXQzHkYJb2rlhWs06WZnFzovog_d3uTErkZ4iXz-H37pcdONXXiyrhZm89OU5S2vc_IMptv-NptNvh-tV_mR_XWHyvEBH_QcnrZIlI0a09mDHV-9gN1b_IQv4XLELM1eFbsK7NSkxIj8nmOmvJrXs9W3a4aol6EBU2ICW19jpI2PZ2Ev-7zeMFM5Vs_XtLuatdVrlq9gcnL85eNp1FZiiCzGOzwSLkWkwlVIfgwSab0x1lvufeFj6VNpuChSP7TSOi19op1RJvY8VUYoYeLkNXSqeeXfANO5JX4cqRFHiVRyM1RhLVKI3BZS631QWz1ktqUpp2oZZYbhCikw-0wKzO4pcB8GN4KLhqnj_yLvG_Vk7cBd_rtlfGMJ996-_LvM2wfIHEBnVa_9IQKdVd6D7ofj8flFLyQKeq2J_wZlbvWw |
| linkProvider | Unpaywall |
| linkToUnpaywall | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV3dS8MwEA-6CeKD36KikgfBp7o1TdLlcYgigiLocD6VNEl1WLvRbcr8671ru-Engm-lzZW0d8n9Lrn8jpBDmbhmM9HWU1xYj_scxpxSiWcD1QpiLCxb8BRcXsnzDr_oim61dIFnYXDeT3GzMuuZCcSeaWNgk0Zxzqinc9d4YTxjDfirPgSENpkndSkAhNdIvXN13b4vSDf9lhewslZecQ0mXWZ2gfNC-tDpTYbsaoiX0Od_8ksLZTeWyOI4G-jJq07TD17nbIV0p_0tk02ejsej-Ni8faFy_McHrZLlConSdmk6a2TOZetk6QM_4Qa5a1ODs1dGHwp2alSih37PUp0-9PPe6PGZAuqlYMC4MAGtnyHShse9Ipe9n0-ozizN-2PMrqZV9ZrhJumcnd6enHtVJQbPQLzDPG5DQCpMFosfzUAYp7VxhjmXOF-4UGjGk9C1jDBWCRcoq6X2HQul5pJrP9gitayfuW1CVWyQH0cowFE8FEy3ZLEXyXlsEqHUDpFTPUSmoinHahlpBOEKKjC6QQVG3xS4Q5ozwUHJ1PG3yFGpnqgauMPfW_ozS_j29uHPMrv_kNkjtVE-dvsAdEbxQWXU7wq28yE |
| openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=A+column+generation-based+algorithm+for+solving+combined+inventory+and+routing+problems&rft.jtitle=Ingeniare.+Revista+chilena+de+ingenier%C3%ADa&rft.au=Franco-Franco%2C+Carlos&rft.au=Figueroa-Garc%C3%ADa%2C+Juan+Carlos&rft.date=2016-04-01&rft.pub=Universidad+de+Tarapac%C3%A1&rft.issn=0718-3305&rft.volume=24&rft.issue=2&rft.spage=305&rft.epage=313&rft_id=info:doi/10.4067%2FS0718-33052016000200012&rft.externalDocID=S0718_33052016000200012 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0718-3305&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0718-3305&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0718-3305&client=summon |