{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,21]],"date-time":"2025-11-21T06:12:33Z","timestamp":1763705553186,"version":"3.37.3"},"publisher-location":"Cham","reference-count":16,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030054526"},{"type":"electronic","value":"9783030054533"}],"license":[{"start":{"date-parts":[[2018,12,30]],"date-time":"2018-12-30T00:00:00Z","timestamp":1546128000000},"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-05453-3_13","type":"book-chapter","created":{"date-parts":[[2018,12,30]],"date-time":"2018-12-30T02:02:29Z","timestamp":1546135349000},"page":"274-289","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Integrated Route, Charging and Activity Planning for Whole Day Mobility with Electric Vehicles"],"prefix":"10.1007","author":[{"given":"Marek","family":"Cuch\u00fd","sequence":"first","affiliation":[]},{"given":"Michal","family":"\u0160tolba","sequence":"additional","affiliation":[]},{"given":"Michal","family":"Jakob","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,12,30]]},"reference":[{"key":"13_CR1","doi-asserted-by":"crossref","unstructured":"Cuch\u00fd, M., \u0160tolba, M., Jakob, M.: Whole day mobility planning with electric vehicles. In: ICAART (2018)","DOI":"10.5220\/0006598501540164"},{"key":"13_CR2","doi-asserted-by":"crossref","first-page":"549","DOI":"10.1002\/nav.3800250314","volume":"25","author":"YP Aneja","year":"1978","unstructured":"Aneja, Y.P., Nair, K.P.K.: The constrained shortest path problem. Nav. Res. Logist. Q. 25, 549\u2013555 (1978)","journal-title":"Nav. Res. Logist. Q."},{"key":"13_CR3","first-page":"33","volume":"5","author":"G Desaulniers","year":"2006","unstructured":"Desaulniers, G.: Shortest path problems with resource constraints. Column Gener. 5, 33 (2006)","journal-title":"Column Gener."},{"key":"13_CR4","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1287\/trsc.23.1.1","volume":"23","author":"M Desrochers","year":"1989","unstructured":"Desrochers, M., Soumis, F.: A column generation approach to the urban transit crew scheduling problem. Transp. Sci. 23, 1\u201313 (1989)","journal-title":"Transp. Sci."},{"key":"13_CR5","doi-asserted-by":"crossref","unstructured":"Sachenbacher, M., Leucker, M., Artmeier, A., Haselmayr, J.: Efficient energy-optimal routing for electric vehicles. In: AAAI (2011)","DOI":"10.1609\/aaai.v25i1.7803"},{"key":"13_CR6","doi-asserted-by":"crossref","first-page":"100","DOI":"10.1109\/TSSC.1968.300136","volume":"4","author":"PE Hart","year":"1968","unstructured":"Hart, P.E., Nilsson, N.J., Raphael, B.: A formal basis for the heuristic determination of minimum cost paths. IEEE Trans. Syst. Sci. Cybern. 4, 100\u2013107 (1968)","journal-title":"IEEE Trans. Syst. Sci. Cybern."},{"key":"13_CR7","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF01582008","volume":"33","author":"G Cornu\u00e9jols","year":"1985","unstructured":"Cornu\u00e9jols, G., Fonlupt, J., Naddef, D.: The traveling salesman problem on a graph and some related integer polyhedra. Math. Program. 33, 1\u201327 (1985)","journal-title":"Math. Program."},{"key":"13_CR8","doi-asserted-by":"crossref","unstructured":"Rice, M.N., Tsotras, V.J.: Parameterized algorithms for generalized traveling salesman problems in road networks. In: Proceedings of the 21st ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems, SIGSPATIAL 2013, New York, NY, USA, pp. 114\u2013123. ACM (2013)","DOI":"10.1145\/2525314.2525342"},{"key":"13_CR9","doi-asserted-by":"crossref","first-page":"431","DOI":"10.1007\/s00224-007-1347-x","volume":"41","author":"HJ Bockenhauer","year":"2007","unstructured":"Bockenhauer, H.J., Hromkovic, J., Kneis, J., Kupke, J.: The parameterized approximability of TSP with deadlines. Theory Comput. Syst. 41, 431\u2013444 (2007)","journal-title":"Theory Comput. Syst."},{"key":"13_CR10","doi-asserted-by":"crossref","unstructured":"Pekny, J.F., Miller, D.L.: An exact parallel algorithm for the resource constrained traveling salesman problem with application to scheduling with an aggregate deadline. In: Proceedings of the 1990 ACM Annual Conference on Cooperation, pp. 208\u2013214. ACM (1990)","DOI":"10.1145\/100348.100380"},{"key":"13_CR11","doi-asserted-by":"crossref","first-page":"32","DOI":"10.1016\/j.tre.2016.01.010","volume":"89","author":"R Roberti","year":"2016","unstructured":"Roberti, R., Wen, M.: The electric traveling salesman problem with time windows. Transp. Res. Part E: Logist. Transp. Rev. 89, 32\u201352 (2016)","journal-title":"Transp. Res. Part E: Logist. Transp. Rev."},{"key":"13_CR12","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1007\/s10951-015-0428-y","volume":"19","author":"M Davari","year":"2016","unstructured":"Davari, M., Demeulemeester, E., Leus, R., Talla Nobibon, F.: Exact algorithms for single-machine scheduling with time windows and precedence constraints. J. Sched. 19, 309\u2013334 (2016)","journal-title":"J. Sched."},{"key":"13_CR13","doi-asserted-by":"crossref","unstructured":"Lawler, E.L., Lenstra, J.K., Kan, A.H.R., Shmoys, D.B.: Sequencing and scheduling: algorithms and complexity. In: Logistics of Production and Inventory, Handbooks in Operations Research and Management Science, vol. 4, pp. 445\u2013522. Elsevier (1993)","DOI":"10.1016\/S0927-0507(05)80189-6"},{"key":"13_CR14","doi-asserted-by":"crossref","first-page":"670","DOI":"10.1145\/358172.358406","volume":"26","author":"RP Loui","year":"1983","unstructured":"Loui, R.P.: Optimal paths in graphs with stochastic or multidimensional weights. Commun. ACM 26, 670\u2013676 (1983)","journal-title":"Commun. ACM"},{"key":"13_CR15","unstructured":"Mandow, L., De la Cruz, J.P., et al.: A new approach to multiobjective a* search. In: IJCAI, vol. 8 (2005)"},{"key":"13_CR16","first-page":"100","volume":"28","author":"JA Hartigan","year":"1979","unstructured":"Hartigan, J.A., Wong, M.A.: Algorithm AS 136: a k-means clustering algorithm. J. Roy. Stat. Soc. Ser. C (Appl. Stat.) 28, 100\u2013108 (1979)","journal-title":"J. Roy. Stat. Soc. Ser. C (Appl. Stat.)"}],"container-title":["Lecture Notes in Computer Science","Agents and Artificial Intelligence"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-05453-3_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,9,12]],"date-time":"2023-09-12T15:05:44Z","timestamp":1694531144000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-05453-3_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,12,30]]},"ISBN":["9783030054526","9783030054533"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-05453-3_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018,12,30]]},"assertion":[{"value":"ICAART","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Agents and Artificial Intelligence","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Funchal","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Portugal","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16 January 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 January 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"icaart2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.icaart.org\/?y=2018","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"}},{"value":"Primoris","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"161","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"45","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"42","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"28% - 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":"4","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"26 Posters","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}}]}}