{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,30]],"date-time":"2026-01-30T13:10:28Z","timestamp":1769778628898,"version":"3.49.0"},"reference-count":55,"publisher":"Informa UK Limited","issue":"6","license":[{"start":{"date-parts":[[2005,6,1]],"date-time":"2005-06-01T00:00:00Z","timestamp":1117584000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of the Operational Research Society"],"published-print":{"date-parts":[[2005,6]]},"DOI":"10.1057\/palgrave.jors.2601875","type":"journal-article","created":{"date-parts":[[2004,11,17]],"date-time":"2004-11-17T06:41:57Z","timestamp":1100673717000},"page":"708-718","source":"Crossref","is-referenced-by-count":4,"title":["A heuristic approach to the multi-period multi-commodity transportation problem"],"prefix":"10.1080","volume":"56","author":[{"given":"K L","family":"Poh","sequence":"first","affiliation":[{"name":"The National University of Singapore\rSingapore"}]},{"given":"K W","family":"Choo","sequence":"additional","affiliation":[{"name":"The National University of Singapore\rSingapore"}]},{"given":"C G","family":"Wong","sequence":"additional","affiliation":[{"name":"Ministry of Defence\rSingapore"}]}],"member":"301","published-online":{"date-parts":[[2017,12,21]]},"reference":[{"key":"e_1_3_1_2_1_1","first-page":"249","volume-title":"Vehicle Routing: Methods and Studies","author":"Powell WB","year":"1988","unstructured":"PowellWBA comparative review of alternative algorithms for the dynamic vehicle allocation problemVehicle Routing: Methods and Studies1988249289"},{"key":"e_1_3_1_2_2_1","doi-asserted-by":"publisher","DOI":"10.1002\/nav.3800270107"},{"key":"e_1_3_1_2_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02216922"},{"key":"e_1_3_1_2_4_1","first-page":"157","volume-title":"The Vehicle Routing Problem","author":"Gordeau JF","year":"2002","unstructured":"GordeauJFThe VRP with time windowsThe Vehicle Routing Problem2002157193"},{"key":"e_1_3_1_2_5_1","doi-asserted-by":"publisher","DOI":"10.1057\/palgrave.jors.2601319"},{"key":"e_1_3_1_2_6_1","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1137\/1.9780898718515.ch5","volume-title":"The Vehicle Routing Problem","author":"Laporte G","year":"2002","unstructured":"LaporteGSemetFClassical heuristics for the capacitated VRPThe Vehicle Routing Problem2002109128"},{"key":"e_1_3_1_2_7_1","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1137\/1.9780898718515.ch6","volume-title":"The Vehicle Routing Problem","author":"Gendreau M","year":"2002","unstructured":"GendreauMLaporteGPotvinJYMetaheuristics for the capacitated VRPThe Vehicle Routing Problem2002129154"},{"key":"e_1_3_1_2_8_1","first-page":"377","volume-title":"Encyclopedia of Optimization","author":"Laporte G","year":"2001","unstructured":"LaporteGLouveauxFVStochastic vehicle routing problemsEncyclopedia of Optimization2001377379"},{"key":"e_1_3_1_2_9_1","doi-asserted-by":"publisher","DOI":"10.1057\/palgrave.jors.2601163"},{"key":"e_1_3_1_2_10_1","doi-asserted-by":"publisher","DOI":"10.1515\/9781400875184"},{"key":"e_1_3_1_2_11_1","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.28.1.86"},{"key":"e_1_3_1_2_12_1","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.28.1.106"},{"key":"e_1_3_1_2_13_1","unstructured":"Choi W Francis RL Hamacher HW and Tufekci S (1984). Network models of building evacuation problems with flow-dependent exit capacities. In: Brans JP (ed). Operational Research '84: Proceedings of the Tenth IFORS International Conference on Operational Research. Elsevier New York pp 1047\u20131059."},{"key":"e_1_3_1_2_14_1","doi-asserted-by":"publisher","DOI":"10.1016\/0377-2217(88)90382-7"},{"key":"e_1_3_1_2_15_1","doi-asserted-by":"publisher","DOI":"10.1002\/1520-6750(198708)34:4<487::AID-NAV3220340404>3.0.CO;2-9"},{"key":"e_1_3_1_2_16_1","unstructured":"Hoppe B and Tardos E (1994). Polynomial time algorithms for some evacuation problems. In: Sleator DD (ed). Proceedings of the Fifth Annual ACM-SIAM Symposium on Discrete Algorithms. Society for Industrial and Applied Mathematics Philadelphia pp 433\u2013441."},{"key":"e_1_3_1_2_17_1","unstructured":"Hoppe B and Tardos E (1995). The quickest transshipment problem. In: Clarkson K (ed). Proceedings of the Sixth Annual ACM-SIAM Symposium on Discrete Algorithms. Society for Industrial and Applied Mathematics Philadelphia pp 512\u2013521."},{"key":"e_1_3_1_2_18_1","unstructured":"Fleischer L (1998). Faster algorithms for the quickest transshipment problem with zero transit times. In: Karloff H (ed). Proceedings of the Ninth Annual ACM-SIAM Symposium on Discrete Algorithms. Society for Industrial and Applied Mathematics Philadelphia pp 147\u2013156."},{"key":"e_1_3_1_2_19_1","doi-asserted-by":"publisher","DOI":"10.1002\/9781118032343"},{"key":"e_1_3_1_2_20_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-5355-6"},{"key":"e_1_3_1_2_21_1","volume-title":"Facilities Location: Models and Methods","author":"Love R","year":"1988","unstructured":"LoveRMorrisJGWesolowshyGOFacilities Location: Models and Methods1988"},{"key":"e_1_3_1_2_22_1","doi-asserted-by":"publisher","DOI":"10.1287\/opre.20.1.94"},{"key":"e_1_3_1_2_23_1","doi-asserted-by":"publisher","DOI":"10.1057\/jors.1982.93"},{"key":"e_1_3_1_2_24_1","doi-asserted-by":"publisher","DOI":"10.1002\/nav.3800220304"},{"key":"e_1_3_1_2_25_1","doi-asserted-by":"publisher","DOI":"10.1287\/opre.11.3.331"},{"key":"e_1_3_1_2_26_1","volume-title":"Complexity of Location Problems on Networks, BW 107\/79","author":"Kolen A","year":"1979","unstructured":"KolenAComplexity of Location Problems on Networks, BW 107\/791979"},{"key":"e_1_3_1_2_27_1","volume-title":"Discrete Location Theory","author":"Mirchandani PB","year":"1990","unstructured":"MirchandaniPBFrancisRLDiscrete Location Theory1990"},{"key":"e_1_3_1_2_28_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0377-2217(87)80007-3"},{"key":"e_1_3_1_2_29_1","doi-asserted-by":"publisher","DOI":"10.1016\/0377-2217(91)90090-I"},{"key":"e_1_3_1_2_30_1","doi-asserted-by":"publisher","DOI":"10.1016\/0377-2217(95)00100-X"},{"key":"e_1_3_1_2_31_1","volume-title":"Network Flows: Theory, Algorithms, and Applications","author":"Ahuja RK","year":"1993","unstructured":"AhujaRKMagnantiTLOrlinJBNetwork Flows: Theory, Algorithms, and Applications1993"},{"key":"e_1_3_1_2_32_1","volume-title":"Dual-ascent methods and multicommodity flow problems","author":"Frangioni A","year":"1997","unstructured":"FrangioniADual-ascent methods and multicommodity flow problems1997"},{"key":"e_1_3_1_2_33_1","doi-asserted-by":"publisher","DOI":"10.1287\/opre.34.2.250"},{"key":"e_1_3_1_2_34_1","doi-asserted-by":"crossref","unstructured":"Vaidya PM (1989). Speeding up linear programming using fast matrix multiplication. In: Proceedings of the 30th Annual Symposium on Foundations of Computer Science. IEEE Computer Society Press Washington DC pp 332\u2013337.","DOI":"10.1109\/SFCS.1989.63499"},{"key":"e_1_3_1_2_35_1","doi-asserted-by":"publisher","DOI":"10.1137\/S1052623496304542"},{"key":"e_1_3_1_2_36_1","doi-asserted-by":"publisher","DOI":"10.1287\/inte.28.2.32"},{"key":"e_1_3_1_2_37_1","doi-asserted-by":"crossref","unstructured":"Leighton T and Rao S (1988). An approximate max-flow min-cut theorem for uniform multicommodity flow problems with applications to approximation algorithms. In: Proceedings of the 29th Annual Symposium on Foundations of Computer Science. IEEE Computer Society Press Washington DC pp 422\u2013431.","DOI":"10.1109\/SFCS.1988.21958"},{"key":"e_1_3_1_2_38_1","first-page":"300","volume-title":"Proceedings of the 39th Annual Symposium on Foundations of Computer Science","author":"Garg N","year":"1998","unstructured":"GargNKonemannJFaster and simpler algorithms for multicommodity flow and other fractional packing problemsProceedings of the 39th Annual Symposium on Foundations of Computer Science1998300309"},{"key":"e_1_3_1_2_39_1","doi-asserted-by":"publisher","DOI":"10.1145\/77600.77620"},{"key":"e_1_3_1_2_40_1","doi-asserted-by":"publisher","DOI":"10.1145\/331524.331526"},{"key":"e_1_3_1_2_41_1","doi-asserted-by":"publisher","DOI":"10.1002\/1520-6750(199304)40:3<305::AID-NAV3220400303>3.0.CO;2-4"},{"key":"e_1_3_1_2_42_1","doi-asserted-by":"publisher","DOI":"10.1287\/trsc.27.2.102"},{"key":"e_1_3_1_2_43_1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-61310-2_5"},{"key":"e_1_3_1_2_44_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0166-218X(99)00187-0"},{"key":"e_1_3_1_2_45_1","volume-title":"Computers and Intractibility: A Guide to the Theory of NP-Completeness","author":"Garey MS","year":"1979","unstructured":"GareyMSJohnsonDSComputers and Intractibility: A Guide to the Theory of NP-Completeness1979"},{"key":"e_1_3_1_2_46_1","first-page":"46","volume-title":"Approximation Algorithms for NP-hard Problems","author":"Coffman EG","year":"1997","unstructured":"CoffmanEGJrGareyMRJohnsonDSApproximation algorithms for bin packing: a surveyApproximation Algorithms for NP-hard Problems19974693"},{"key":"e_1_3_1_2_47_1","volume-title":"Knapsack Problems: Algorithms and Computer Implementations","author":"Martello S","year":"1990","unstructured":"MartelloSTothPKnapsack Problems: Algorithms and Computer Implementations1990"},{"key":"e_1_3_1_2_48_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02125404"},{"key":"e_1_3_1_2_49_1","doi-asserted-by":"publisher","DOI":"10.1162\/evco.1994.2.2.123"},{"key":"e_1_3_1_2_50_1","volume-title":"Solving Combinatorial Problems using Evolutionary Algorithms","author":"Vink M","year":"1997","unstructured":"VinkMSolving Combinatorial Problems using Evolutionary Algorithms1997"},{"key":"e_1_3_1_2_51_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF00226291"},{"key":"e_1_3_1_2_52_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1018952112615"},{"key":"e_1_3_1_2_53_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1009678411503"},{"key":"e_1_3_1_2_54_1","unstructured":"Djang PA and Finch PR (1998). Solving one dimension bin packing problems. Unpublished manuscript US Army Research Laboratory Adelphi MD USA phil.djang@psl.nmsu.edu"},{"key":"e_1_3_1_2_55_1","first-page":"246","volume-title":"International Workshop on Algorithm Engineering and Experimentation","author":"Csirik J","year":"1999","unstructured":"CsirikJA self organising bin packing heuristicInternational Workshop on Algorithm Engineering and Experimentation1999246265"}],"container-title":["Journal of the Operational Research Society"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1057\/palgrave.jors.2601875.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1057\/palgrave.jors.2601875\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.tandfonline.com\/doi\/pdf\/10.1057\/palgrave.jors.2601875","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1057\/palgrave.jors.2601875.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,1,29]],"date-time":"2026-01-29T21:35:44Z","timestamp":1769722544000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.tandfonline.com\/doi\/full\/10.1057\/palgrave.jors.2601875"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005,6]]},"references-count":55,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2005,6]]}},"alternative-id":["10.1057\/palgrave.jors.2601875"],"URL":"https:\/\/doi.org\/10.1057\/palgrave.jors.2601875","relation":{},"ISSN":["0160-5682","1476-9360"],"issn-type":[{"value":"0160-5682","type":"print"},{"value":"1476-9360","type":"electronic"}],"subject":[],"published":{"date-parts":[[2005,6]]}}}