{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,10]],"date-time":"2026-06-10T15:50:25Z","timestamp":1781106625104,"version":"3.54.1"},"reference-count":38,"publisher":"IGI Global Scientific Publishing","issue":"3","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014,7,1]]},"abstract":"<p>Vehicle routing problems (VRP) are receiving a growing attention in process systems engineering due to its close relationship with supply chain issues. Its aim is to discover the best routes\/schedules for a vehicles fleet fulfilling a number of transportation requests at \u201cminimum cost\u201d. Pick-up and delivery problems (PDP) are a class of VRP on which each request defines the shipping of a given load from a specified pickup site to a given customer. In order to account for a wider range of logistics problems, the so-called supply-chain management VRP (SCM-VRP) problem has been defined as a three-tier network of interconnected factories, warehouses and customers. In this problem, multiple products are to be delivered from some supply-sites to a number of customers through a routes-network in order to meet a set of given demands. The vehicle routes must satisfy capacity and timing constraints while minimizing an objective function stating the specified transportation cost. Pickup sites for each demand are decision variables rather than problem specifications. The SCM-VRP had been modeled as an MILP problem and the resolution of this formulation via a standard branch-and-cut software can provide optimal solutions to moderate size instances. In order to efficiently address larger problems, a decomposition method based on a column generation procedure is introduced in this work. In contrast to traditional columns generation approaches lying on dynamic-programming-procedures as route generators, an MILP formulation is here proposed to create the set of feasible routes and schedules at the slave level of the method. Furthermore, a branch-and-price method based on node-to-routes assignment decisions is constructed to better exploit the MILP route-generator. Finally, several benchmark examples were presented and satisfactorily solved.<\/p>","DOI":"10.4018\/ijoris.2014070103","type":"journal-article","created":{"date-parts":[[2014,10,30]],"date-time":"2014-10-30T09:09:23Z","timestamp":1414660163000},"page":"50-80","source":"Crossref","is-referenced-by-count":2,"title":["Solving Large Distribution Problems in Supply Chain Networks by a Column Generation Approach"],"prefix":"10.4018","volume":"5","author":[{"given":"Rodolfo G.","family":"Dondo","sequence":"first","affiliation":[{"name":"National University of Litoral, Institute of Technological Development for the Chemical Industry, Santa Fe, Argentina"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Carlos A.","family":"Mendez","sequence":"additional","affiliation":[{"name":"Instituto National University of Litoral, Institute of Technological Development for the Chemical Industry, Santa Fe, Argentina"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"2432","reference":[{"issue":"3","key":"ijoris.2014070103-0","doi-asserted-by":"crossref","first-page":"316","DOI":"10.1287\/opre.46.3.316","article-title":"Branch and price. Column generation for solving huge integer programs.","volume":"48","author":"C.Barnhart","year":"2000","journal-title":"Operations Research"},{"key":"ijoris.2014070103-1","doi-asserted-by":"publisher","DOI":"10.1007\/s11750-007-0009-0"},{"key":"ijoris.2014070103-2","doi-asserted-by":"publisher","DOI":"10.1016\/j.compchemeng.2007.04.020"},{"key":"ijoris.2014070103-3","doi-asserted-by":"publisher","DOI":"10.1016\/0377-2217(94)90419-7"},{"key":"ijoris.2014070103-4","doi-asserted-by":"publisher","DOI":"10.1287\/opre.8.1.101"},{"key":"ijoris.2014070103-5","doi-asserted-by":"publisher","DOI":"10.1287\/opre.40.2.342"},{"key":"ijoris.2014070103-6","doi-asserted-by":"crossref","unstructured":"Desrosiers, J., Dumas, Y., Solomon, M., & Soumis, F. (1995). Time constrained routing and scheduling. From M. Ball et al. (eds). Handbook in Operations research and management science. 8. Elsevier Science. 35-139.","DOI":"10.1016\/S0927-0507(05)80106-9"},{"key":"ijoris.2014070103-7","doi-asserted-by":"publisher","DOI":"10.1016\/j.compchemeng.2007.10.002"},{"key":"ijoris.2014070103-8","doi-asserted-by":"publisher","DOI":"10.1021\/ie900792s"},{"key":"ijoris.2014070103-9","doi-asserted-by":"publisher","DOI":"10.1002\/net.20033"},{"key":"ijoris.2014070103-10","doi-asserted-by":"crossref","unstructured":"Fisher, M. (1995). Vehicle routing. From M. Ball et al. (eds). Handbook in operations research and management science. Elsevier Science. 1-33.","DOI":"10.1016\/S0927-0507(05)80105-7"},{"key":"ijoris.2014070103-11","doi-asserted-by":"publisher","DOI":"10.1007\/0-387-25486-2_2"},{"key":"ijoris.2014070103-12","doi-asserted-by":"publisher","DOI":"10.1287\/ijoc.1040.0117"},{"key":"ijoris.2014070103-13","doi-asserted-by":"publisher","DOI":"10.1016\/S0377-2217(00)00033-3"},{"key":"ijoris.2014070103-14","doi-asserted-by":"publisher","DOI":"10.1016\/S0377-2217(02)00153-4"},{"key":"ijoris.2014070103-15","unstructured":"Kalvelagen, E. (2003). Some MINLP Solution algorithms. http:\/\/www.amsterdamoptimization.com\/pdf\/minlp.pdf"},{"key":"ijoris.2014070103-16","doi-asserted-by":"publisher","DOI":"10.1142\/S0218213003001186"},{"key":"ijoris.2014070103-17","doi-asserted-by":"publisher","DOI":"10.1016\/S0377-2217(02)00486-1"},{"key":"ijoris.2014070103-18","unstructured":"L\u00fcebecke, M. (2001). Engine scheduling by column generation. PhD thesis. Technical. University of Braunschweig, Germany."},{"key":"ijoris.2014070103-19","unstructured":"Mitrovic-Minic, S. (1998). Pick-up and delivery problem with time-windows: A survey. Technical report SFU CMPT TR 1998-12."},{"key":"ijoris.2014070103-20","doi-asserted-by":"publisher","DOI":"10.1016\/S0191-2615(99)00016-8"},{"key":"ijoris.2014070103-21","doi-asserted-by":"crossref","unstructured":"Powell, W., Jaillet, P., & Odony, P. (1995). Stochastic and dynamic networks and routing. From M. Ball et al. (eds). Handbook in operations research and management science. Elsevier Science. 141-284.","DOI":"10.1016\/S0927-0507(05)80107-0"},{"key":"ijoris.2014070103-22","doi-asserted-by":"publisher","DOI":"10.1287\/trsc.1090.0272"},{"key":"ijoris.2014070103-23","doi-asserted-by":"publisher","DOI":"10.1287\/trsc.1050.0135"},{"key":"ijoris.2014070103-24","article-title":"Solving small VRPTWs with constraint programming based column generation.","author":"L.Rousseau","year":"2002","journal-title":"Proceedings CPAIOR\u201902"},{"key":"ijoris.2014070103-25","first-page":"269","article-title":"An integer programming approach to scheduling","author":"D.Ryan","year":"1981","journal-title":"Computer scheduling of public transport, urban passenger vehicle and crew scheduling"},{"key":"ijoris.2014070103-26","doi-asserted-by":"publisher","DOI":"10.1016\/0377-2217(90)90091-O"},{"key":"ijoris.2014070103-27","doi-asserted-by":"publisher","DOI":"10.1287\/trsc.29.1.17"},{"key":"ijoris.2014070103-28","doi-asserted-by":"publisher","DOI":"10.1007\/BF02098288"},{"key":"ijoris.2014070103-29","author":"D.Simchi-Levi","year":"2004","journal-title":"Managing the supply chain"},{"key":"ijoris.2014070103-30","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2004.07.009"},{"key":"ijoris.2014070103-31","doi-asserted-by":"publisher","DOI":"10.1287\/opre.41.5.935"},{"key":"ijoris.2014070103-32","doi-asserted-by":"publisher","DOI":"10.1016\/S0377-2217(98)00086-1"},{"key":"ijoris.2014070103-33","doi-asserted-by":"publisher","DOI":"10.1021\/ie0100030"},{"key":"ijoris.2014070103-34","doi-asserted-by":"publisher","DOI":"10.1287\/trsc.27.3.298"},{"key":"ijoris.2014070103-35","unstructured":"Vanderbeck, F. (1994). Decomposition and column generation for integer programs. Ph.D. thesis. Universit\u00e9 Catholique de Louvain. Belgium."},{"key":"ijoris.2014070103-36","unstructured":"Verderame, P., Shaik, M., & Floudas, Ch. (2007). Operational planning of a multisite production and distribution network, AIChE Annual Meeting."},{"key":"ijoris.2014070103-37","doi-asserted-by":"publisher","DOI":"10.1016\/j.compchemeng.2008.05.004"}],"container-title":["International Journal of Operations Research and Information Systems"],"original-title":[],"language":"ng","link":[{"URL":"https:\/\/www.igi-global.com\/viewtitle.aspx?TitleId=117779","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,6,1]],"date-time":"2022-06-01T10:42:43Z","timestamp":1654080163000},"score":1,"resource":{"primary":{"URL":"https:\/\/services.igi-global.com\/resolvedoi\/resolve.aspx?doi=10.4018\/ijoris.2014070103"}},"subtitle":[""],"short-title":[],"issued":{"date-parts":[[2014,7,1]]},"references-count":38,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2014,7]]}},"URL":"https:\/\/doi.org\/10.4018\/ijoris.2014070103","relation":{},"ISSN":["1947-9328","1947-9336"],"issn-type":[{"value":"1947-9328","type":"print"},{"value":"1947-9336","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,7,1]]}}}