{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,26]],"date-time":"2026-02-26T07:27:00Z","timestamp":1772090820216,"version":"3.50.1"},"reference-count":26,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2015,3,26]],"date-time":"2015-03-26T00:00:00Z","timestamp":1427328000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Optim Lett"],"published-print":{"date-parts":[[2016,3]]},"DOI":"10.1007\/s11590-015-0878-3","type":"journal-article","created":{"date-parts":[[2015,3,25]],"date-time":"2015-03-25T10:45:14Z","timestamp":1427280314000},"page":"511-525","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":82,"title":["Heuristic solutions for the vehicle routing problem with time windows and synchronized visits"],"prefix":"10.1007","volume":"10","author":[{"given":"Sohaib","family":"Afifi","sequence":"first","affiliation":[]},{"given":"Duc-Cuong","family":"Dang","sequence":"additional","affiliation":[]},{"given":"Aziz","family":"Moukrim","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,3,26]]},"reference":[{"key":"878_CR1","doi-asserted-by":"crossref","unstructured":"Afifi, S., Dang, D.C., Moukrim, A.: A simulated annealing algorithm for the vehicle routing problem with time windows and synchronization constraints. In: Proceedings of LION-7, Lecture Notes in Computer Science, vol. 7997, pp. 259\u2013265 (2013)","DOI":"10.1007\/978-3-642-44973-4_27"},{"issue":"2","key":"878_CR2","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1137\/0201008","volume":"1","author":"AV Aho","year":"1972","unstructured":"Aho, A.V., Garey, M.R., Ullman, J.D.: The transitive reduction of a directed graph. SIAM J. Comput. 1(2), 131\u2013137 (1972)","journal-title":"SIAM J. Comput."},{"issue":"2","key":"878_CR3","doi-asserted-by":"crossref","first-page":"286","DOI":"10.1016\/j.cie.2013.01.007","volume":"65","author":"R Ba\u00f1os","year":"2013","unstructured":"Ba\u00f1os, R., Ortega, J., Gil, C., M\u00e1rquez, A.L., De Toro, F.: A hybrid meta-heuristic for multi-objective vehicle routing problems with time windows. Comput. Ind. Eng. 65(2), 286\u2013296 (2013)","journal-title":"Comput. Ind. Eng."},{"issue":"5","key":"878_CR4","doi-asserted-by":"crossref","first-page":"1696","DOI":"10.1016\/j.eswa.2012.09.012","volume":"40","author":"R Ba\u00f1os","year":"2013","unstructured":"Ba\u00f1os, R., Ortega, J., Gil, C., Fernandez, A., De Toro, F.: A simulated annealing-based parallel multi-objective approach to vehicle routing problems with time windows. Expert Syst. Appl. 40(5), 1696\u20131707 (2013)","journal-title":"Expert Syst. Appl."},{"issue":"1","key":"878_CR5","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1007\/s10288-008-0094-4","volume":"8","author":"H Bouly","year":"2009","unstructured":"Bouly, H., Dang, D.C., Moukrim, A.: A memetic algorithm for the team orienteering problem. 4OR 8(1), 49\u201370 (2009)","journal-title":"4OR"},{"key":"878_CR6","doi-asserted-by":"crossref","unstructured":"Bredstr\u00f6m, D., R\u00f6nnqvist, M.: A branch and price algorithm for the combined vehicle routing and scheduling problem with synchronization constraints. NHH Dept of Finance and Management Science Discussion Paper (2007)","DOI":"10.2139\/ssrn.971726"},{"issue":"1","key":"878_CR7","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1016\/j.ejor.2007.07.033","volume":"191","author":"D Bredstr\u00f6m","year":"2008","unstructured":"Bredstr\u00f6m, D., R\u00f6nnqvist, M.: Combined vehicle routing and scheduling with temporal precedence and synchronization constraints. Eur. J. Oper. Res. 191(1), 19\u201331 (2008)","journal-title":"Eur. J. Oper. Res."},{"issue":"1","key":"878_CR8","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1007\/BF02601637","volume":"63","author":"WC Chiang","year":"1996","unstructured":"Chiang, W.C., Russell, R.A.: Simulated annealing metaheuristics for the vehicle routing problem with time windows. Ann. Oper. Res. 63(1), 3\u201327 (1996)","journal-title":"Ann. Oper. Res."},{"key":"878_CR9","doi-asserted-by":"crossref","unstructured":"Czech, Z., Czarnas, P.: Parallel simulated annealing for the vehicle routing problem with time windows. In: Proceedings of 10th Euromicro Workshop on Parallel, Distributed and Network-based Processing (2002)","DOI":"10.1109\/EMPDP.2002.994313"},{"issue":"2","key":"878_CR10","doi-asserted-by":"crossref","first-page":"332","DOI":"10.1016\/j.ejor.2013.02.049","volume":"229","author":"DC Dang","year":"2013","unstructured":"Dang, D.C., Guibadj, R.N., Moukrim, A.: An effective PSO-inspired algorithm for the team orienteering problem. Eur. J. Oper. Res. 229(2), 332\u2013344 (2013)","journal-title":"Eur. J. Oper. Res."},{"issue":"4","key":"878_CR11","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1002\/net.20472","volume":"58","author":"A Dohn","year":"2011","unstructured":"Dohn, A., Rasmussen, M.S., Larsen, J.: The Vehicle Routing Problem with Time Windows and Temporal Dependencies. Networks 58(4), 273\u2013289 (2011)","journal-title":"Networks"},{"issue":"3","key":"878_CR12","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1287\/trsc.1110.0400","volume":"46","author":"M Drexl","year":"2012","unstructured":"Drexl, M.: Synchronization in vehicle routing a survey of VRPs with multiple synchronization constraints. Transp. Sci. 46(3), 297\u2013316 (2012)","journal-title":"Transp. Sci."},{"issue":"3","key":"878_CR13","doi-asserted-by":"crossref","first-page":"666","DOI":"10.1016\/j.cor.2011.02.002","volume":"40","author":"N Hachemi El","year":"2013","unstructured":"El Hachemi, N., Gendreau, M., Rousseau, L.M.: A heuristic to solve the synchronized log-truck scheduling problem. Comput. Oper. Res. 40(3), 666\u2013673 (2013)","journal-title":"Comput. Oper. Res."},{"issue":"1\u20133","key":"878_CR14","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1007\/s10107-003-0395-5","volume":"98","author":"M Fischetti","year":"2003","unstructured":"Fischetti, M., Lodi, A.: Local branching. Math. Program. 98(1\u20133), 23\u201347 (2003)","journal-title":"Math. Program."},{"issue":"1","key":"878_CR15","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1016\/S0377-2217(98)00343-9","volume":"119","author":"I Ioachim","year":"1999","unstructured":"Ioachim, I., Desrosiers, J., Soumis, F., B\u00e9langer, N.: Fleet assignment and routing with schedule synchronization constraints. Eur. J. Oper. Res. 119(1), 75\u201390 (1999)","journal-title":"Eur. J. Oper. Res."},{"issue":"4598","key":"878_CR16","doi-asserted-by":"crossref","first-page":"671","DOI":"10.1126\/science.220.4598.671","volume":"220","author":"S Kirkpatrick","year":"1983","unstructured":"Kirkpatrick, S., Vecchi, M., et al.: Optimization by simmulated annealing. Science 220(4598), 671\u2013680 (1983)","journal-title":"Science"},{"issue":"2","key":"878_CR17","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1002\/net.3230110211","volume":"11","author":"JK Lenstra","year":"1981","unstructured":"Lenstra, J.K., Kan, A.: Complexity of vehicle routing and scheduling problems. Networks 11(2), 221\u2013227 (1981)","journal-title":"Networks"},{"issue":"4","key":"878_CR18","doi-asserted-by":"crossref","first-page":"302","DOI":"10.1002\/nav.20075","volume":"52","author":"Y Li","year":"2005","unstructured":"Li, Y., Lim, A., Rodrigues, B.: Manpower allocation with time windows and job-teaming constraints. Nav. Res. Logist. (NRL) 52(4), 302\u2013311 (2005)","journal-title":"Nav. Res. Logist. (NRL)"},{"issue":"2","key":"878_CR19","doi-asserted-by":"crossref","first-page":"158","DOI":"10.1287\/ijoc.8.2.158","volume":"8","author":"JY Potvin","year":"1996","unstructured":"Potvin, J.Y., Kervahut, T., Garcia, B.L., Rousseau, J.M.: The vehicle routing problem with time windows part I: tabu search. INFORMS J. Comput. 8(2), 158\u2013164 (1996)","journal-title":"INFORMS J. Comput."},{"issue":"3","key":"878_CR20","doi-asserted-by":"crossref","first-page":"598","DOI":"10.1016\/j.ejor.2011.10.048","volume":"219","author":"MS Rasmussen","year":"2012","unstructured":"Rasmussen, M.S., Justesen, T., Dohn, A., Larsen, J.: The home care crew scheduling problem: Preference-based visit clustering and temporal dependencies. Eur. J. Oper. Res. 219(3), 598\u2013610 (2012)","journal-title":"Eur. J. Oper. Res."},{"issue":"2","key":"878_CR21","doi-asserted-by":"crossref","first-page":"254","DOI":"10.1287\/opre.35.2.254","volume":"35","author":"MM Solomon","year":"1987","unstructured":"Solomon, M.M.: Algorithms for the vehicle routing and scheduling problems with time window constraints. Oper. Res. 35(2), 254\u2013265 (1987)","journal-title":"Oper. Res."},{"key":"878_CR22","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1287\/trsc.22.1.1","volume":"22","author":"MM Solomon","year":"1988","unstructured":"Solomon, M.M., Desrosiers, J.: Time window constrained routing and scheduling problems. Transp. Sci. 22, 1\u201313 (1988)","journal-title":"Transp. Sci."},{"issue":"2","key":"878_CR23","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1016\/j.jmsy.2011.04.005","volume":"30","author":"R Tavakkoli-Moghaddam","year":"2011","unstructured":"Tavakkoli-Moghaddam, R., Gazanfari, M., Alinaghian, M., Salamatbakhsh, A., Norouzi, N.: A new mathematical model for a competitive vehicle routing problem with time windows solved by simulated annealing. J. Manuf. Syst. 30(2), 83\u201392 (2011)","journal-title":"J. Manuf. Syst."},{"key":"878_CR24","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1137\/1.9780898718515.ch1","volume":"9","author":"P Toth","year":"2002","unstructured":"Toth, P., Vigo, D.: An overview of vehicle routing problems. Veh. Routing Probl. 9, 1\u201326 (2002)","journal-title":"Veh. Routing Probl."},{"issue":"3","key":"878_CR25","doi-asserted-by":"crossref","first-page":"480","DOI":"10.1016\/0377-2217(94)00064-J","volume":"86","author":"A Breedam Van","year":"1995","unstructured":"Van Breedam, A.: Improvement heuristics for the vehicle routing problem based on simulated annealing. Eur. J. Oper. Res. 86(3), 480\u2013490 (1995)","journal-title":"Eur. J. Oper. Res."},{"issue":"12","key":"878_CR26","doi-asserted-by":"crossref","first-page":"1708","DOI":"10.1057\/jors.2008.108","volume":"60","author":"M Wen","year":"2009","unstructured":"Wen, M., Larsen, J., Clausen, J., Cordeau, J.F., Laporte, G.: Vehicle routing with cross-docking. J. Oper. Res. Soc. 60(12), 1708\u20131718 (2009)","journal-title":"J. Oper. Res. Soc."}],"container-title":["Optimization Letters"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-015-0878-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11590-015-0878-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-015-0878-3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,22]],"date-time":"2019-08-22T07:39:01Z","timestamp":1566459541000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11590-015-0878-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,3,26]]},"references-count":26,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2016,3]]}},"alternative-id":["878"],"URL":"https:\/\/doi.org\/10.1007\/s11590-015-0878-3","relation":{},"ISSN":["1862-4472","1862-4480"],"issn-type":[{"value":"1862-4472","type":"print"},{"value":"1862-4480","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,3,26]]}}}