{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,2]],"date-time":"2025-11-02T16:52:57Z","timestamp":1762102377292,"version":"3.40.3"},"publisher-location":"Cham","reference-count":31,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030192112"},{"type":"electronic","value":"9783030192129"}],"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-19212-9_9","type":"book-chapter","created":{"date-parts":[[2019,5,20]],"date-time":"2019-05-20T14:32:32Z","timestamp":1558362752000},"page":"129-145","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":9,"title":["A Constraint Programming Approach to Electric Vehicle Routing with Time Windows"],"prefix":"10.1007","author":[{"given":"Kyle E. C.","family":"Booth","sequence":"first","affiliation":[]},{"given":"J. Christopher","family":"Beck","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,4,28]]},"reference":[{"key":"9_CR1","doi-asserted-by":"publisher","first-page":"452","DOI":"10.1016\/j.trpro.2014.10.026","volume":"3","author":"A Afroditi","year":"2014","unstructured":"Afroditi, A., Boile, M., Theofanis, S., Sdoukopoulos, E., Margaritis, D.: Electric vehicle routing problem with industry constraints: trends and insights for future research. Transp. Res. Procedia 3, 452\u2013459 (2014)","journal-title":"Transp. Res. Procedia"},{"key":"9_CR2","unstructured":"Beck, J.C., Prosser, P., Selensky, E.: Vehicle routing and job shop scheduling: What\u2019s the difference? In: International Conference on Automated Planning and Scheduling, pp. 267\u2013276 (2003)"},{"issue":"3","key":"9_CR3","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1287\/ijoc.1110.0454","volume":"24","author":"G Berbeglia","year":"2012","unstructured":"Berbeglia, G., Cordeau, J.F., Laporte, G.: A hybrid tabu search and constraint programming algorithm for the dynamic dial-a-ride problem. INFORMS J. Comput. 24(3), 343\u2013355 (2012)","journal-title":"INFORMS J. Comput."},{"key":"9_CR4","doi-asserted-by":"crossref","unstructured":"Booth, K.E.C., Do, M., Beck, J.C., Rieffel, E., Venturelli, D., Frank, J.: Comparing and integrating constraint programming and temporal planning for quantum circuit compilation. In: International Conference on Automated Planning and Scheduling, pp. 366\u2013374. AAAI Press (2018)","DOI":"10.1609\/icaps.v28i1.13920"},{"key":"9_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"539","DOI":"10.1007\/978-3-319-44953-1_34","volume-title":"Principles and Practice of Constraint Programming","author":"KEC Booth","year":"2016","unstructured":"Booth, K.E.C., Nejat, G., Beck, J.C.: A constraint programming approach to multi-robot task allocation and scheduling in retirement homes. In: Rueher, M. (ed.) CP 2016. LNCS, vol. 9892, pp. 539\u2013555. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-44953-1_34"},{"issue":"1","key":"9_CR6","doi-asserted-by":"publisher","first-page":"500","DOI":"10.1109\/LRA.2016.2522096","volume":"1","author":"KEC Booth","year":"2016","unstructured":"Booth, K.E.C., Tran, T.T., Nejat, G., Beck, J.C.: Mixed-integer and constraint programming techniques for mobile robot task planning. IEEE Robot. Autom. Lett. 1(1), 500\u2013507 (2016)","journal-title":"IEEE Robot. Autom. Lett."},{"key":"9_CR7","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1016\/j.endm.2014.11.029","volume":"47","author":"M Bruglieri","year":"2015","unstructured":"Bruglieri, M., Pezzella, F., Pisacane, O., Suraci, S.: A variable neighborhood search branching for the electric vehicle routing problem with time windows. Electron. Notes Discret. Math. 47, 221\u2013228 (2015)","journal-title":"Electron. Notes Discret. Math."},{"key":"9_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"490","DOI":"10.1007\/978-3-319-98334-9_32","volume-title":"Principles and Practice of Constraint Programming","author":"Q Cappart","year":"2018","unstructured":"Cappart, Q., Thomas, C., Schaus, P., Rousseau, L.-M.: A constraint programming approach for solving patient transportation problems. In: Hooker, J. (ed.) CP 2018. LNCS, vol. 11008, pp. 490\u2013506. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-98334-9_32"},{"issue":"3","key":"9_CR9","doi-asserted-by":"publisher","first-page":"671","DOI":"10.1016\/j.ejor.2011.11.010","volume":"219","author":"R Dekker","year":"2012","unstructured":"Dekker, R., Bloemhof, J., Mallidis, I.: Operations research for green logistics-an overview of aspects, issues, contributions and challenges. Eur. J. Oper. Res. 219(3), 671\u2013679 (2012)","journal-title":"Eur. J. Oper. Res."},{"issue":"6","key":"9_CR10","doi-asserted-by":"publisher","first-page":"1388","DOI":"10.1287\/opre.2016.1535","volume":"64","author":"G Desaulniers","year":"2016","unstructured":"Desaulniers, G., Errico, F., Irnich, S., Schneider, M.: Exact algorithms for electric vehicle-routing problems with time windows. Oper. Res. 64(6), 1388\u20131405 (2016)","journal-title":"Oper. Res."},{"issue":"2","key":"9_CR11","doi-asserted-by":"publisher","first-page":"318","DOI":"10.1007\/s10601-015-9182-1","volume":"21","author":"L Gaspero Di","year":"2016","unstructured":"Di Gaspero, L., Rendl, A., Urli, T.: Balancing bike sharing systems with constraint programming. Constraints 21(2), 318\u2013348 (2016)","journal-title":"Constraints"},{"issue":"1","key":"9_CR12","doi-asserted-by":"publisher","first-page":"100","DOI":"10.1016\/j.tre.2011.08.001","volume":"48","author":"S Erdo\u011fan","year":"2012","unstructured":"Erdo\u011fan, S., Miller-Hooks, E.: A green vehicle routing problem. Transp. Res. Part E: Logist. Transp. Rev. 48(1), 100\u2013114 (2012)","journal-title":"Transp. Res. Part E: Logist. Transp. Rev."},{"key":"9_CR13","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1016\/j.tre.2014.09.003","volume":"71","author":"\u00c1 Felipe","year":"2014","unstructured":"Felipe, \u00c1., Ortu\u00f1o, M.T., Righini, G., Tirado, G.: A heuristic approach for the green vehicle routing problem with multiple technologies and partial recharges. Transp. Res. Part E: Logist. Transp. Rev. 71, 111\u2013128 (2014)","journal-title":"Transp. Res. Part E: Logist. Transp. Rev."},{"key":"9_CR14","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1016\/j.trc.2012.06.007","volume":"26","author":"W Feng","year":"2013","unstructured":"Feng, W., Figliozzi, M.: An economic and technological analysis of the key factors affecting the competitiveness of electric commercial vehicles: a case study from the usa market. Transp. Res. Part C: Emerg. Technol. 26, 135\u2013145 (2013)","journal-title":"Transp. Res. Part C: Emerg. Technol."},{"key":"9_CR15","doi-asserted-by":"publisher","first-page":"178","DOI":"10.1016\/j.cie.2017.03.017","volume":"107","author":"R Gedik","year":"2017","unstructured":"Gedik, R., Kirac, E., Milburn, A.B., Rainwater, C.: A constraint programming approach for the team orienteering problem with time windows. Comput. Ind. Eng. 107, 178\u2013195 (2017)","journal-title":"Comput. Ind. Eng."},{"issue":"9","key":"9_CR16","doi-asserted-by":"publisher","first-page":"939","DOI":"10.1177\/0278364904045564","volume":"23","author":"BP Gerkey","year":"2004","unstructured":"Gerkey, B.P., Matari\u0107, M.J.: A formal analysis and taxonomy of task allocation in multi-robot systems. Int. J. Robot. Res. 23(9), 939\u2013954 (2004)","journal-title":"Int. J. Robot. Res."},{"issue":"3","key":"9_CR17","doi-asserted-by":"publisher","first-page":"995","DOI":"10.1016\/j.ejor.2016.01.038","volume":"252","author":"G Hiermann","year":"2016","unstructured":"Hiermann, G., Puchinger, J., Ropke, S., Hartl, R.F.: The electric fleet size and mix vehicle routing problem with time windows and recharging stations. Eur. J. Oper. Res. 252(3), 995\u20131018 (2016)","journal-title":"Eur. J. Oper. Res."},{"key":"9_CR18","unstructured":"de Jong, C., Kant, G., Van Vlient, A.: On finding minimal route duration in the vehicle routing problem with multiple time windows. Department of Computer Science, Utrecht University, Holland, Manuscript (1996)"},{"key":"9_CR19","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1016\/j.trc.2016.01.013","volume":"65","author":"M Keskin","year":"2016","unstructured":"Keskin, M., \u00c7atay, B.: Partial recharge strategies for the electric vehicle routing problem with time windows. Transp. Res. Part C: Emerg. Technol. 65, 111\u2013127 (2016)","journal-title":"Transp. Res. Part C: Emerg. Technol."},{"key":"9_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1007\/978-3-319-33954-2_17","volume-title":"Integration of AI and OR Techniques in Constraint Programming","author":"J Kinable","year":"2016","unstructured":"Kinable, J., van Hoeve, W.-J., Smith, S.F.: Optimization models for a real-world snow plow routing problem. In: Quimper, C.-G. (ed.) CPAIOR 2016. LNCS, vol. 9676, pp. 229\u2013245. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-33954-2_17"},{"key":"9_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"148","DOI":"10.1007\/978-3-642-01929-6_12","volume-title":"Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems","author":"P Laborie","year":"2009","unstructured":"Laborie, P.: IBM ILOG CP optimizer for detailed scheduling illustrated on three problems. In: van Hoeve, W.-J., Hooker, J.N. (eds.) CPAIOR 2009. LNCS, vol. 5547, pp. 148\u2013162. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-01929-6_12"},{"issue":"2","key":"9_CR22","doi-asserted-by":"publisher","first-page":"210","DOI":"10.1007\/s10601-018-9281-x","volume":"23","author":"P Laborie","year":"2018","unstructured":"Laborie, P., Rogerie, J., Shaw, P., Vil\u00edm, P.: IBM ILOG CP Optimizer for scheduling. Constraints 23(2), 210\u2013250 (2018)","journal-title":"Constraints"},{"key":"9_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"654","DOI":"10.1007\/978-3-319-23219-5_45","volume-title":"Principles and Practice of Constraint Programming","author":"E Lam","year":"2015","unstructured":"Lam, E., Van Hentenryck, P., Kilby, P.: Joint vehicle and crew routing and scheduling. In: Pesant, G. (ed.) CP 2015. LNCS, vol. 9255, pp. 654\u2013670. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-23219-5_45"},{"issue":"4","key":"9_CR24","doi-asserted-by":"publisher","first-page":"1118","DOI":"10.1016\/j.eswa.2013.07.107","volume":"41","author":"C Lin","year":"2014","unstructured":"Lin, C., Choy, K.L., Ho, G.T., Chung, S.H., Lam, H.: Survey of green vehicle routing problem: past and future trends. Expert Syst. Appl. 41(4), 1118\u20131138 (2014)","journal-title":"Expert Syst. Appl."},{"key":"9_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"412","DOI":"10.1007\/978-3-319-93031-2_30","volume-title":"Integration of Constraint Programming, Artificial Intelligence, and Operations Research","author":"C Liu","year":"2018","unstructured":"Liu, C., Aleman, D.M., Beck, J.C.: Modelling and solving the senior transportation problem. In: van Hoeve, W.-J. (ed.) CPAIOR 2018. LNCS, vol. 10848, pp. 412\u2013428. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-93031-2_30"},{"key":"9_CR26","doi-asserted-by":"publisher","first-page":"2978","DOI":"10.1016\/j.sbspro.2012.06.1265","volume":"48","author":"A Lu\u00e8","year":"2012","unstructured":"Lu\u00e8, A., Colorni, A., Nocerino, R., Paruscio, V.: Green move: an innovative electric vehicle-sharing system. Procedia-Soc. Behav. Sci. 48, 2978\u20132987 (2012)","journal-title":"Procedia-Soc. Behav. Sci."},{"key":"9_CR27","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1016\/j.trb.2017.02.004","volume":"103","author":"A Montoya","year":"2017","unstructured":"Montoya, A., Gu\u00e9ret, C., Mendoza, J.E., Villegas, J.G.: The electric vehicle routing problem with nonlinear charging function. Transp. Res. Part B: Methodol. 103, 87\u2013110 (2017)","journal-title":"Transp. Res. Part B: Methodol."},{"key":"9_CR28","doi-asserted-by":"publisher","first-page":"122","DOI":"10.1016\/j.trd.2014.10.010","volume":"34","author":"Z Rezvani","year":"2015","unstructured":"Rezvani, Z., Jansson, J., Bodin, J.: Advances in consumer electric vehicle adoption research: a review and research agenda. Transp. Res. Part D: Transport Environ. 34, 122\u2013136 (2015)","journal-title":"Transp. Res. Part D: Transport Environ."},{"issue":"4","key":"9_CR29","doi-asserted-by":"publisher","first-page":"500","DOI":"10.1287\/trsc.2013.0490","volume":"48","author":"M Schneider","year":"2014","unstructured":"Schneider, M., Stenger, A., Goeke, D.: The electric vehicle-routing problem with time windows and recharging stations. Transp. Sci. 48(4), 500\u2013520 (2014)","journal-title":"Transp. Sci."},{"key":"9_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"417","DOI":"10.1007\/3-540-49481-2_30","volume-title":"Principles and Practice of Constraint Programming \u2014 CP98","author":"P Shaw","year":"1998","unstructured":"Shaw, P.: Using constraint programming and local search methods to solve vehicle routing problems. In: Maher, M., Puget, J.-F. (eds.) CP 1998. LNCS, vol. 1520, pp. 417\u2013431. Springer, Heidelberg (1998). https:\/\/doi.org\/10.1007\/3-540-49481-2_30"},{"key":"9_CR31","unstructured":"Vali, M., Salimifard, K.: A constraint programming approach for solving multiple traveling salesman problem. In: The Sixteenth International Workshop on Constraint Modelling and Reformulation (2017)"}],"container-title":["Lecture Notes in Computer Science","Integration of Constraint Programming, Artificial Intelligence, and Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-19212-9_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,9,16]],"date-time":"2023-09-16T19:18:41Z","timestamp":1694891921000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-19212-9_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030192112","9783030192129"],"references-count":31,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-19212-9_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"28 April 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CPAIOR","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Integration of Constraint Programming, Artificial Intelligence, and Operations Research","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Thessaloniki","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Greece","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":"4 June 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7 June 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cpaior2019b","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/cpaior2019.uowm.gr\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"easychair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"94","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"34","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"9","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"36% - 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"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"5.67","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}}]}}