{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,6]],"date-time":"2025-11-06T15:50:23Z","timestamp":1762444223438},"reference-count":25,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2010,8,10]],"date-time":"2010-08-10T00:00:00Z","timestamp":1281398400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Optim Lett"],"published-print":{"date-parts":[[2010,11]]},"DOI":"10.1007\/s11590-010-0226-6","type":"journal-article","created":{"date-parts":[[2010,8,9]],"date-time":"2010-08-09T05:46:10Z","timestamp":1281332770000},"page":"619-633","source":"Crossref","is-referenced-by-count":40,"title":["A biased random-key genetic algorithm for road congestion minimization"],"prefix":"10.1007","volume":"4","author":[{"given":"Luciana S.","family":"Buriol","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michael J.","family":"Hirsch","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Panos M.","family":"Pardalos","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tania","family":"Querido","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mauricio G. C.","family":"Resende","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marcus","family":"Ritt","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2010,8,10]]},"reference":[{"key":"226_CR1","volume-title":"Network Flows\u2014Theory, Algorithms, and Applications","author":"R.K. Ahuja","year":"1993","unstructured":"Ahuja R.K., Magnanti T.L., Orlin J.B.: Network Flows\u2014Theory, Algorithms, and Applications. Prentice-Hall, Englewood Cliffs (1993)"},{"key":"226_CR2","first-page":"446","volume":"82","author":"R. Arnott","year":"1994","unstructured":"Arnott R., Small K.: The economics of traffic congestion. Am. Sci. 82, 446\u2013455 (1994)","journal-title":"Am. Sci."},{"key":"226_CR3","unstructured":"Bai, L.: Computational methods for toll pricing models. Ph.D. thesis, University of Florida, Gainesville, Florida (2004)"},{"key":"226_CR4","volume-title":"Mathematical and Computational Models for Congestion Charging","author":"L. Bai","year":"2006","unstructured":"Bai L., Hearn D.W., Lawphongpanich S.: Relaxed toll sets for congestion pricing problems. In: Hearn, D., Lawphongpanich, S., Smith, M. (eds) Mathematical and Computational Models for Congestion Charging, Springer, Berlin (2006)"},{"key":"226_CR5","unstructured":"Bar-Gera, H.: Transportation networks test problems (2007). http:\/\/www.bgu.ac.il\/~bargera\/tntp"},{"key":"226_CR6","doi-asserted-by":"crossref","first-page":"154","DOI":"10.1287\/ijoc.6.2.154","volume":"6","author":"J.C. Bean","year":"1994","unstructured":"Bean J.C.: Genetic algorithms and random keys for sequencing and optimization. ORSA J. Comput. 6, 154\u2013160 (1994)","journal-title":"ORSA J. Comput."},{"key":"226_CR7","unstructured":"Bureau of Public Roads: Traffic Assignment Manual. Tech. rep., US Dept. of Commerce, Urban Planning Division, Washington, DC (1964)"},{"key":"226_CR8","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1287\/ijoc.1070.0231","volume":"20","author":"L. Buriol","year":"2008","unstructured":"Buriol L., Resende M., Thorup M.: Speeding up dynamic shortest-path algorithms. INFORMS J. Comput. 20, 191\u2013204 (2008). doi: 10.1287\/ijoc.1070.0231","journal-title":"INFORMS J. Comput."},{"key":"226_CR9","unstructured":"Buriol, L.S., Hirsch, M.J., Pardalos, P., Querido, T., Resende, M.G., Ritt, M.: A hybrid genetic algorithm for road congestion minimization. In: Proceedings of the XLI Simp\u00f3sio Brasileiro de Pesquisa Operacional, pp. 2515\u20132526 (2009)"},{"key":"226_CR10","doi-asserted-by":"crossref","first-page":"36","DOI":"10.1002\/net.20070","volume":"46","author":"L.S. Buriol","year":"2005","unstructured":"Buriol L.S., Resende M.G.C., Ribiero C.C., Thorup M.: A hybrid genetic algorithm for the weight setting problem in OSPF\/IS-IS routing. Networks 46, 36\u201356 (2005)","journal-title":"Networks"},{"key":"226_CR11","unstructured":"Dahl, J., Landenberghe, L.: CVXOPT (2005). http:\/\/abel.ee.ucla.edu\/cvxopt"},{"key":"226_CR12","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1016\/S0191-2615(98)00026-5","volume":"33","author":"R.B. Dial","year":"1999","unstructured":"Dial R.B.: Minimal-revenue congestion pricing part I: a fast algorithm for the single origin case. Transp. Res. B 33, 189\u2013202 (1999)","journal-title":"Transp. Res. B"},{"key":"226_CR13","doi-asserted-by":"crossref","first-page":"645","DOI":"10.1016\/S0191-2615(99)00046-6","volume":"34","author":"R.B. Dial","year":"1999","unstructured":"Dial R.B.: Minimal-revenue congestion pricing part II: an efficient algorithm for the general case. Transp. Res. B 34, 645\u2013665 (1999)","journal-title":"Transp. Res. B"},{"key":"226_CR14","doi-asserted-by":"crossref","first-page":"299","DOI":"10.1023\/A:1014852026591","volume":"6","author":"M. Ericsson","year":"2002","unstructured":"Ericsson M., Resende M.G.C., Pardalos P.M.: A genetic algorithm for the weight setting problem in OSPF routing. J. Combin. Optim. 6, 299\u2013333 (2002)","journal-title":"J. Combin. Optim."},{"key":"226_CR15","doi-asserted-by":"crossref","first-page":"485","DOI":"10.1016\/S0927-0507(05)80110-0","volume-title":"Network Routing","author":"M. Florian","year":"1995","unstructured":"Florian M., Hearn D. et\u00a0al.: Network equilibrium models and algorithms. In: Ball, M.O. (eds) Network Routing, pp. 485\u2013550. Elsevier Science, Amsterdam (1995)"},{"key":"226_CR16","unstructured":"Gon\u00e7alves, J., Resende, M.: Biased random-key genetic algorithms for combinatorial optimization. Tech. rep., AT&T Labs Research, Florham Park, NJ (2010). ( http:\/\/www.research.att.com\/~mgcr\/doc\/srkga.pdf ). To appear in J. Heuristics"},{"key":"226_CR17","unstructured":"Hearn, D.W., Ramana, M.: Solving Congestion Toll Pricing Models. Equilibrium and Advances in Transportation Modeling. North-Holland, New York (1988)"},{"key":"226_CR18","unstructured":"Hearn, D.W., Ribera, J.: Bounded flow equilibrium by penalty methods. In: Proceedings of the IEEE International Conference on Circuits and Computers, pp. 162\u2013164 (1980)"},{"key":"226_CR19","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1016\/S0167-6377(99)00004-8","volume":"24","author":"D. Kim","year":"1999","unstructured":"Kim D., Pardalos P.: A solution approach to the fixed charge network flow problem using a dynamic slope scaling procedure. Oper. Res. Lett. 24, 195\u2013203 (1999)","journal-title":"Oper. Res. Lett."},{"key":"226_CR20","doi-asserted-by":"crossref","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. Ser. B 101, 33\u201355 (2004)","journal-title":"Math. Program. Ser. B"},{"key":"226_CR21","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1016\/0041-1647(75)90030-1","volume":"9","author":"L.J. LeBlanc","year":"1975","unstructured":"LeBlanc L.J., Morlok E.K., Pierskalla W.P.: An efficient approach to solving the road network equilibrium traffic assignment problem. Transp. Res. 9, 309\u2013318 (1975)","journal-title":"Transp. Res."},{"key":"226_CR22","doi-asserted-by":"crossref","unstructured":"Reis, R., Ritt M., Buriol, L.S., Resende, M.G.C.: A biased random-key genetic algorithm for OSPF and DEFT routing to minimize network congestion. Int. Trans. Oper. Res. (2010, in press)","DOI":"10.1111\/j.1475-3995.2010.00771.x"},{"issue":"2","key":"226_CR23","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1023\/B:NETS.0000027771.13826.3a","volume":"4","author":"S. Shepherd","year":"2004","unstructured":"Shepherd S., Sumalee S.: A genetic algorithm based approach to optimal toll level and location problems. Netw. Spatial Econ. 4(2), 161\u2013179 (2004)","journal-title":"Netw. Spatial Econ."},{"key":"226_CR24","unstructured":"Spears, W., DeJong, K.: On the virtues of parameterized uniform crossover. In: Proceedings of the Fourth International Conference on Genetic Algorithms, pp. 230\u2013236 (1991)"},{"key":"226_CR25","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1007\/s11066-008-9024-z","volume":"10","author":"T. Tsekeris","year":"2009","unstructured":"Tsekeris T., Vo\u00df S.: Design and evaluation of road pricing: state-of-the-art and methodological advances. Netnomics 10, 5\u201352 (2009)","journal-title":"Netnomics"}],"container-title":["Optimization Letters"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-010-0226-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11590-010-0226-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-010-0226-6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,3]],"date-time":"2019-06-03T15:15:05Z","timestamp":1559574905000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11590-010-0226-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,8,10]]},"references-count":25,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2010,11]]}},"alternative-id":["226"],"URL":"https:\/\/doi.org\/10.1007\/s11590-010-0226-6","relation":{},"ISSN":["1862-4472","1862-4480"],"issn-type":[{"value":"1862-4472","type":"print"},{"value":"1862-4480","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,8,10]]}}}