{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,5]],"date-time":"2026-06-05T03:46:12Z","timestamp":1780631172582,"version":"3.54.1"},"publisher-location":"Cham","reference-count":20,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030300470","type":"print"},{"value":"9783030300487","type":"electronic"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"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":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-30048-7_4","type":"book-chapter","created":{"date-parts":[[2019,9,22]],"date-time":"2019-09-22T23:03:06Z","timestamp":1569193386000},"page":"54-70","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":9,"title":["Vehicle Routing by Learning from Historical Solutions"],"prefix":"10.1007","author":[{"given":"Rocsildes","family":"Canoy","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Tias","family":"Guns","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2019,9,23]]},"reference":[{"key":"4_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"12","DOI":"10.1007\/978-3-642-23786-7_4","volume-title":"Principles and Practice of Constraint Programming \u2013 CP 2011","author":"N Beldiceanu","year":"2011","unstructured":"Beldiceanu, N., Simonis, H.: A constraint seeker: finding and ranking global constraints from examples. In: Lee, J. (ed.) CP 2011. LNCS, vol. 6876, pp. 12\u201326. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-23786-7_4"},{"key":"4_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1007\/978-3-642-33558-7_13","volume-title":"Principles and Practice of Constraint Programming","author":"N Beldiceanu","year":"2012","unstructured":"Beldiceanu, N., Simonis, H.: A model seeker: extracting global constraint models from positive examples. In: Milano, M. (ed.) CP 2012. LNCS, pp. 141\u2013157. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-33558-7_13"},{"key":"4_CR3","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1016\/j.artint.2015.08.001","volume":"244","author":"C Bessiere","year":"2017","unstructured":"Bessiere, C., Koriche, F., Lazaar, N., O\u2019Sullivan, B.: Constraint acquisition. Artif. Intell. 244, 315\u2013342 (2017)","journal-title":"Artif. Intell."},{"issue":"2","key":"4_CR4","doi-asserted-by":"crossref","first-page":"32","DOI":"10.1145\/2666003","volume":"47","author":"J Caceres-Cruz","year":"2015","unstructured":"Caceres-Cruz, J., Arias, P., Guimarans, D., Riera, D., Juan, A.A.: Rich vehicle routing problem: survey. ACM Comput. Surv. (CSUR) 47(2), 32 (2015)","journal-title":"ACM Comput. Surv. (CSUR)"},{"issue":"4","key":"4_CR5","doi-asserted-by":"publisher","first-page":"359","DOI":"10.1006\/csla.1999.0128","volume":"13","author":"SF Chen","year":"1999","unstructured":"Chen, S.F., Goodman, J.: An empirical study of smoothing techniques for language modeling. Comput. Speech Lang. 13(4), 359\u2013394 (1999)","journal-title":"Comput. Speech Lang."},{"issue":"1","key":"4_CR6","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1287\/mnsc.6.1.80","volume":"6","author":"GB Dantzig","year":"1959","unstructured":"Dantzig, G.B., Ramser, J.H.: The truck dispatching problem. Manage. Sci. 6(1), 80\u201391 (1959)","journal-title":"Manage. Sci."},{"key":"4_CR7","unstructured":"Deguchi, Y., Kuroda, K., Shouji, M., Kawabe, T.: HEV charge\/discharge control system based on navigation information. Technical report, SAE Technical Paper (2004)"},{"key":"4_CR8","doi-asserted-by":"publisher","first-page":"71","DOI":"10.3389\/frobt.2017.00071","volume":"4","author":"P Dragone","year":"2018","unstructured":"Dragone, P., Teso, S., Passerini, A.: Constructive preference elicitation. Front. Robot. AI 4, 71 (2018)","journal-title":"Front. Robot. AI"},{"issue":"1\u20132","key":"4_CR9","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1007\/s12159-012-0080-2","volume":"5","author":"M Drexl","year":"2012","unstructured":"Drexl, M.: Rich vehicle routing in theory and practice. Logistics Res. 5(1\u20132), 47\u201363 (2012)","journal-title":"Logistics Res."},{"issue":"4","key":"4_CR10","doi-asserted-by":"publisher","first-page":"44","DOI":"10.1145\/2523813","volume":"46","author":"J Gama","year":"2014","unstructured":"Gama, J., \u017dliobait\u0117, I., Bifet, A., Pechenizkiy, M., Bouchachia, A.: A survey on concept drift adaptation. ACM Comput. Surv. (CSUR) 46(4), 44 (2014)","journal-title":"ACM Comput. Surv. (CSUR)"},{"issue":"164","key":"4_CR11","doi-asserted-by":"publisher","first-page":"409","DOI":"10.1093\/mind\/XLI.164.409","volume":"41","author":"WE Johnson","year":"1932","unstructured":"Johnson, W.E.: Probability: the deductive and inductive problems. Mind 41(164), 409\u2013423 (1932)","journal-title":"Mind"},{"key":"4_CR12","doi-asserted-by":"crossref","unstructured":"Krumm, J.: A Markov model for driver turn prediction. In: Withrow, l.L. (eds.) SAE 2008 World Congress, Distinguished Speaker Award, April 2008","DOI":"10.4271\/2008-01-0195"},{"issue":"8","key":"4_CR13","doi-asserted-by":"publisher","first-page":"811","DOI":"10.1002\/nav.20261","volume":"54","author":"G Laporte","year":"2007","unstructured":"Laporte, G.: What you should know about the vehicle routing problem. Naval Res. Logistics (NRL) 54(8), 811\u2013819 (2007)","journal-title":"Naval Res. Logistics (NRL)"},{"issue":"03","key":"4_CR14","doi-asserted-by":"publisher","first-page":"455","DOI":"10.1142\/S0218213002000988","volume":"11","author":"HC Lau","year":"2002","unstructured":"Lau, H.C., Liang, Z.: Pickup and delivery with time windows: algorithms and test case generation. Int. J. Artif. Intell. Tools 11(03), 455\u2013472 (2002)","journal-title":"Int. J. Artif. Intell. Tools"},{"key":"4_CR15","unstructured":"Munari, P., Dollevoet, T., Spliet, R.: A generalized formulation for vehicle routing problems. arXiv preprint arXiv:1606.01935 (2016)"},{"key":"4_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"405","DOI":"10.1007\/978-3-319-44953-1_26","volume-title":"Principles and Practice of Constraint Programming","author":"\u00c9 Picard-Cantin","year":"2016","unstructured":"Picard-Cantin, \u00c9., Bouchard, M., Quimper, C.-G., Sweeney, J.: Learning parameters for the sequence constraint from solutions. In: Rueher, M. (ed.) CP 2016. LNCS, vol. 9892, pp. 405\u2013420. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-44953-1_26"},{"issue":"4","key":"4_CR17","doi-asserted-by":"publisher","first-page":"371","DOI":"10.1016\/0305-0548(93)90081-S","volume":"20","author":"JY Potvin","year":"1993","unstructured":"Potvin, J.Y., Dufour, G., Rousseau, J.M.: Learning vehicle dispatching with linear programming models. Comput. Oper. Res. 20(4), 371\u2013380 (1993)","journal-title":"Comput. Oper. Res."},{"key":"4_CR18","doi-asserted-by":"publisher","first-page":"284","DOI":"10.1016\/j.procs.2015.07.305","volume":"53","author":"X Wang","year":"2015","unstructured":"Wang, X., et al.: Building efficient probability transition matrix using machine learning from big data for personalized route prediction. Procedia Comput. Sci. 53, 284\u2013291 (2015)","journal-title":"Procedia Comput. Sci."},{"key":"4_CR19","first-page":"12","volume":"2015","author":"N Ye","year":"2015","unstructured":"Ye, N., Wang, Z., Malekian, R., Lin, Q., Wang, R.: A method for driving route predictions based on hidden markov model. Math. Problems Eng. 2015, 12 (2015)","journal-title":"Math. Problems Eng."},{"key":"4_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"244","DOI":"10.1007\/978-3-319-59776-8_20","volume-title":"Integration of AI and OR Techniques in Constraint Programming","author":"M Yu","year":"2017","unstructured":"Yu, M., Nagarajan, V., Shen, S.: Minimum makespan vehicle routing problem with compatibility constraints. In: Salvagnin, D., Lombardi, M. (eds.) CPAIOR 2017. LNCS, vol. 10335, pp. 244\u2013253. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-59776-8_20"}],"container-title":["Lecture Notes in Computer Science","Principles and Practice of Constraint Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-30048-7_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,1,21]],"date-time":"2021-01-21T22:53:22Z","timestamp":1611269602000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-30048-7_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030300470","9783030300487"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-30048-7_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"23 September 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CP","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Principles and Practice of Constraint Programming","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Stamford, CT","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30 September 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"4 October 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cp2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/cp2019.a4cp.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"118","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"46","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"39% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3.2","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"4","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}