메뉴 건너뛰기




Volumn 15, Issue 2, 2013, Pages 211-228

An adaptive compromise programming method for multi-objective path optimization

Author keywords

Compromise programming; Multi objective optimization; Multi objective shortest path; Pareto optimality

Indexed keywords

GIS; NETWORK ANALYSIS; OPTIMIZATION; ROAD TRANSPORT; TRADE-OFF; TRANSPORTATION PLANNING;

EID: 84875397132     PISSN: 14355930     EISSN: 14355949     Source Type: Journal    
DOI: 10.1007/s10109-012-0172-1     Document Type: Article
Times cited : (10)

References (41)
  • 1
    • 0036950712 scopus 로고    scopus 로고
    • A genetic algorithm for shortest path routing problem and the sizing of populations
    • 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-579.
    • (2002) IEEE Trans Evol Comput , vol.6 , Issue.6 , pp. 566-579
    • Ahn, C.W.1    Ramakrishna, R.2
  • 2
    • 0033883828 scopus 로고    scopus 로고
    • On finding dissimilar paths
    • Akgün V, Erkut E, Batta R (2000) On finding dissimilar paths. Eur J Oper Res 121(2): 232-246.
    • (2000) Eur J Oper Res , vol.121 , Issue.2 , pp. 232-246
    • Akgün, V.1    Erkut, E.2    Batta, R.3
  • 3
    • 84987028582 scopus 로고
    • The prize collecting traveling salesman problem
    • Balas E (1989) The prize collecting traveling salesman problem. Networks 19(6): 621-636.
    • (1989) Networks , vol.19 , Issue.6 , pp. 621-636
    • Balas, E.1
  • 4
    • 0001772695 scopus 로고
    • On the relationship of the Tchebycheff norm and the efficient frontier of multiple-criteria objectives
    • 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-85.
    • (1976) Lect Notes Econ Math Syst , vol.135 , pp. 76-85
    • Bowman, V.J.1
  • 5
    • 0000371861 scopus 로고    scopus 로고
    • Shortest paths algorithms: theory and experimental evaluation
    • Cherkassky BV, Goldberg AV, Radzik T (1996) Shortest paths algorithms: theory and experimental evaluation. Math Program 73(2): 129-174.
    • (1996) Math Program , vol.73 , Issue.2 , pp. 129-174
    • Cherkassky, B.V.1    Goldberg, A.V.2    Radzik, T.3
  • 6
    • 0033166646 scopus 로고    scopus 로고
    • An interactive bi-objective shortest path approach: searching for unsupported nondominated solutions
    • Coutinho-Rodrigues J, Clímaco J, Current J (1999) An interactive bi-objective shortest path approach: searching for unsupported nondominated solutions. Comput Oper Res 26(8): 789-798.
    • (1999) Comput Oper Res , vol.26 , Issue.8 , pp. 789-798
    • Coutinho-Rodrigues, J.1    Clímaco, J.2    Current, J.3
  • 7
    • 0037209435 scopus 로고    scopus 로고
    • Genetic algorithms for rerouting shortest paths in dynamic and stochastic networks
    • Davies C, Lingras P (2003) Genetic algorithms for rerouting shortest paths in dynamic and stochastic networks. Eur J Oper Res 144(1): 27-38.
    • (2003) Eur J Oper Res , vol.144 , Issue.1 , pp. 27-38
    • Davies, C.1    Lingras, P.2
  • 8
    • 84864779301 scopus 로고    scopus 로고
    • Identifying bus stop redundancy: a gis-based spatial optimization approach
    • doi:10.1016/j.compenvurbsys.2012.01.002
    • 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.
    • (2012) Comput Environ Urban Syst
    • Delmelle, E.M.1    Li, S.P.2    Murray, A.T.3
  • 9
    • 34147120474 scopus 로고
    • A note on two problems in connection with graphs
    • Dijkstra EW (1959) A note on two problems in connection with graphs. Numer Math 1(1): 269-271.
    • (1959) Numer Math , vol.1 , Issue.1 , pp. 269-271
    • Dijkstra, E.W.1
  • 10
    • 84892351315 scopus 로고    scopus 로고
    • 2nd edn., Berlin, Heidelberg and New York: Springer
    • Ehrgott M (2005) Multicriteria optimization, 2nd edn. Springer, Berlin, Heidelberg and New York.
    • (2005) Multicriteria Optimization
    • Ehrgott, M.1
  • 11
    • 0001322778 scopus 로고    scopus 로고
    • A survey and annotated bibliography of multi-objective combinatorial optimization
    • Ehrgott M, Gandibleux X (2000) A survey and annotated bibliography of multi-objective combinatorial optimization. OR Spectr 22(4): 425-460.
    • (2000) OR Spectr , vol.22 , Issue.4 , pp. 425-460
    • Ehrgott, M.1    Gandibleux, X.2
  • 14
    • 33644936205 scopus 로고    scopus 로고
    • Martins' algorithm revisited for multi-objective shortest path problems with a MaxMin cost function. 4OR-Q J
    • Gandibleux X, Beugnies F, Randriamasy S (2006) Martins' algorithm revisited for multi-objective shortest path problems with a MaxMin cost function. 4OR-Q J. Oper Res 4(1): 47-59.
    • (2006) Oper Res , vol.4 , Issue.1 , pp. 47-59
    • Gandibleux, X.1    Beugnies, F.2    Randriamasy, S.3
  • 16
    • 0042591548 scopus 로고    scopus 로고
    • The interactive analysis of the multicriteria shortest path problem by the reference point method
    • 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-118.
    • (2003) Eur J Oper Res , vol.151 , Issue.1 , pp. 103-118
    • Granat, J.1    Guerriero, F.2
  • 17
    • 0035303668 scopus 로고    scopus 로고
    • A multiobjective optimal path algorithm
    • Hallam C, Harrison K, Ward J (2001) A multiobjective optimal path algorithm. Digit Signal Process 11(2): 133-143.
    • (2001) Digit Signal Process , vol.11 , Issue.2 , pp. 133-143
    • Hallam, C.1    Harrison, K.2    Ward, J.3
  • 18
    • 0342977164 scopus 로고
    • Vector optimal routing by dynamic programming
    • P. Serafini (Ed.), Berlin, Heidelberg and New York: Springer
    • 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-224.
    • (1985) Mathematics of Multiobjective Optimization , pp. 215-224
    • Hartley, R.1
  • 19
    • 9744275275 scopus 로고    scopus 로고
    • GIS and genetic algorithms for HAZMAT route planning with security considerations
    • 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-787.
    • (2004) Int J Geogr Inf Sci , vol.18 , Issue.8 , pp. 769-787
    • Huang, B.1    Cheu, R.L.2    Liew, Y.S.3
  • 20
    • 33749848477 scopus 로고    scopus 로고
    • A GIS supported Ant algorithm for the linear feature covering
    • Huang B, Liu N, Chandramouli M (2006) A GIS supported Ant algorithm for the linear feature covering. Decis Support Syst 42(2): 1063-1075.
    • (2006) Decis Support Syst , vol.42 , Issue.2 , pp. 1063-1075
    • Huang, B.1    Liu, N.2    Chandramouli, M.3
  • 21
    • 41449118356 scopus 로고    scopus 로고
    • Seeking the Pareto front for multiobjective spatial optimization problems
    • 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-526.
    • (2008) Int J Geogr Inf Sci , vol.22 , Issue.5 , pp. 507-526
    • Huang, B.1    Fery, P.2    Xue, L.L.3    Wang, Y.J.4
  • 23
    • 0032208708 scopus 로고    scopus 로고
    • A genetic algorithm for the multiple destination routing problems
    • Leung Y, Li G, Xu ZB (1998) A genetic algorithm for the multiple destination routing problems. IEEE Trans Evol Comput 2(4): 150-161.
    • (1998) IEEE Trans Evol Comput , vol.2 , Issue.4 , pp. 150-161
    • Leung, Y.1    Li, G.2    Xu, Z.B.3
  • 24
    • 80051665383 scopus 로고    scopus 로고
    • Multi-objective route planning for dangerous goods using compromise programming
    • Li RR, Leung Y (2011) Multi-objective route planning for dangerous goods using compromise programming. J Geogr Syst 13(3): 249-271.
    • (2011) J Geogr Syst , vol.13 , Issue.3 , pp. 249-271
    • Li, R.R.1    Leung, Y.2
  • 25
    • 20444459508 scopus 로고    scopus 로고
    • Integration of genetic algorithms and GIS for optimal location search
    • Li X, Yeh AGO (2005) Integration of genetic algorithms and GIS for optimal location search. Int J Geogr Inf Sci 19(5): 581-601.
    • (2005) Int J Geogr Inf Sci , vol.19 , Issue.5 , pp. 581-601
    • Li, X.1    Yeh, A.G.O.2
  • 26
    • 33747506580 scopus 로고    scopus 로고
    • Optimal siting of fire stations using GIS and ANT algorithm
    • Liu N, Huang B, Chandramouli M (2006) Optimal siting of fire stations using GIS and ANT algorithm. J Comput Civ Eng 20(5): 361-369.
    • (2006) J Comput Civ Eng , vol.20 , Issue.5 , pp. 361-369
    • Liu, N.1    Huang, B.2    Chandramouli, M.3
  • 28
    • 0021430238 scopus 로고
    • On a multicriteria shortest path problem
    • Martins EQV (1984) On a multicriteria shortest path problem. Eur J Oper Res 16(2): 236-245.
    • (1984) Eur J Oper Res , vol.16 , Issue.2 , pp. 236-245
    • Martins, E.Q.V.1
  • 30
    • 24944496012 scopus 로고    scopus 로고
    • The multiobjective vehicle routing and scheduling problem with time window constraints in hazardous material transportation
    • 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-707.
    • (2005) J Transp Eng ASCE , vol.131 , Issue.9 , pp. 699-707
    • Meng, Q.1    Lee, D.H.2    Cheu, R.L.3
  • 31
    • 33646820346 scopus 로고    scopus 로고
    • An evolutionary algorithm for multicriteria path optimization problems
    • Mooney P, Winstanley A (2006) An evolutionary algorithm for multicriteria path optimization problems. Int J Geogr Inf Sci 20(4): 401-423.
    • (2006) Int J Geogr Inf Sci , vol.20 , Issue.4 , pp. 401-423
    • Mooney, P.1    Winstanley, A.2
  • 32
    • 77955717300 scopus 로고    scopus 로고
    • Advances in location modeling: GIS linkages and contributions
    • Murray AT (2010) Advances in location modeling: GIS linkages and contributions. J Geogr Syst 12(3): 335-354.
    • (2010) J Geogr Syst , vol.12 , Issue.3 , pp. 335-354
    • Murray, A.T.1
  • 33
    • 0034003285 scopus 로고    scopus 로고
    • A label correcting approach for solving bicriterion shortest-path problems
    • Skriver A, Andersen K (2000) A label correcting approach for solving bicriterion shortest-path problems. Comput Oper Res 27(6): 507-524.
    • (2000) Comput Oper Res , vol.27 , Issue.6 , pp. 507-524
    • Skriver, A.1    Andersen, K.2
  • 34
    • 36349015247 scopus 로고    scopus 로고
    • Multi-objective optimization: improved FPTAS for shortest paths and non-linear objectives with applications
    • 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-398.
    • (2006) Lect Notes Comput Sci , vol.4288 , pp. 389-398
    • Tsaggouris, G.1    Zaroliagis, C.2
  • 35
    • 0019901905 scopus 로고
    • The set of efficient solutions for multiple objective shortest path problems
    • White DJ (1982) The set of efficient solutions for multiple objective shortest path problems. Comput Oper Res 9(2): 101-107.
    • (1982) Comput Oper Res , vol.9 , Issue.2 , pp. 101-107
    • White, D.J.1
  • 36
    • 0020449914 scopus 로고
    • Mathematical basis for satisfying decision making
    • Wierzbicki AP (1982) Mathematical basis for satisfying decision making. Math Model 3(5): 391-405.
    • (1982) Math Model , vol.3 , Issue.5 , pp. 391-405
    • Wierzbicki, A.P.1
  • 37
    • 0036253180 scopus 로고    scopus 로고
    • Using evolutionary algorithms to generate alternatives for multiobjective site search problems
    • Xiao N, Bennett DA, Armstrong MP (2002) Using evolutionary algorithms to generate alternatives for multiobjective site search problems. Environ Plan A 34(4): 639-656.
    • (2002) Environ Plan A , vol.34 , Issue.4 , pp. 639-656
    • Xiao, N.1    Bennett, D.A.2    Armstrong, M.P.3
  • 38
    • 0016037629 scopus 로고
    • Compromise solutions, dominations structures, and Salukvadze's solution
    • Yu PL, Leitmann G (1974) Compromise solutions, dominations structures, and Salukvadze's solution. J Optim Theory Appl 13(3): 362-378.
    • (1974) J Optim Theory Appl , vol.13 , Issue.3 , pp. 362-378
    • Yu, P.L.1    Leitmann, G.2
  • 39
    • 0001961313 scopus 로고
    • Compromise programming
    • J. L. Cochrane and M. Zeleny (Eds.), Columbia: University of South Carolina Press
    • Zeleny M (1973) Compromise programming. In: Cochrane JL, Zeleny M (eds) Multiple criteria decision making. University of South Carolina Press, Columbia, pp 262-301.
    • (1973) Multiple Criteria Decision Making , pp. 262-301
    • Zeleny, M.1
  • 40
    • 0016921798 scopus 로고
    • An interactive programming method for solving the multiple criteria problem
    • Zionts S, Wallenius J (1976) An interactive programming method for solving the multiple criteria problem. Manag Sci 22(6): 652-663.
    • (1976) Manag Sci , vol.22 , Issue.6 , pp. 652-663
    • Zionts, S.1    Wallenius, J.2


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.