{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,10]],"date-time":"2025-09-10T22:14:41Z","timestamp":1757542481545},"publisher-location":"Cham","reference-count":23,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319962917"},{"type":"electronic","value":"9783319962924"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-319-96292-4_25","type":"book-chapter","created":{"date-parts":[[2018,8,13]],"date-time":"2018-08-13T14:29:34Z","timestamp":1534170574000},"page":"312-325","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Multiobjective Local Search Based Hybrid Algorithm for Vehicle Routing Problem with Soft Time Windows"],"prefix":"10.1007","author":[{"given":"Bouziyane","family":"Bouchra","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dkhissi","family":"Btissam","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Cherkaoui","family":"Mohammad","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,8,14]]},"reference":[{"key":"25_CR1","volume-title":"Vehicle Routing: Methods and Studies","author":"M Desrochers","year":"1988","unstructured":"Desrochers, M., Lenstra, J.K., Savelsbergh, M.W.S., Soumis, F.: Vehicle routing with time windows: optimization and approxinmation. In: Golden, B., Assad, A. (eds.) Vehicle Routing: Methods and Studies. Elsevier Science Publishers, Amsterdam (1988)"},{"key":"25_CR2","doi-asserted-by":"publisher","first-page":"803","DOI":"10.1287\/opre.34.5.803","volume":"34","author":"BL Golden","year":"1986","unstructured":"Golden, B.L., Assad, A.A.: Perspectives on Vehicle Routing: Exciting New Developments. Oper. Res. 34, 803\u2013809 (1986)","journal-title":"Oper. Res."},{"key":"25_CR3","volume-title":"Vehicle Routing: Methods and Studies","author":"BL Golden","year":"1988","unstructured":"Golden, B.L., Assad, A.A.: Vehicle Routing: Methods and Studies. Elsevier Science Publishers, Amsterdam (1988)"},{"key":"25_CR4","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1287\/trsc.22.1.1","volume":"22","author":"MM Soloman","year":"1988","unstructured":"Soloman, M.M., Desrosiers, J.: Time window constrained routing and scheduling problems. Transp. Sci. 22, 1\u201313 (1988)","journal-title":"Transp. Sci."},{"key":"25_CR5","doi-asserted-by":"publisher","first-page":"723","DOI":"10.1016\/j.trc.2010.07.008","volume":"19","author":"A Bettinelli","year":"2011","unstructured":"Bettinelli, A., Ceselli, A., Righini, G.: A branch-and-cut-and-price algorithm for the multi-depot heterogeneous vehicle routing problem with time windows. Transp. Res. Part C: Emerg. Technol. 19, 723\u2013740 (2011)","journal-title":"Transp. Res. Part C: Emerg. Technol."},{"key":"25_CR6","doi-asserted-by":"publisher","first-page":"435","DOI":"10.1016\/j.eswa.2010.06.082","volume":"38","author":"B Yu","year":"2011","unstructured":"Yu, B., Yang, Z.Z., Yao, B.Z.: A hybrid algorithm for vehicle routing problem with time windows. Expert Syst. Appl. 38, 435\u2013441 (2011)","journal-title":"Expert Syst. Appl."},{"key":"25_CR7","doi-asserted-by":"publisher","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.: The vehicle routing problem with flexible time windows and traveling times. Discrete Appl. Math. 154, 2271\u20132290 (2006)","journal-title":"Discrete Appl. Math."},{"key":"25_CR8","doi-asserted-by":"publisher","first-page":"1298","DOI":"10.1057\/palgrave.jors.2601791","volume":"55","author":"WC Chiang","year":"2004","unstructured":"Chiang, W.C., Russell, R.A.: A metaheuristic for the vehicle-routing problem with soft time windows. J. Oper. Res. Soc. 55, 1298\u20131310 (2004)","journal-title":"J. Oper. Res. Soc."},{"key":"25_CR9","doi-asserted-by":"publisher","first-page":"663","DOI":"10.1057\/palgrave.jors.2602371","volume":"59","author":"Z Fu","year":"2008","unstructured":"Fu, Z., Eglese, R., Li, L.Y.: A unified tabu search algorithm for vehicle routing problems with soft time windows. J. Oper. Res. Soc. 59, 663\u2013673 (2008)","journal-title":"J. Oper. Res. Soc."},{"issue":"5","key":"25_CR10","doi-asserted-by":"publisher","first-page":"668","DOI":"10.1016\/j.trc.2009.08.005","volume":"18","author":"A Figliozzi","year":"2010","unstructured":"Figliozzi, A.: An iterative route construction and improvement algorithm for the vehicle routing problem with soft time windows. Transp. Res. Part C: Emerg. Technol. 18(5), 668\u2013679 (2010)","journal-title":"Transp. Res. Part C: Emerg. Technol."},{"key":"25_CR11","series-title":"Operations Research Proceedings","doi-asserted-by":"publisher","first-page":"481","DOI":"10.1007\/978-3-319-28697-6_67","volume-title":"Operations Research Proceedings 2014","author":"M Salani","year":"2016","unstructured":"Salani, M., Battarra, M., Gambardella, L.M.: Exact algorithms for the vehicle routing problem with soft time windows. In: L\u00fcbbecke, M., Koster, A., Letmathe, P., Madlener, R., Peis, B., Walther, G. (eds.) Operations Research Proceedings 2014. ORP, pp. 481\u2013486. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-28697-6_67"},{"key":"25_CR12","doi-asserted-by":"crossref","unstructured":"Setak, M., Azizi, V., Karimi, H., Jalili, S.: Pickup and delivery supply chain network with semi soft time windows: metaheuristic approach. Int. J. Manag. Sci. Eng. Manag. 1\u20137 (2016)","DOI":"10.1080\/17509653.2015.1136247"},{"issue":"22","key":"25_CR13","doi-asserted-by":"publisher","first-page":"5410","DOI":"10.3923\/jas.2013.5410.5415","volume":"13","author":"W Qiuyun","year":"2013","unstructured":"Qiuyun, W., Wenbao, J., Gang, Z.: A novel model and algorithm for solving dynamic vehicle routing problem on goods distribution. J. Appl. Sci. 13(22), 5410\u20135415 (2013)","journal-title":"J. Appl. Sci."},{"issue":"2","key":"25_CR14","doi-asserted-by":"publisher","first-page":"182","DOI":"10.1109\/4235.996017","volume":"6","author":"K Deb","year":"2002","unstructured":"Deb, K., Pratap, A., Agarwal, S., Meyarivan, T.: A fast and elitist multiobjective genetic algorithm: NSGA-II. IEEE Trans. Evol. Comput. 6(2), 182\u2013197 (2002)","journal-title":"IEEE Trans. Evol. Comput."},{"key":"25_CR15","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1007\/s10489-006-6926-z","volume":"24","author":"B Ombuki","year":"2006","unstructured":"Ombuki, B., Ross, B.J., Hanshar, F.: Multi-objective genetic algorithms for vehicle routing problem with time windows. Appl. Intell. 24, 17\u201330 (2006)","journal-title":"Appl. Intell."},{"key":"25_CR16","doi-asserted-by":"publisher","first-page":"1096","DOI":"10.1016\/j.asoc.2010.04.001","volume":"10","author":"K Ghoseiri","year":"2010","unstructured":"Ghoseiri, K., Ghannadpour, S.F.: Multi-objective vehicle routing problem with time windows using goal programming and genetic algorithm. Appl. Soft Comput. 10, 1096\u20131107 (2010)","journal-title":"Appl. Soft Comput."},{"key":"25_CR17","doi-asserted-by":"publisher","first-page":"2176","DOI":"10.1016\/j.proeng.2014.12.461","volume":"97","author":"V Sivaram Kumar","year":"2014","unstructured":"Sivaram Kumar, V., Thansekharb, M.R., Saravananc, R., Miruna Joe Amalid, S.: Solving multi-objective vehicle routing problem with time windows by FAGA. Procedia Eng. 97, 2176\u20132185 (2014)","journal-title":"Procedia Eng."},{"issue":"1","key":"25_CR18","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1016\/j.cor.2010.05.004","volume":"38","author":"AG Najera","year":"2011","unstructured":"Najera, A.G., Bullinariaa, J.A.: An improved multi-objective evolutionary algorithm for the vehicle routing problem with time windows. Comput. Oper. Res. 38(1), 287\u2013300 (2011)","journal-title":"Comput. Oper. Res."},{"key":"25_CR19","first-page":"2671","volume":"2","author":"B Minocha","year":"2011","unstructured":"Minocha, B., Tripathi, S.: Solution of time constrained vehicle routing problems using multi-objective hybrid genetic algorithm. Int. J. Comput. Sci. Inf. Technol. 2, 2671\u20132676 (2011)","journal-title":"Int. J. Comput. Sci. Inf. Technol."},{"key":"25_CR20","doi-asserted-by":"publisher","first-page":"3089","DOI":"10.1016\/j.cor.2012.03.010","volume":"39","author":"F Tricoire","year":"2012","unstructured":"Tricoire, F.: Multi-directional local search. Comput. Oper. Res. 39, 3089\u20133101 (2012)","journal-title":"Comput. Oper. Res."},{"key":"25_CR21","doi-asserted-by":"publisher","first-page":"441","DOI":"10.1016\/j.ejor.2015.06.030","volume":"247","author":"A Kovacs","year":"2015","unstructured":"Kovacs, A., Parragh, S.N., Hartl, R.F.: The multi-objective generalized consistent vehicle routing problem. Eur. J. Oper. Res. 247, 441\u2013458 (2015)","journal-title":"Eur. J. Oper. Res."},{"key":"25_CR22","unstructured":"Geiger, M.J.: Randomized variable neighborhood search for multi objective optimization. In: 4th EU\/ME: Design and Evaluation of Advanced Hybrid Meta-Heuristics, pp. 34\u201342 (2004)"},{"issue":"3","key":"25_CR23","doi-asserted-by":"publisher","first-page":"582","DOI":"10.1109\/TCYB.2015.2409837","volume":"46","author":"J Wang","year":"2016","unstructured":"Wang, J., Zhou, Y., Wang, Y., Zhang, J., Chen, C.L.P., Zheng, Z.: Multiobjective vehicle routing problems with simultaneous delivery and pickup and time windows: formulation, instances, and algorithms. IEEE Trans. Cybern. 46(3), 582\u2013594 (2016)","journal-title":"IEEE Trans. Cybern."}],"container-title":["Communications in Computer and Information Science","Big Data, Cloud and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-96292-4_25","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,8,29]],"date-time":"2022-08-29T04:31:39Z","timestamp":1661747499000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-96292-4_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319962917","9783319962924"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-96292-4_25","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"type":"print","value":"1865-0929"},{"type":"electronic","value":"1865-0937"}],"subject":[],"published":{"date-parts":[[2018]]}}}