메뉴 건너뛰기




Volumn 15, Issue , 2014, Pages 27-37

An efficient genetic algorithm for multi-objective solid travelling salesman problem under fuzziness

Author keywords

Genetic algorithm; Multi objective; Necessity; Possibility; Refining operation; Travelling salesman problem

Indexed keywords


EID: 84894635614     PISSN: 22106502     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.swevo.2013.11.001     Document Type: Article
Times cited : (59)

References (36)
  • 1
    • 21344463824 scopus 로고    scopus 로고
    • Simulated annealing metaheuristics for the vehicle routing problem with time windows
    • W.C. Chiang, and R.A. Russell Simulated annealing metaheuristics for the vehicle routing problem with time windows Ann. Oper. Res. 63 1996 3 27
    • (1996) Ann. Oper. Res. , vol.63 , pp. 3-27
    • Chiang, W.C.1    Russell, R.A.2
  • 2
    • 64049119308 scopus 로고    scopus 로고
    • A stochastic dynamic traveling salesman problem with hard time windows
    • T.S. Chang, Y.W. Wan, and W.T. Ooi A stochastic dynamic traveling salesman problem with hard time windows Eur. J. Oper. Res. 198 3 2009 748 759
    • (2009) Eur. J. Oper. Res. , vol.198 , Issue.3 , pp. 748-759
    • Chang, T.S.1    Wan, Y.W.2    Ooi, W.T.3
  • 3
    • 0000546002 scopus 로고
    • Solving large scale symmetric traveling salesman problems to optimality
    • H. Crowder, and M.W. Padberg Solving large scale symmetric traveling salesman problems to optimality Manage. Sci. 26 1980 495 509
    • (1980) Manage. Sci. , vol.26 , pp. 495-509
    • Crowder, H.1    Padberg, M.W.2
  • 4
    • 0000454153 scopus 로고
    • Solution of large scale traveling salesman problem
    • G.B. Dantzig, D.R. Fulkerson, and S.M. Johnson Solution of large scale traveling salesman problem Oper. Res. 2 1954 393 410
    • (1954) Oper. Res. , vol.2 , pp. 393-410
    • Dantzig, G.B.1    Fulkerson, D.R.2    Johnson, S.M.3
  • 5
  • 6
    • 0020813415 scopus 로고
    • Ranking fuzzy numbers in the setting of possibility theory
    • D. Dubois, and H. Prade Ranking fuzzy numbers in the setting of possibility theory Inf. Sci. 30 1983 183 224
    • (1983) Inf. Sci. , vol.30 , pp. 183-224
    • Dubois, D.1    Prade, H.2
  • 9
    • 0022129089 scopus 로고
    • A cutting plane procedure for the traveling salesman problem on a road network
    • B. Fleischmann A cutting plane procedure for the traveling salesman problem on a road network Eur. J. Oper. Res. 21 1985 307 317
    • (1985) Eur. J. Oper. Res. , vol.21 , pp. 307-317
    • Fleischmann, B.1
  • 10
    • 1842561139 scopus 로고    scopus 로고
    • A hybrid exact algorithm for the TSPTW
    • F. Focacci, A. Lodi, and M. Milano A hybrid exact algorithm for the TSPTW INFORMS J. Comput. 14 4 2002 403 417
    • (2002) INFORMS J. Comput. , vol.14 , Issue.4 , pp. 403-417
    • Focacci, F.1    Lodi, A.2    Milano, M.3
  • 12
    • 69849091111 scopus 로고    scopus 로고
    • A novel weight-based immune genetic algorithm for multi-objective optimization problems
    • ISNN 2009
    • G. He, J. Gao, A novel weight-based immune genetic algorithm for multi-objective optimization problems, in: Advances in Neural Networks, Part II, Springer-Verlag, Heidelberg, ISNN 2009, 2009, pp. 500-509.
    • (2009) Advances in Neural Networks, Part II, Springer-Verlag, Heidelberg , pp. 500-509
    • He, G.1    Gao, J.2
  • 15
    • 19944391610 scopus 로고    scopus 로고
    • Effective local search algorithm for routing and scheduling problems with general time window constraints
    • T. Ibaraki, S. Imahori, M. Kubo, T. Masuda, T. Uno, and M. Yagiura Effective local search algorithm for routing and scheduling problems with general time window constraints Transp. Sci. 39 2 2005 206 232
    • (2005) Transp. Sci. , vol.39 , Issue.2 , pp. 206-232
    • Ibaraki, T.1    Imahori, S.2    Kubo, M.3    Masuda, T.4    Uno, T.5    Yagiura, M.6
  • 16
    • 71749103834 scopus 로고    scopus 로고
    • A genetic algorithm based heuristic for scheduling of virtual manufacturing cells (VMCs)
    • S.E. Kesen, S.K. Das, and Z.A. Güngör A genetic algorithm based heuristic for scheduling of virtual manufacturing cells (VMCs) Comput. Oper. Res. 37 6 2010 1148 1156
    • (2010) Comput. Oper. Res. , vol.37 , Issue.6 , pp. 1148-1156
    • Kesen, S.E.1    Das, S.K.2    Güngör, Z.A.3
  • 17
    • 84859956534 scopus 로고    scopus 로고
    • Job scheduling in virtual manufacturing cells with lot-streaming strategy a new mathematical model formulation and a genetic algorithm approach
    • S.E. Kesen, and Z. Güngör Job scheduling in virtual manufacturing cells with lot-streaming strategy a new mathematical model formulation and a genetic algorithm approach J. Oper. Res. Soc. 63 2011 683 695
    • (2011) J. Oper. Res. Soc. , vol.63 , pp. 683-695
    • Kesen, S.E.1    Güngör, Z.2
  • 20
    • 0015604699 scopus 로고
    • An effective algorithm for the traveling salesman problem
    • S. Lin, and B.W. Kernighan An effective algorithm for the traveling salesman problem Oper. Res. 21 1973 498 516
    • (1973) Oper. Res. , vol.21 , pp. 498-516
    • Lin, S.1    Kernighan, B.W.2
  • 21
    • 0000804474 scopus 로고    scopus 로고
    • Chance constrained programming with fuzzy parameters
    • B. Liu, and K. Iwamura Chance constrained programming with fuzzy parameters Fuzzy Sets Syst. 94 1998 227 237
    • (1998) Fuzzy Sets Syst. , vol.94 , pp. 227-237
    • Liu, B.1    Iwamura, K.2
  • 22
    • 76749135575 scopus 로고    scopus 로고
    • Different initial solution generators in genetic algorithms for solving the probabilistic traveling salesman problem
    • Y. Liu Different initial solution generators in genetic algorithms for solving the probabilistic traveling salesman problem Appl. Math. Comput. 216 2010 125 137
    • (2010) Appl. Math. Comput. , vol.216 , pp. 125-137
    • Liu, Y.1
  • 23
    • 79951514207 scopus 로고    scopus 로고
    • Genetic algorithm for asymmetric traveling salesman problem with imprecise travel times
    • J. Majumdar, and A.K. Bhunia Genetic algorithm for asymmetric traveling salesman problem with imprecise travel times J. Comput. Appl. Math. 235 9 2011 3063 3078
    • (2011) J. Comput. Appl. Math. , vol.235 , Issue.9 , pp. 3063-3078
    • Majumdar, J.1    Bhunia, A.K.2
  • 24
    • 0036680981 scopus 로고    scopus 로고
    • An efficient genetic algorithm for the traveling salesman problem with precedence constraints
    • C. Moon, J. Ki, G. Choi, and Y. Seo An efficient genetic algorithm for the traveling salesman problem with precedence constraints Eur. J. Oper. Res. 140 2002 606 617
    • (2002) Eur. J. Oper. Res. , vol.140 , pp. 606-617
    • Moon, C.1    Ki, J.2    Choi, G.3    Seo, Y.4
  • 25
    • 84872339132 scopus 로고    scopus 로고
    • A parallel multi-objective optimization algorithm for the calibration of mathematical models
    • D. Muraro, and R. Dilao A parallel multi-objective optimization algorithm for the calibration of mathematical models Swarm Evol. Comput. 8 2013 13 25
    • (2013) Swarm Evol. Comput. , vol.8 , pp. 13-25
    • Muraro, D.1    Dilao, R.2
  • 26
    • 33847610250 scopus 로고    scopus 로고
    • Implantation of an effective hybrid GA for large scale ravelling salesman problems
    • H.D. Nguyen, I. Yoshihara, K. Yamamori, and M. Yasunaga Implantation of an effective hybrid GA for large scale ravelling salesman problems IEEE Trans. Syst. 37 2007 92 99
    • (2007) IEEE Trans. Syst. , vol.37 , pp. 92-99
    • Nguyen, H.D.1    Yoshihara, I.2    Yamamori, K.3    Yasunaga, M.4
  • 28
    • 0023313723 scopus 로고
    • Optimization of a 532-city symmetric traveling salesman by brunch and cut
    • M. Petberg, and G. Rinaldi Optimization of a 532-city symmetric traveling salesman by brunch and cut Oper. Res. 6 1987 1 7
    • (1987) Oper. Res. , vol.6 , pp. 1-7
    • Petberg, M.1    Rinaldi, G.2
  • 29
    • 0002931406 scopus 로고
    • On the symmetric traveling salesman problems a computational study
    • M.W. Petberg, and S. Homg On the symmetric traveling salesman problems a computational study Math. Program. Stud. 12 1980 87 107
    • (1980) Math. Program. Stud. , vol.12 , pp. 87-107
    • Petberg, M.W.1    Homg, S.2
  • 30
    • 62549093551 scopus 로고    scopus 로고
    • The double traveling salesman problem within multiple stack - Formulation and heuristic solution approaches
    • H.L. Petersen, and O.B.G. Madsen The double traveling salesman problem within multiple stack - formulation and heuristic solution approaches Eur. J. Oper. Res. 198 2009 339 347
    • (2009) Eur. J. Oper. Res. , vol.198 , pp. 339-347
    • Petersen, H.L.1    Madsen, O.B.G.2
  • 32
    • 50349096056 scopus 로고    scopus 로고
    • A memetic random-key genetic algorithm for a symmetric multi-objective traveling salesman problem
    • F. Samanlioglu, W.G. Ferrell, and M.E. Kurz A memetic random-key genetic algorithm for a symmetric multi-objective traveling salesman problem Comput. Ind. Eng. 55 2008 439 449
    • (2008) Comput. Ind. Eng. , vol.55 , pp. 439-449
    • Samanlioglu, F.1    Ferrell, W.G.2    Kurz, M.E.3
  • 33
    • 79953809057 scopus 로고    scopus 로고
    • On the influence of the number of objectives on the hardness of a multi-objective optimization problem
    • O. Schütze, A. Lara, and C.A. Coello Coello On the influence of the number of objectives on the hardness of a multi-objective optimization problem IEEE Trans. Evol. Comput. 15 4 2011 444 455
    • (2011) IEEE Trans. Evol. Comput. , vol.15 , Issue.4 , pp. 444-455
    • Schütze, O.1    Lara, A.2    Coello Coello, C.A.3
  • 34
    • 0000852513 scopus 로고
    • Multiobjective function optimization using non dominated sorting genetic algorithms
    • N. Srinivas, and K. Deb Multiobjective function optimization using non dominated sorting genetic algorithms J. Evol. Comput. 2 3 1994 221 248
    • (1994) J. Evol. Comput. , vol.2 , Issue.3 , pp. 221-248
    • Srinivas, N.1    Deb, K.2
  • 35
    • 3242691440 scopus 로고    scopus 로고
    • Hybrid genetic algorithm for optimization problem with permutation property
    • H.F. Wang, and K.Y. Wu Hybrid genetic algorithm for optimization problem with permutation property Comput. Oper. Res. 31 4 2004 2453 2471
    • (2004) Comput. Oper. Res. , vol.31 , Issue.4 , pp. 2453-2471
    • Wang, H.F.1    Wu, K.Y.2
  • 36
    • 49349133217 scopus 로고
    • Fuzzy sets as a basis for a theory of possibility
    • L.A. Zadeh Fuzzy sets as a basis for a theory of possibility Fuzzy Sets Syst. 1 1978 3 28
    • (1978) Fuzzy Sets Syst. , vol.1 , pp. 3-28
    • Zadeh, L.A.1


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