{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T00:53:40Z","timestamp":1740099220660,"version":"3.37.3"},"publisher-location":"Cham","reference-count":28,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030046477"},{"type":"electronic","value":"9783030046484"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"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":[[2018]]},"DOI":"10.1007\/978-3-030-04648-4_10","type":"book-chapter","created":{"date-parts":[[2018,11,17]],"date-time":"2018-11-17T00:53:52Z","timestamp":1542416032000},"page":"116-125","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Towards a New Evolutionary Algorithm for the Minimum Tollbooth Problem"],"prefix":"10.1007","author":[{"given":"Pavel","family":"Kr\u00f6mer","sequence":"first","affiliation":[]},{"given":"Jana","family":"Nowakov\u00e1","sequence":"additional","affiliation":[]},{"given":"Martin","family":"Hasal","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,11,18]]},"reference":[{"issue":"4","key":"10_CR1","doi-asserted-by":"publisher","first-page":"533","DOI":"10.1007\/s10898-010-9527-7","volume":"48","author":"L Bai","year":"2010","unstructured":"Bai, L., Hearn, D.W., Lawphongpanich, S.: A heuristic method for the minimum toll booth problem. J. Glob. Optim. 48(4), 533\u2013548 (2010)","journal-title":"J. Glob. Optim."},{"issue":"2","key":"10_CR2","first-page":"33","volume":"11","author":"L Bai","year":"2008","unstructured":"Bai, L., Stamps, M.T., Harwood, R.C., Kollmann, C.J.: An evolutionary method for the minimum toll booth problem: the methodology. J. Manag. Inf. Decis. Sci. 11(2), 33 (2008)","journal-title":"J. Manag. Inf. Decis. Sci."},{"key":"10_CR3","unstructured":"Balasch, J., Rial, A., Troncoso, C., Preneel, B., Verbauwhede, I., Geuens, C.: Pretp: privacy-preserving electronic toll pricing. In: USENIX Security Symposium, vol. 10, pp. 63\u201378 (2010)"},{"key":"10_CR4","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1016\/j.trb.2012.11.003","volume":"48","author":"XJ Ban","year":"2013","unstructured":"Ban, X.J., Ferris, M.C., Tang, L., Lu, S.: Risk-neutral second best toll pricing. Transp. Res. Part B Methodol. 48, 67\u201387 (2013)","journal-title":"Transp. Res. Part B Methodol."},{"key":"10_CR5","doi-asserted-by":"crossref","unstructured":"Basu, S., Lianeas, T., Nikolova, E.: New complexity results and algorithms for the minimum tollbooth problem. CoRR abs\/1509.07260 (2015)","DOI":"10.1007\/978-3-662-48995-6_7"},{"key":"10_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1007\/978-3-662-48995-6_7","volume-title":"Web and Internet Economics","author":"S Basu","year":"2015","unstructured":"Basu, S., Lianeas, T., Nikolova, E.: New complexity results and algorithms for the minimum tollbooth problem. In: Markakis, E., Sch\u00e4fer, G. (eds.) WINE 2015. LNCS, vol. 9470, pp. 89\u2013103. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-48995-6_7"},{"issue":"3","key":"10_CR7","first-page":"339","volume":"2","author":"GB Dantzig","year":"1954","unstructured":"Dantzig, G.B.: Letter to the editor - a comment on edie\u2019s \u201ctraffic delays at toll booths\u201d. J. Oper. Res. Soc. Am. 2(3), 339\u2013341 (1954)","journal-title":"J. Oper. Res. Soc. Am."},{"issue":"2","key":"10_CR8","first-page":"107","volume":"2","author":"LC Edie","year":"1954","unstructured":"Edie, L.C.: Traffic delays at toll booths. J. Oper. Res. Soc. Am. 2(2), 107\u2013138 (1954)","journal-title":"J. Oper. Res. Soc. Am."},{"key":"10_CR9","doi-asserted-by":"publisher","DOI":"10.1002\/9780470512517","volume-title":"Computational Intelligence: An Introduction","author":"A Engelbrecht","year":"2007","unstructured":"Engelbrecht, A.: Computational Intelligence: An Introduction, 2nd edn. Wiley, New York (2007)","edition":"2"},{"key":"10_CR10","unstructured":"Fernando, S., et al.: Routing in road networks: the toll booth problem (2012)"},{"issue":"5","key":"10_CR11","doi-asserted-by":"publisher","first-page":"471","DOI":"10.1016\/S0191-2615(01)00016-9","volume":"36","author":"P Ferrari","year":"2002","unstructured":"Ferrari, P.: Road network toll pricing and social welfare. Transp. Res. Part B Methodol. 36(5), 471\u2013483 (2002)","journal-title":"Transp. Res. Part B Methodol."},{"key":"10_CR12","unstructured":"Harwood, R.C., Kollmann, C.J., Stamps, M.T.: A genetic algorithm for the minimum tollbooth problem (2005)"},{"key":"10_CR13","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1007\/978-1-4615-5757-9_6","volume-title":"Equilibrium and Advanced Transportation Modelling","author":"DW Hearn","year":"1998","unstructured":"Hearn, D.W., Ramana, M.V.: Solving congestion toll pricing models. In: Marcotte, P., Nguyen, S. (eds.) Equilibrium and Advanced Transportation Modelling, pp. 109\u2013124. Springer, Boston (1998). https:\/\/doi.org\/10.1007\/978-1-4615-5757-9_6"},{"key":"10_CR14","doi-asserted-by":"crossref","unstructured":"Hearn, D.W., Yidirim, M., Ramana, M., Bai, L.: Computational methods for congestion toll pricing models. In: Proceedings of the Intelligent Transportation Systems, pp. 257\u2013262. IEEE (2001)","DOI":"10.1109\/ITSC.2001.948665"},{"key":"10_CR15","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1007\/978-1-4757-6871-8_9","volume-title":"Transportation and Network Analysis: Current Trends","author":"DW Hearn","year":"2002","unstructured":"Hearn, D.W., Yildirim, M.B.: A toll pricing framework for traffic assignment problems with elastic demand. In: Gendreau, M., Marcotte, P. (eds.) Transportation and Network Analysis: Current Trends, pp. 135\u2013145. Springer, Boston (2002). https:\/\/doi.org\/10.1007\/978-1-4757-6871-8_9"},{"key":"10_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"138","DOI":"10.1007\/978-3-642-10509-8_17","volume-title":"Future Generation Information Technology","author":"Y-C Hong","year":"2009","unstructured":"Hong, Y.-C., Kim, D.-K., Kho, S.-Y., Kim, S.W., Yang, H.: Modeling and simulation of tandem tollbooth operations with max-algebra approach. In: Lee, Y., Kim, T., Fang, W., \u015al\u0119zak, D. (eds.) FGIT 2009. LNCS, vol. 5899, pp. 138\u2013150. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-10509-8_17"},{"key":"10_CR17","doi-asserted-by":"publisher","DOI":"10.1007\/b130886","volume-title":"Optimization Theory","author":"H Jongen","year":"2007","unstructured":"Jongen, H., Meer, K., Triesch, E.: Optimization Theory. Springer, New York (2007). https:\/\/doi.org\/10.1007\/b130886"},{"key":"10_CR18","doi-asserted-by":"crossref","unstructured":"Kromer, P., Platos, J., Snasel, V.: Traditional and self-adaptive differential evolution for the p-median problem. In: IEEE 2nd International Conference on Cybernetics (CYBCONF), pp. 299\u2013304, June 2015","DOI":"10.1109\/CYBConf.2015.7175950"},{"key":"10_CR19","doi-asserted-by":"crossref","unstructured":"Kr\u00f6mer, P., Platos, J.: Evolutionary feature subset selection with compression-based entropy estimation. In: Proceedings of the 2016 on Genetic and Evolutionary Computation Conference, Denver, 20\u201324 July 2016, pp. 933\u2013940 (2016)","DOI":"10.1145\/2908812.2908853"},{"key":"10_CR20","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1016\/j.trb.2014.09.015","volume":"71","author":"JA Laval","year":"2015","unstructured":"Laval, J.A., Cho, H.W., Mu\u00f1oz, J.C., Yin, Y.: Real-time congestion pricing strategies for toll facilities. Transp. Res. Part B Methodol. 71, 19\u201331 (2015)","journal-title":"Transp. Res. Part B Methodol."},{"issue":"1","key":"10_CR21","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1007\/s10107-004-0536-5","volume":"101","author":"S Lawphongpanich","year":"2004","unstructured":"Lawphongpanich, S., Hearn, D.W.: An MPEC approach to second-best toll pricing. Math. Program. 101(1), 33\u201355 (2004)","journal-title":"Math. Program."},{"key":"10_CR22","series-title":"Natural Computing Series","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-31306-0","volume-title":"Differential Evolution A Practical Approach to Global Optimization","author":"KV Price","year":"2005","unstructured":"Price, K.V., Storn, R.M., Lampinen, J.A.: Differential Evolution A Practical Approach to Global Optimization. Natural Computing Series. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/3-540-31306-0"},{"key":"10_CR23","unstructured":"Schofer, J., Morlok, E.: Development and Application of a Highway Network Design Model: Transportation Center Research Report, vol. 2. Environmental Planning Branch, Federal Highway Administration, U.S. Department of Transportation (1973). Type: Report"},{"key":"10_CR24","doi-asserted-by":"crossref","unstructured":"Silva, A., Mateus, G.R.: Hybrid heuristics for the minimum tollbooth problem. In: IEEE 19th International Conference on Intelligent Transportation Systems (ITSC), pp. 913\u2013918. IEEE (2016)","DOI":"10.1109\/ITSC.2016.7795664"},{"issue":"1\u20132","key":"10_CR25","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1007\/s10479-015-1800-1","volume":"249","author":"F Stefanello","year":"2017","unstructured":"Stefanello, F., et al.: On the minimization of traffic congestion in road networks with tolls. Ann. Oper. Res. 249(1\u20132), 119\u2013139 (2017)","journal-title":"Ann. Oper. Res."},{"key":"10_CR26","doi-asserted-by":"crossref","unstructured":"Storn, R.: Differential evolution design of an IIR-filter. In: Proceeding of the IEEE Conference on Evolutionary Computation ICEC, pp. 268\u2013273. IEEE Press (1996)","DOI":"10.1109\/ICEC.1996.542373"},{"key":"10_CR27","unstructured":"Storn, R., Price, K.: Differential Evolution- A Simple and Efficient Adaptive Scheme for Global Optimization over Continuous Spaces. Technical report (1995)"},{"issue":"8","key":"10_CR28","doi-asserted-by":"publisher","first-page":"659","DOI":"10.1016\/j.trb.2004.08.001","volume":"39","author":"MB Yildirim","year":"2005","unstructured":"Yildirim, M.B., Hearn, D.W.: A first best toll pricing framework for variable demand traffic assignment problems. Transp. Res. Part B Methodol. 39(8), 659\u2013678 (2005)","journal-title":"Transp. Res. Part B Methodol."}],"container-title":["Lecture Notes in Computer Science","Computational Data and Social Networks"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-04648-4_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,11,3]],"date-time":"2019-11-03T01:44:34Z","timestamp":1572745474000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-04648-4_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783030046477","9783030046484"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-04648-4_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"CSoNet","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Computational Social Networks","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Shanghai","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","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":"18 December 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20 December 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"csonet2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/optnetsci.cise.ufl.edu\/CSoNet\/index.html","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":"106","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"44","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"42% - 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":"7","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"}}]}}