{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,17]],"date-time":"2025-10-17T13:40:43Z","timestamp":1760708443782},"reference-count":41,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2012,7,13]],"date-time":"2012-07-13T00:00:00Z","timestamp":1342137600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Geogr Syst"],"published-print":{"date-parts":[[2013,4]]},"DOI":"10.1007\/s10109-012-0172-1","type":"journal-article","created":{"date-parts":[[2012,7,12]],"date-time":"2012-07-12T07:38:47Z","timestamp":1342078727000},"page":"211-228","source":"Crossref","is-referenced-by-count":9,"title":["An adaptive compromise programming method for multi-objective path optimization"],"prefix":"10.1007","volume":"15","author":[{"given":"Rongrong","family":"Li","sequence":"first","affiliation":[]},{"given":"Yee","family":"Leung","sequence":"additional","affiliation":[]},{"given":"Hui","family":"Lin","sequence":"additional","affiliation":[]},{"given":"Bo","family":"Huang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2012,7,13]]},"reference":[{"issue":"6","key":"172_CR1","doi-asserted-by":"crossref","first-page":"566","DOI":"10.1109\/TEVC.2002.804323","volume":"6","author":"CW Ahn","year":"2002","unstructured":"Ahn CW, Ramakrishna R (2002) A genetic algorithm for shortest path routing problem and the sizing of populations. IEEE Trans Evol Comput 6(6):566\u2013579","journal-title":"IEEE Trans Evol Comput"},{"issue":"2","key":"172_CR2","doi-asserted-by":"crossref","first-page":"232","DOI":"10.1016\/S0377-2217(99)00214-3","volume":"121","author":"V Akg\u00fcn","year":"2000","unstructured":"Akg\u00fcn V, Erkut E, Batta R (2000) On finding dissimilar paths. Eur J Oper Res 121(2):232\u2013246","journal-title":"Eur J Oper Res"},{"issue":"6","key":"172_CR3","doi-asserted-by":"crossref","first-page":"621","DOI":"10.1002\/net.3230190602","volume":"19","author":"E Balas","year":"1989","unstructured":"Balas E (1989) The prize collecting traveling salesman problem. Networks 19(6):621\u2013636","journal-title":"Networks"},{"key":"172_CR4","doi-asserted-by":"crossref","first-page":"76","DOI":"10.1007\/978-3-642-87563-2_5","volume":"135","author":"VJ Bowman","year":"1976","unstructured":"Bowman VJ (1976) On the relationship of the Tchebycheff norm and the efficient frontier of multiple-criteria objectives. Lect Notes Econ Math Syst 135:76\u201385","journal-title":"Lect Notes Econ Math Syst"},{"issue":"2","key":"172_CR5","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1007\/BF02592101","volume":"73","author":"BV Cherkassky","year":"1996","unstructured":"Cherkassky BV, Goldberg AV, Radzik T (1996) Shortest paths algorithms: theory and experimental evaluation. Math Program 73(2):129\u2013174","journal-title":"Math Program"},{"issue":"8","key":"172_CR6","doi-asserted-by":"crossref","first-page":"789","DOI":"10.1016\/S0305-0548(98)00094-X","volume":"26","author":"J Coutinho-Rodrigues","year":"1999","unstructured":"Coutinho-Rodrigues J, Cl\u00edmaco J, Current J (1999) An interactive bi-objective shortest path approach: searching for unsupported nondominated solutions. Comput Oper Res 26(8):789\u2013798","journal-title":"Comput Oper Res"},{"issue":"1","key":"172_CR7","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1016\/S0377-2217(01)00354-X","volume":"144","author":"C Davies","year":"2003","unstructured":"Davies C, Lingras P (2003) Genetic algorithms for rerouting shortest paths in dynamic and stochastic networks. Eur J Oper Res 144(1):27\u201338","journal-title":"Eur J Oper Res"},{"key":"172_CR8","author":"EM Delmelle","year":"2012","unstructured":"Delmelle EM, Li SP, Murray AT (2012) Identifying bus stop redundancy: a gis-based spatial optimization approach. Comput Environ Urban Syst. doi: 10.1016\/j.compenvurbsys.2012.01.002","journal-title":"Comput Environ Urban Syst"},{"issue":"1","key":"172_CR9","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1007\/BF01386390","volume":"1","author":"EW Dijkstra","year":"1959","unstructured":"Dijkstra EW (1959) A note on two problems in connection with graphs. Numer Math 1(1):269\u2013271","journal-title":"Numer Math"},{"key":"172_CR10","volume-title":"Multicriteria optimization","author":"M Ehrgott","year":"2005","unstructured":"Ehrgott M (2005) Multicriteria optimization, 2nd edn. Springer, Berlin, Heidelberg and New York","edition":"2"},{"issue":"4","key":"172_CR11","doi-asserted-by":"crossref","first-page":"425","DOI":"10.1007\/s002910000046","volume":"22","author":"M Ehrgott","year":"2000","unstructured":"Ehrgott M, Gandibleux X (2000) A survey and annotated bibliography of multi-objective combinatorial optimization. OR Spectr 22(4):425\u2013460","journal-title":"OR Spectr"},{"key":"172_CR12","first-page":"539","volume-title":"Handbooks in operations research and management science","author":"E Erkut","year":"2007","unstructured":"Erkut E, Tjandra SA, Verter V (2007) Hazardous materials transportation. In: Laporte G, Barnhart C (eds) Handbooks in operations research and management science. Elsevier Science, North-Holland, pp 539\u2013621"},{"key":"172_CR13","unstructured":"FHWA (1994) Guidelines for applying criteria to designate routes for transporting hazardous materials. Report FHWA-SA-94-083, Federal Highway Administration, USA"},{"issue":"1","key":"172_CR14","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1007\/s10288-005-0074-x","volume":"4","author":"X Gandibleux","year":"2006","unstructured":"Gandibleux X, Beugnies F, Randriamasy S (2006) Martins\u2019 algorithm revisited for multi-objective shortest path problems with a MaxMin cost function. 4OR-Q J. Oper Res 4(1):47\u201359","journal-title":"Oper Res"},{"key":"172_CR15","volume-title":"Computers and intractability: a guide to the theory of NP-completeness","author":"M Garey","year":"1979","unstructured":"Garey M, Johnson D (1979) Computers and intractability: a guide to the theory of NP-completeness. Freeman, San Francisco"},{"issue":"1","key":"172_CR16","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1016\/S0377-2217(02)00594-5","volume":"151","author":"J Granat","year":"2003","unstructured":"Granat J, Guerriero F (2003) The interactive analysis of the multicriteria shortest path problem by the reference point method. Eur J Oper Res 151(1):103\u2013118","journal-title":"Eur J Oper Res"},{"issue":"2","key":"172_CR17","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1006\/dspr.2001.0391","volume":"11","author":"C Hallam","year":"2001","unstructured":"Hallam C, Harrison K, Ward J (2001) A multiobjective optimal path algorithm. Digit Signal Process 11(2):133\u2013143","journal-title":"Digit Signal Process"},{"key":"172_CR18","first-page":"215","volume-title":"Mathematics of multiobjective optimization","author":"R Hartley","year":"1985","unstructured":"Hartley R (1985) Vector optimal routing by dynamic programming. In: Serafini P (ed) Mathematics of multiobjective optimization. Springer, Berlin, Heidelberg and New York, pp 215\u2013224"},{"issue":"8","key":"172_CR19","doi-asserted-by":"crossref","first-page":"769","DOI":"10.1080\/13658810410001705307","volume":"18","author":"B Huang","year":"2004","unstructured":"Huang B, Cheu RL, Liew YS (2004) GIS and genetic algorithms for HAZMAT route planning with security considerations. Int J Geogr Inf Sci 18(8):769\u2013787","journal-title":"Int J Geogr Inf Sci"},{"issue":"2","key":"172_CR20","doi-asserted-by":"crossref","first-page":"1063","DOI":"10.1016\/j.dss.2005.09.002","volume":"42","author":"B Huang","year":"2006","unstructured":"Huang B, Liu N, Chandramouli M (2006) A GIS supported Ant algorithm for the linear feature covering. Decis Support Syst 42(2):1063\u20131075","journal-title":"Decis Support Syst"},{"issue":"5","key":"172_CR21","doi-asserted-by":"crossref","first-page":"507","DOI":"10.1080\/13658810701492365","volume":"22","author":"B Huang","year":"2008","unstructured":"Huang B, Fery P, Xue LL, Wang YJ (2008) Seeking the Pareto front for multiobjective spatial optimization problems. Int J Geogr Inf Sci 22(5):507\u2013526","journal-title":"Int J Geogr Inf Sci"},{"key":"172_CR22","doi-asserted-by":"crossref","unstructured":"Hughes EJ (2003) Multi-objective binary search optimisation. In: Proceedings of 2nd international conference on evolutionary multi-criterion optimization, EMO\u201903, pp 102\u2013117","DOI":"10.1007\/3-540-36970-8_8"},{"issue":"4","key":"172_CR23","doi-asserted-by":"crossref","first-page":"150","DOI":"10.1109\/4235.738982","volume":"2","author":"Y Leung","year":"1998","unstructured":"Leung Y, Li G, Xu ZB (1998) A genetic algorithm for the multiple destination routing problems. IEEE Trans Evol Comput 2(4):150\u2013161","journal-title":"IEEE Trans Evol Comput"},{"issue":"3","key":"172_CR24","doi-asserted-by":"crossref","first-page":"249","DOI":"10.1007\/s10109-010-0124-6","volume":"13","author":"RR Li","year":"2011","unstructured":"Li RR, Leung Y (2011) Multi-objective route planning for dangerous goods using compromise programming. J Geogr Syst 13(3):249\u2013271","journal-title":"J Geogr Syst"},{"issue":"5","key":"172_CR25","doi-asserted-by":"crossref","first-page":"581","DOI":"10.1080\/13658810500032388","volume":"19","author":"X Li","year":"2005","unstructured":"Li X, Yeh AGO (2005) Integration of genetic algorithms and GIS for optimal location search. Int J Geogr Inf Sci 19(5):581\u2013601","journal-title":"Int J Geogr Inf Sci"},{"issue":"5","key":"172_CR26","doi-asserted-by":"crossref","first-page":"361","DOI":"10.1061\/(ASCE)0887-3801(2006)20:5(361)","volume":"20","author":"N Liu","year":"2006","unstructured":"Liu N, Huang B, Chandramouli M (2006) Optimal siting of fire stations using GIS and ANT algorithm. J Comput Civ Eng 20(5):361\u2013369","journal-title":"J Comput Civ Eng"},{"key":"172_CR27","volume-title":"GIS and multicriteria decision making analysis","author":"J Malczewski","year":"1999","unstructured":"Malczewski J (1999) GIS and multicriteria decision making analysis. Wiley, New York"},{"issue":"2","key":"172_CR28","doi-asserted-by":"crossref","first-page":"236","DOI":"10.1016\/0377-2217(84)90077-8","volume":"16","author":"EQV Martins","year":"1984","unstructured":"Martins EQV (1984) On a multicriteria shortest path problem. Eur J Oper Res 16(2):236\u2013245","journal-title":"Eur J Oper Res"},{"key":"172_CR29","unstructured":"Martins EQV, Santos JLE (1999) The labelling algorithm for multiobjective shortest paths. Technical Report, Departmento de Matematica, Universidade de Coimbra, Portugal"},{"issue":"9","key":"172_CR30","doi-asserted-by":"crossref","first-page":"699","DOI":"10.1061\/(ASCE)0733-947X(2005)131:9(699)","volume":"131","author":"Q Meng","year":"2005","unstructured":"Meng Q, Lee DH, Cheu RL (2005) The multiobjective vehicle routing and scheduling problem with time window constraints in hazardous material transportation. J Transp Eng ASCE 131(9):699\u2013707","journal-title":"J Transp Eng ASCE"},{"issue":"4","key":"172_CR31","doi-asserted-by":"crossref","first-page":"401","DOI":"10.1080\/13658810600607766","volume":"20","author":"P Mooney","year":"2006","unstructured":"Mooney P, Winstanley A (2006) An evolutionary algorithm for multicriteria path optimization problems. Int J Geogr Inf Sci 20(4):401\u2013423","journal-title":"Int J Geogr Inf Sci"},{"issue":"3","key":"172_CR32","doi-asserted-by":"crossref","first-page":"335","DOI":"10.1007\/s10109-009-0105-9","volume":"12","author":"AT Murray","year":"2010","unstructured":"Murray AT (2010) Advances in location modeling: GIS linkages and contributions. J Geogr Syst 12(3):335\u2013354","journal-title":"J Geogr Syst"},{"issue":"6","key":"172_CR33","doi-asserted-by":"crossref","first-page":"507","DOI":"10.1016\/S0305-0548(99)00037-4","volume":"27","author":"A Skriver","year":"2000","unstructured":"Skriver A, Andersen K (2000) A label correcting approach for solving bicriterion shortest-path problems. Comput Oper Res 27(6):507\u2013524","journal-title":"Comput Oper Res"},{"key":"172_CR34","doi-asserted-by":"crossref","first-page":"389","DOI":"10.1007\/11940128_40","volume":"4288","author":"G Tsaggouris","year":"2006","unstructured":"Tsaggouris G, Zaroliagis C (2006) Multi-objective optimization: improved FPTAS for shortest paths and non-linear objectives with applications. Lect Notes Comput Sci 4288:389\u2013398","journal-title":"Lect Notes Comput Sci"},{"issue":"2","key":"172_CR35","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1016\/0305-0548(82)90008-9","volume":"9","author":"DJ White","year":"1982","unstructured":"White DJ (1982) The set of efficient solutions for multiple objective shortest path problems. Comput Oper Res 9(2):101\u2013107","journal-title":"Comput Oper Res"},{"issue":"5","key":"172_CR36","doi-asserted-by":"crossref","first-page":"391","DOI":"10.1016\/0270-0255(82)90038-0","volume":"3","author":"AP Wierzbicki","year":"1982","unstructured":"Wierzbicki AP (1982) Mathematical basis for satisfying decision making. Math Model 3(5):391\u2013405","journal-title":"Math Model"},{"issue":"4","key":"172_CR37","doi-asserted-by":"crossref","first-page":"639","DOI":"10.1068\/a34109","volume":"34","author":"N Xiao","year":"2002","unstructured":"Xiao N, Bennett DA, Armstrong MP (2002) Using evolutionary algorithms to generate alternatives for multiobjective site search problems. Environ Plan A 34(4):639\u2013656","journal-title":"Environ Plan A"},{"issue":"3","key":"172_CR38","doi-asserted-by":"crossref","first-page":"362","DOI":"10.1007\/BF00934871","volume":"13","author":"PL Yu","year":"1974","unstructured":"Yu PL, Leitmann G (1974) Compromise solutions, dominations structures, and Salukvadze\u2019s solution. J Optim Theory Appl 13(3):362\u2013378","journal-title":"J Optim Theory Appl"},{"key":"172_CR39","first-page":"262","volume-title":"Multiple criteria decision making","author":"M Zeleny","year":"1973","unstructured":"Zeleny M (1973) Compromise programming. In: Cochrane JL, Zeleny M (eds) Multiple criteria decision making. University of South Carolina Press, Columbia, pp 262\u2013301"},{"issue":"6","key":"172_CR40","doi-asserted-by":"crossref","first-page":"652","DOI":"10.1287\/mnsc.22.6.652","volume":"22","author":"S Zionts","year":"1976","unstructured":"Zionts S, Wallenius J (1976) An interactive programming method for solving the multiple criteria problem. Manag Sci 22(6):652\u2013663","journal-title":"Manag Sci"},{"issue":"2","key":"172_CR41","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1109\/TEVC.2003.810758","volume":"7","author":"E Zitzler","year":"2003","unstructured":"Zitzler E, Thiele L, Laumanns M, Fonseca CM, Da Fonseca VG (2003) Performance assessment of multiobjective optimizers: an analysis and review. IEEE Trans Evol Comput 7(2):117\u2013131","journal-title":"IEEE Trans Evol Comput"}],"container-title":["Journal of Geographical Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10109-012-0172-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10109-012-0172-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10109-012-0172-1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,30]],"date-time":"2019-06-30T17:29:05Z","timestamp":1561915745000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10109-012-0172-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,7,13]]},"references-count":41,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2013,4]]}},"alternative-id":["172"],"URL":"https:\/\/doi.org\/10.1007\/s10109-012-0172-1","relation":{},"ISSN":["1435-5930","1435-5949"],"issn-type":[{"value":"1435-5930","type":"print"},{"value":"1435-5949","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,7,13]]}}}