{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,10]],"date-time":"2025-11-10T13:33:20Z","timestamp":1762781600255},"reference-count":40,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2010,7,11]],"date-time":"2010-07-11T00:00:00Z","timestamp":1278806400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Intell Manuf"],"published-print":{"date-parts":[[2012,6]]},"DOI":"10.1007\/s10845-010-0427-y","type":"journal-article","created":{"date-parts":[[2010,7,11]],"date-time":"2010-07-11T21:39:41Z","timestamp":1278884381000},"page":"759-774","source":"Crossref","is-referenced-by-count":54,"title":["Vehicle routing scheduling using an enhanced hybrid optimization approach"],"prefix":"10.1007","volume":"23","author":[{"given":"Behnam","family":"Vahdani","sequence":"first","affiliation":[]},{"given":"Reza","family":"Tavakkoli-Moghaddam","sequence":"additional","affiliation":[]},{"given":"Mostafa","family":"Zandieh","sequence":"additional","affiliation":[]},{"given":"Jafar","family":"Razmi","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2010,7,11]]},"reference":[{"key":"427_CR1","volume-title":"Search in combinatorial optimization","author":"E. Aarts","year":"1997","unstructured":"Aarts E., Lenstra J. K. (1997) Search in combinatorial optimization. Wiley, New York"},{"key":"427_CR2","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1016\/S0166-218X(01)00338-9","volume":"123","author":"R. K. Ahuja","year":"2002","unstructured":"Ahuja R. K., Ergun O., Orlin J. B., Punnen A. P. (2002) A survey of very large-scale neighborhood search techniques. Discrete Apply Mathematics 123: 75\u2013102","journal-title":"Discrete Apply Mathematics"},{"issue":"3","key":"427_CR3","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1080\/713682769","volume":"3","author":"M. U. Apte","year":"2000","unstructured":"Apte M. U., Viswanathan S. (2000) Effective cross docking for improving distribution efficiencies. International Journal of Logistics: Research and Applications 3(3): 291\u2013302","journal-title":"International Journal of Logistics: Research and Applications"},{"key":"427_CR4","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1016\/S0305-0548(98)00047-1","volume":"26","author":"G. Barbarosoglu","year":"1999","unstructured":"Barbarosoglu G., Ozgur D. (1999) A Tabu search algorithm for the vehicle routing problem. Computer & Operational Research 26: 255\u2013270","journal-title":"Computer & Operational Research"},{"issue":"2","key":"427_CR5","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1287\/trsc.1030.0077","volume":"38","author":"J. J. Bartholdi III","year":"2004","unstructured":"Bartholdi J. J. III, Gue R. K. (2004) The best shape for a crossdock. Transportation Sciences 38(2): 235\u2013244","journal-title":"Transportation Sciences"},{"key":"427_CR6","unstructured":"Boysen, N., Fliedner, M., & Scholl, A. (2008). Scheduling inbound and outbound trucks at crossdocking terminals. OR Spectrum, 1\u201327."},{"key":"427_CR7","first-page":"53","volume":"6","author":"F. Chen","year":"2006","unstructured":"Chen F., Song K. L. (2006) Cross docking logistics scheduling problem and its approximation and exact algorithms. Industry Engineering and Management 6: 53\u201358","journal-title":"Industry Engineering and Management"},{"key":"427_CR8","doi-asserted-by":"crossref","unstructured":"Chen, F., & Song, K. L. (2008). Minimizing makespan in two-stage hybrid cross docking scheduling problem, Computers & Operations Research. doi: 10.1016\/j.cor.2008.07.003 .","DOI":"10.1016\/j.cor.2008.07.003"},{"key":"427_CR9","doi-asserted-by":"crossref","unstructured":"Dong, G., Tang, J., Lai, K. K., & Kong, Y. (2009). An exact algorithm for vehicle routing and scheduling problem of free pickup and delivery service in flight ticket sales companies based on set-partitioning model. Journal of Intelligent Manufacturing. doi: 10.1007\/s10845-009-0311-9 .","DOI":"10.1007\/s10845-009-0311-9"},{"key":"427_CR10","first-page":"131","volume":"44","author":"Y. K. Eddie","year":"2006","unstructured":"Eddie Y. K., Ng E. W., Kee N. (2006) Parametric study of the biopotential equation for breast tumour identification using ANOVA and Taguchi method. International Federation for Medical and Biological Engineering 44: 131\u2013139","journal-title":"International Federation for Medical and Biological Engineering"},{"issue":"22","key":"427_CR11","doi-asserted-by":"crossref","first-page":"124","DOI":"10.1109\/4235.771166","volume":"3","author":"A. E. Eiben","year":"1999","unstructured":"Eiben A. E., Hinterding R., Michalewicz Z. (1999) Parameter control in evolutionary algorithms. IEEE Transactions on Evolutionary Computation 3(22): 124\u2013141","journal-title":"IEEE Transactions on Evolutionary Computation"},{"key":"427_CR12","doi-asserted-by":"crossref","first-page":"190","DOI":"10.1287\/ijoc.1.3.190","volume":"1","author":"F. Glover","year":"1989","unstructured":"Glover F. (1989) Tabu search. Part I. ORSA Journal on Computing 1: 190\u2013206","journal-title":"ORSA Journal on Computing"},{"key":"427_CR13","doi-asserted-by":"crossref","first-page":"4","DOI":"10.1287\/ijoc.2.1.4","volume":"2","author":"F. Glover","year":"1990","unstructured":"Glover F. (1990) Tabu search. Part II. ORSA Journal on Computing 2: 4\u201332","journal-title":"ORSA Journal on Computing"},{"key":"427_CR14","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. Kluwer, Boston"},{"issue":"1","key":"427_CR15","doi-asserted-by":"crossref","first-page":"122","DOI":"10.1109\/TSMC.1986.289288","volume":"16","author":"J. J. Grefenstette","year":"1986","unstructured":"Grefenstette J. J. (1986) Optimisation of control parameters for genetic algorithms. IEEE Transaction on Systems, Man and Cybernetics 16(1): 122\u2013128","journal-title":"IEEE Transaction on Systems, Man and Cybernetics"},{"issue":"1","key":"427_CR16","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1016\/j.dam.2003.09.012","volume":"145","author":"P. Hansen","year":"2004","unstructured":"Hansen P., Mladenovic N., Dragan U. (2004) Variable neighborhood search for the maximum clique. Discrete Applied Mathematics 145(1): 117\u2013125","journal-title":"Discrete Applied Mathematics"},{"key":"427_CR17","doi-asserted-by":"crossref","first-page":"407","DOI":"10.1016\/j.ijpe.2004.05.027","volume":"105","author":"A. Janiak","year":"2007","unstructured":"Janiak A., Kozan E., Lichtenstein M., Oguz C. (2007) Metaheuristic approaches to the hybrid flowshop scheduling problem with a cost-related criterion. International Journal of Production Economics 105: 407\u2013424","journal-title":"International Journal of Production Economics"},{"key":"427_CR18","first-page":"3","volume":"14","author":"H. Z. Jia","year":"2003","unstructured":"Jia H. Z., Nee A. Y. C., Fuh J. Y. H., Zhang Y. F. (2003) A modified genetic algorithm for distributed scheduling. Journal of Intelligent Manufacturing 14: 3\u20134","journal-title":"Journal of Intelligent Manufacturing"},{"key":"427_CR19","doi-asserted-by":"crossref","unstructured":"Kennedy, J., & Eberhart, R. (1995). Particle swarm optimization. In Proceeding of the 1995 IEEE international conference on neural network, Perth, Australia, 1942\u20131948","DOI":"10.1109\/ICNN.1995.488968"},{"key":"427_CR20","doi-asserted-by":"crossref","first-page":"671","DOI":"10.1126\/science.220.4598.671","volume":"220","author":"S. Kirkpatrick","year":"1983","unstructured":"Kirkpatrick S., Gelatt C. D., Vecchi M. P. (1983) Optimization by simulated annealing. Science 220: 671\u2013680","journal-title":"Science"},{"key":"427_CR21","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1023\/A:1008959628154","volume":"12","author":"A. Landrieu","year":"2001","unstructured":"Landrieu A., Mati Y., Binder Z. (2001) A tabu search heuristic for the single vehicle pickup and delivery problem with time windows. Journal of Intelligent Manufacturing 12: 5\u20136","journal-title":"Journal of Intelligent Manufacturing"},{"key":"427_CR22","doi-asserted-by":"crossref","first-page":"559","DOI":"10.1016\/S0377-2217(02)00363-6","volume":"148","author":"H. C. Lau","year":"2003","unstructured":"Lau H. C., Sim M., Teo K. M. (2003) Vehicle routing problem with time windows and a limited number of vehicles. European Journal of Operational Research 148: 559\u2013569","journal-title":"European Journal of Operational Research"},{"key":"427_CR23","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 W. J., Lee K. M. (2006) Vehicle routing scheduling for cross-docking in the supply chain. Computers & Industrial Engineering 51: 247\u2013256","journal-title":"Computers & Industrial Engineering"},{"issue":"12","key":"427_CR24","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\u2014JIT scheduling with time windows. Journal of the Operational Research Society 55(12): 1342\u20131351","journal-title":"Journal of the Operational Research Society"},{"key":"427_CR25","doi-asserted-by":"crossref","first-page":"688","DOI":"10.1007\/11751595_73","volume-title":"Computational science and its applications\u2014ICCSA","author":"A. Lim","year":"2006","unstructured":"Lim A., Ma H., Miao Z. et\u00a0al (2006) Truck dock assignment problem with time windows and capacity constraint in transshipment network through crossdocks. In: Gavrilova M. (eds) Computational science and its applications\u2014ICCSA. Springer, Berlin\/Heidelberg, pp 688\u2013697"},{"key":"427_CR26","doi-asserted-by":"crossref","first-page":"262","DOI":"10.1007\/11779568_30","volume-title":"Advances in applied artificial intelligence","author":"A. Lim","year":"2006","unstructured":"Lim A., Ma H., Miao Z. (2006) Truck dock assignment problem with operational time constraint within crossdocks. In: Ali M., Dapoigny R. (eds) Advances in applied artificial intelligence. Springer, Berlin\/Heidelberg, pp 262\u2013271"},{"issue":"5","key":"427_CR27","first-page":"852","volume":"41","author":"D. Y. Ma","year":"2007","unstructured":"Ma D. Y., Chen F. (2007) Dynamic programming algorithm on two machines cross docking scheduling. Journal of Shanghai Jiao Tong University 41(5): 852\u2013856","journal-title":"Journal of Shanghai Jiao Tong University"},{"key":"427_CR28","volume-title":"Genetic algorithms\u00a0+\u00a0data structures\u00a0=\u00a0evolution programs","author":"Z. Michalewicz","year":"1996","unstructured":"Michalewicz Z. (1996) Genetic algorithms\u00a0+\u00a0data structures\u00a0=\u00a0evolution programs (3rd ed.). Springer, Berlin, Heidelberg, New York","edition":"3"},{"issue":"1","key":"427_CR29","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1162\/evco.1996.4.1.1","volume":"4","author":"Z. Michalewicz","year":"1996","unstructured":"Michalewicz Z., Schoenauer M. (1996) Evolutionary algorithms for constrained parameter optimisation problems. Evolutionary Computation 4(1): 1\u201332","journal-title":"Evolutionary Computation"},{"key":"427_CR30","doi-asserted-by":"crossref","first-page":"669","DOI":"10.1016\/S0360-8352(97)00275-1","volume":"34","author":"G. Mosheiov","year":"1998","unstructured":"Mosheiov G. (1998) Vehicle routing with pick-up and delivery: tour\u2014partitioning heuristics. Computers & Industrial Engineering 34: 669\u2013684","journal-title":"Computers & Industrial Engineering"},{"key":"427_CR31","unstructured":"Rohrer, M. (1995). Simulation and cross docking. In Proceedings of the 1995 winter simulation conference (pp. 846\u2013849)."},{"key":"427_CR32","doi-asserted-by":"crossref","first-page":"654","DOI":"10.1016\/j.future.2009.01.004","volume":"25","author":"V. Roshanaei","year":"2009","unstructured":"Roshanaei V., Naderi B., Jolai F., Khalili M. (2009) A variable neighborhood search for job shop scheduling with setup times to minimize makespan. Future Generation Computer Systems 25: 654\u2013661","journal-title":"Future Generation Computer Systems"},{"issue":"2","key":"427_CR33","first-page":"59","volume":"51","author":"G. F. Schwind","year":"1996","unstructured":"Schwind G. F. (1996) A systems approach to docks and cross docking. Material Handling Engineering 51(2): 59\u201362","journal-title":"Material Handling Engineering"},{"key":"427_CR34","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1016\/S0377-2217(98)00308-7","volume":"118","author":"P. Tian","year":"1999","unstructured":"Tian P., Ma J., Zhang D. M. (1999) Application of the simulated annealing algorithm to the combinatorial optimization problem with permutation property: An investigation of generation mechanism. European Journal of Operational Research 118: 81\u201394","journal-title":"European Journal of Operational Research"},{"key":"427_CR35","doi-asserted-by":"crossref","unstructured":"Vahdani, B., & Zandieh, M. (2009). Scheduling trucks in cross-docking systems: Robust meta-heuristics. Computers & Industrial Engineering. doi: 10.1016\/j.cie.2009.06.006 .","DOI":"10.1016\/j.cie.2009.06.006"},{"key":"427_CR36","doi-asserted-by":"crossref","first-page":"359","DOI":"10.1016\/j.tre.2005.01.002","volume":"42","author":"M. A. Waller","year":"2006","unstructured":"Waller M. A., Richard C. C., Ozment J. (2006) Impact of cross-docking on inventory in a decentralized retail supply chain. Transportation Research Part E 42: 359\u2013382","journal-title":"Transportation Research Part E"},{"key":"427_CR37","doi-asserted-by":"crossref","unstructured":"Wang, C. H., & Lu, J. Z. (2009). An effective evolutionary algorithm for the practical capacitated vehicle routing problems. Journal of Intelligent Manufacturing. doi: 10.1007\/s10845-008-0185-2 .","DOI":"10.1007\/s10845-008-0185-2"},{"issue":"2","key":"427_CR38","doi-asserted-by":"crossref","first-page":"5","DOI":"10.2307\/20713703","volume":"47","author":"J. F. Wang","year":"2008","unstructured":"Wang J. F., Regan A. (2008) Real-time trailer scheduling for cross dock operations. Transportation Journal 47(2): 5\u201320","journal-title":"Transportation Journal"},{"key":"427_CR39","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1080\/00207169508804397","volume":"56","author":"X. Yao","year":"1995","unstructured":"Yao X. (1995) A new simulated annealing algorithm. International Journal of Computer Mathematics 56: 161\u2013168","journal-title":"International Journal of Computer Mathematics"},{"key":"427_CR40","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: 377\u2013396","journal-title":"European Journal of Operational Research"}],"container-title":["Journal of Intelligent Manufacturing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10845-010-0427-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10845-010-0427-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10845-010-0427-y","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,2]],"date-time":"2023-06-02T01:01:15Z","timestamp":1685667675000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10845-010-0427-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,7,11]]},"references-count":40,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2012,6]]}},"alternative-id":["427"],"URL":"https:\/\/doi.org\/10.1007\/s10845-010-0427-y","relation":{},"ISSN":["0956-5515","1572-8145"],"issn-type":[{"value":"0956-5515","type":"print"},{"value":"1572-8145","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,7,11]]}}}