{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,28]],"date-time":"2026-02-28T16:52:38Z","timestamp":1772297558260,"version":"3.50.1"},"reference-count":35,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2010,8,26]],"date-time":"2010-08-26T00:00:00Z","timestamp":1282780800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Ann Oper Res"],"published-print":{"date-parts":[[2012,1]]},"DOI":"10.1007\/s10479-010-0780-4","type":"journal-article","created":{"date-parts":[[2010,8,25]],"date-time":"2010-08-25T06:02:22Z","timestamp":1282716142000},"page":"21-47","source":"Crossref","is-referenced-by-count":31,"title":["Transshipment service through crossdocks with both soft and hard time windows"],"prefix":"10.1007","volume":"192","author":[{"given":"Zhaowei","family":"Miao","sequence":"first","affiliation":[]},{"given":"Feng","family":"Yang","sequence":"additional","affiliation":[]},{"given":"Ke","family":"Fu","sequence":"additional","affiliation":[]},{"given":"Dongsheng","family":"Xu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2010,8,26]]},"reference":[{"key":"780_CR1","author":"R. Balamurugan","year":"2008","unstructured":"Balamurugan, R., Ramakrishnan, C. V., & Nidur, S. (2008). Performance evaluation of a two stage adaptive genetic algorithm (TSAGA) in structural topology optimization. Applied Soft Computing. doi: 10.1016\/j.asoc.2007.10.022 .","journal-title":"Applied Soft Computing"},{"issue":"2","key":"780_CR2","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1088\/0954-898X\/6\/2\/009","volume":"6","author":"P. C. Bressloff","year":"1995","unstructured":"Bressloff, P. C. (1995). Stochastic dynamics of reinforcement learning. Network: Computation in Neural Systems, 6(2), 289\u2013307.","journal-title":"Network: Computation in Neural Systems"},{"issue":"1","key":"780_CR3","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1016\/j.cor.2004.06.002","volume":"33","author":"P. Chen","year":"2006","unstructured":"Chen, P., Guo, Y. S., Lim, A., & Rodriguesd, B. (2006). Multiple crossdocks with inventory and time windows. Computers & Operations Research, 33(1), 43\u201363.","journal-title":"Computers & Operations Research"},{"issue":"2","key":"780_CR4","doi-asserted-by":"crossref","first-page":"440","DOI":"10.1016\/j.ejor.2008.03.014","volume":"196","author":"S. Consoli","year":"2009","unstructured":"Consoli, S., Darby-Dowman, K., Mladenovi\u0107, N., & Moreno\u00a0P\u00e9rez, J.A. (2009). Greedy randomized adaptive search and variable neighbourhood search for the minimum labelling spanning tree problem. European Journal of Operational Research, 196(2), 440\u2013449.","journal-title":"European Journal of Operational Research"},{"key":"780_CR5","unstructured":"Donaldson, H., Johnson, E. L., Ratliff, H. D., & Zhang, M. (1999). Schedule-driven crossdocking networks. Research Report, Georgia Institute of Technology."},{"issue":"3","key":"780_CR6","doi-asserted-by":"crossref","first-page":"559","DOI":"10.1016\/S0377-2217(00)00098-9","volume":"131","author":"K. Fagerholt","year":"2001","unstructured":"Fagerholt, K. (2001). Ship scheduling with soft time windows: an optimisation based approach. European Journal of Operational Research, 131(3), 559\u2013571.","journal-title":"European Journal of Operational Research"},{"key":"780_CR7","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4615-6089-0","volume-title":"Tabu search","author":"F. Glover","year":"1997","unstructured":"Glover, F., & Laguna, M. (1997). Tabu search. Dordrecht: Kluwer Academic."},{"issue":"4","key":"780_CR8","doi-asserted-by":"crossref","first-page":"419","DOI":"10.1287\/trsc.33.4.419","volume":"33","author":"K. R. Gue","year":"1999","unstructured":"Gue, K. R. (1999). The effects of trailer scheduling on the layout of freight terminals. Transportation Science, 33(4), 419\u2013428.","journal-title":"Transportation Science"},{"issue":"14","key":"780_CR9","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1016\/j.trc.2006.03.002","volume":"3","author":"M. Gendreau","year":"2006","unstructured":"Gendreau, M., Guertin, F., Potvin, J. Y., & S\u00e9guin, R. (2006). Neighborhood search heuristics for a dynamic vehicle dispatching problem with pick-ups and deliveries. Transportation Research Part C: Emerging Technologies, 3(14), 157\u2013174.","journal-title":"Transportation Research Part C: Emerging Technologies"},{"issue":"1","key":"780_CR10","doi-asserted-by":"crossref","first-page":"367","DOI":"10.1007\/s10479-009-0657-6","volume":"175","author":"P. Hansen","year":"2010","unstructured":"Hansen, P., Mladenovi\u0107, N., & Moreno\u00a0P\u00e9rez, J.A. (2010). Variable neighbourhood search: methods and applications. Annals of Operations Research, 175(1), 367\u2013407.","journal-title":"Annals of Operations Research"},{"issue":"16","key":"780_CR11","doi-asserted-by":"crossref","first-page":"2271","DOI":"10.1016\/j.dam.2006.04.009","volume":"154","author":"H. Hashimoto","year":"2006","unstructured":"Hashimoto, H., Ibaraki, T., Imahori, S., & Yagiura, M. (2006). The vehicle routing problem with flexible time windows and traveling times. Discrete Applied Mathematics, 154(16), 2271\u20132290.","journal-title":"Discrete Applied Mathematics"},{"issue":"130","key":"780_CR12","doi-asserted-by":"crossref","first-page":"449","DOI":"10.1016\/S0377-2217(00)00100-4","volume":"3","author":"P. Hansen","year":"2001","unstructured":"Hansen, P., & Mladenovi, N. (2001). Variable neighborhood search: principles and applications. European Journal of Operational Research, 3(130), 449\u2013467.","journal-title":"European Journal of Operational Research"},{"issue":"31","key":"780_CR13","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1016\/S0305-0483(02)00064-6","volume":"1","author":"G. Ioannou","year":"2003","unstructured":"Ioannou, G., Kritikos, M., & Prastacos, G. (2003). A problem generator-solver heuristic for vehicle routing with soft time windows. The International Journal of Management Science, Omega, 1(31), 41\u201353.","journal-title":"The International Journal of Management Science, Omega"},{"issue":"10","key":"780_CR14","doi-asserted-by":"crossref","first-page":"3112","DOI":"10.1016\/j.cor.2005.11.020","volume":"34","author":"B. B. Keskin","year":"2007","unstructured":"Keskin, B. B., & \u00dcster, H. (2007). A scatter search-based heuristic to locate capacitated transshipment points. Computers & Operations Research, 34(10), 3112\u20133125.","journal-title":"Computers & Operations Research"},{"issue":"1","key":"780_CR15","doi-asserted-by":"crossref","first-page":"60","DOI":"10.1016\/j.ejor.2005.07.025","volume":"176","author":"P. Kaelo","year":"2007","unstructured":"Kaelo, P., & Ali, M. M. (2007). Integrated crossover rules in real coded genetic algorithms. European Journal of Operational Research, 176(1), 60\u201376.","journal-title":"European Journal of Operational Research"},{"issue":"1\u20134","key":"780_CR16","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1023\/A:1021145103592","volume":"115","author":"H. J. Kim","year":"2002","unstructured":"Kim, H. J., & Hooker, J. N. (2002). Solving fixed-charge network flow problems with a hybrid optimization and constraint programming approach. Annals of Operations Research, 115(1\u20134), 95\u2013124.","journal-title":"Annals of Operations Research"},{"issue":"2","key":"780_CR17","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1016\/j.cie.2006.02.006","volume":"51","author":"Y. H. Lee","year":"2006","unstructured":"Lee, Y. H., Jung, J. W., & Lee, K. M. (2006). Vehicle routing scheduling for cross-docking in the supply chain. Computers & Industrial Engineering, 51(2), 247\u2013256.","journal-title":"Computers & Industrial Engineering"},{"issue":"12","key":"780_CR18","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1142\/S0218213003001186","volume":"2","author":"H. Li","year":"2003","unstructured":"Li, H., & Lim, A. (2003). A Metaheuristic for the pickup and delivery problem with time windows. International Journal on Artificial Intelligent Tools, 2(12), 173\u2013186.","journal-title":"International Journal on Artificial Intelligent Tools"},{"issue":"12","key":"780_CR19","doi-asserted-by":"crossref","first-page":"1342","DOI":"10.1057\/palgrave.jors.2601812","volume":"55","author":"Y. Li","year":"2004","unstructured":"Li, Y., Lim, A., & Rodrigues, B. (2004). Crossdocking: JIT scheduling with time windows. Journal of the Operational Research Society, 55(12), 1342\u20131351.","journal-title":"Journal of the Operational Research Society"},{"issue":"8","key":"780_CR20","doi-asserted-by":"crossref","first-page":"724","DOI":"10.1002\/nav.20113","volume":"52","author":"A. Lim","year":"2005","unstructured":"Lim, A., Miao, Z., Rodrigues, B., & Xu, Z. (2005). Transshipment through crossdocks with inventory and time windows. Naval Research Logistics, 52(8), 724\u2013733.","journal-title":"Naval Research Logistics"},{"issue":"1","key":"780_CR21","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1016\/j.ejor.2007.09.031","volume":"192","author":"Z. Miao","year":"2009","unstructured":"Miao, Z., Lim, A., & Ma, H. (2009a). Truck dock assignment problem with operational time constraint within crossdocks. European Journal of Operational Research, 192(1), 105\u2013115.","journal-title":"European Journal of Operational Research"},{"key":"780_CR22","unstructured":"Miao, Z., Yang, F., & Fu, K. (2009b). A hybrid two-stage genetic algorithm for the transshipment problem in crossdocking networks. Working paper. School of Management, Xiamen University, P.R. China."},{"key":"780_CR23","author":"L. Michel","year":"2010","unstructured":"Michel, L., Shvartsman, A., & Sonderegger, E. (2010). Optimal deployment of eventually-serializable data services. Annals of Operations Research, doi: 10.1007\/s10479-010-0684-3 .","journal-title":"Annals of Operations Research"},{"issue":"24","key":"780_CR24","doi-asserted-by":"crossref","first-page":"1097","DOI":"10.1016\/S0305-0548(97)00031-2","volume":"11","author":"N. Mladenovi\u0107","year":"1997","unstructured":"Mladenovi\u0107, N., & Hansen, P. (1997). Variable neighborhoodsearch. Computers & Operations Research, 11(24), 1097\u20131100.","journal-title":"Computers & Operations Research"},{"issue":"2","key":"780_CR25","doi-asserted-by":"crossref","first-page":"331","DOI":"10.1007\/BF00939452","volume":"64","author":"K. Najim","year":"1990","unstructured":"Najim, K., Pibouleau, L., & Le Lann, M. V. (1990). Optimization technique based on learning automata. Journal of Optimization Theory and Applications, 64(2), 331\u2013347.","journal-title":"Journal of Optimization Theory and Applications"},{"key":"780_CR26","unstructured":"Ratcliff, D. H., van\u00a0de Vate, J., & Zhang, M. (1999). Network design for load-driven cross-docking systems, Research Report, Georgia Institute of Technology."},{"issue":"1","key":"780_CR27","doi-asserted-by":"crossref","first-page":"64","DOI":"10.1016\/j.cie.2007.12.001","volume":"55","author":"A. Ross","year":"2008","unstructured":"Ross, A., & Jayaraman, V. (2008). An evaluation of new heuristics for the location of cross-docks distribution centers in supply chain network design. Computers & Industrial Engineering, 55(1), 64\u201379.","journal-title":"Computers & Industrial Engineering"},{"issue":"8","key":"780_CR28","first-page":"34","volume":"14","author":"B. Schaffer","year":"1998","unstructured":"Schaffer, B. (1998). Cross docking can increase efficiency. Automatic I.D. News, 14(8), 34\u201337.","journal-title":"Automatic I.D. News"},{"issue":"3","key":"780_CR29","first-page":"128","volume":"54","author":"B. Shaffer","year":"2000","unstructured":"Shaffer, B. (2000). Implementing a successful crossdocking operation. Plant Engineering, 54(3), 128\u2013134.","journal-title":"Plant Engineering"},{"issue":"12","key":"780_CR30","doi-asserted-by":"crossref","first-page":"1283","DOI":"10.1057\/palgrave.jors.2601645","volume":"54","author":"S. Sung","year":"2003","unstructured":"Sung, S., & Song, H. (2003). Integrated service network design for a cross-docking supply chain network. Journal of the Operational Research Society, 54(12), 1283\u20131295.","journal-title":"Journal of the Operational Research Society"},{"issue":"1\u20134","key":"780_CR31","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1016\/0360-8352(90)90128-9","volume":"19","author":"L. Tsui","year":"1990","unstructured":"Tsui, L., & Chang, C. (1990). A microcomputer based decision support tool for assigning dock doors in freight yards. Computers & Industrial Engineering, 19(1\u20134), 309\u2013312.","journal-title":"Computers & Industrial Engineering"},{"issue":"1\u20134","key":"780_CR32","doi-asserted-by":"crossref","first-page":"283","DOI":"10.1016\/0360-8352(92)90117-3","volume":"23","author":"L. Tsui","year":"1992","unstructured":"Tsui, L., & Chang, C. (1992). An optimal solution to a dock door assignment problem. Computers & Industrial Engineering, 23(1\u20134), 283\u2013286.","journal-title":"Computers & Industrial Engineering"},{"issue":"3","key":"780_CR33","doi-asserted-by":"crossref","first-page":"677","DOI":"10.1016\/j.cie.2007.10.004","volume":"54","author":"I. F. A. Vis","year":"2008","unstructured":"Vis, I. F. A., & Roodbergen, K. J. (2008). Positioning of goods in a cross-docking environment. Computers & Industrial Engineering, 54(3), 677\u2013689.","journal-title":"Computers & Industrial Engineering"},{"key":"780_CR34","unstructured":"Vansteenwegen, P., Souffriau, W., & S\u00f6rensen, K. (2009). Solving the mobile mapping van problem: a hybrid metaheuristic for capacitated arc routing with soft time windows. Computer & Operations Research (In Press). Available online, 18 May."},{"issue":"1","key":"780_CR35","doi-asserted-by":"crossref","first-page":"377","DOI":"10.1016\/j.ejor.2006.10.047","volume":"184","author":"W. Yu","year":"2008","unstructured":"Yu, W., & Egbelu, P. J. (2008). Scheduling of inbound and outbound trucks in cross docking systems with temporary storage. European Journal of Operational Research, 184(1), 377\u2013396.","journal-title":"European Journal of Operational Research"}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-010-0780-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10479-010-0780-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-010-0780-4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T18:08:02Z","timestamp":1559153282000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10479-010-0780-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,8,26]]},"references-count":35,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2012,1]]}},"alternative-id":["780"],"URL":"https:\/\/doi.org\/10.1007\/s10479-010-0780-4","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"value":"0254-5330","type":"print"},{"value":"1572-9338","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,8,26]]}}}