메뉴 건너뛰기




Volumn 42, Issue 5, 2012, Pages 682-691

A hybrid estimation of distribution algorithm with decomposition for solving the multiobjective multiple traveling salesman problem

Author keywords

Estimation of distribution algorithms (EDAs); evolutionary gradient search (EGS); evolutionary multiobjective optimization; hill climbing (HC); multiple traveling salesman problem (mTSP); simulated annealing (SA); univariate modeling (UM)

Indexed keywords

ESTIMATION OF DISTRIBUTION ALGORITHMS; EVOLUTIONARY MULTIOBJECTIVE OPTIMIZATION; GRADIENT SEARCH; HILL CLIMBING; MULTIPLE TRAVELING SALESMAN PROBLEMS; UNIVARIATE;

EID: 84865403100     PISSN: 10946977     EISSN: None     Source Type: Journal    
DOI: 10.1109/TSMCC.2012.2188285     Document Type: Article
Times cited : (112)

References (49)
  • 1
    • 0001223022 scopus 로고
    • Computer assisted school bus scheduling
    • R. D. Angle, W. L. Caudle, R. Noonon, and A. Whinston, "Computer assisted school bus scheduling," Manage. Sci., vol. 18, no. 6, pp. 278-288, 1972.
    • (1972) Manage. Sci. , vol.18 , Issue.6 , pp. 278-288
    • Angle, R.D.1    Caudle, W.L.2    Noonon, R.3    Whinston, A.4
  • 2
    • 1242287527 scopus 로고    scopus 로고
    • The design of the navigation satellite system surveying networks using genetic algorithms
    • H. A. Saleh and R. Chelouah, "The design of the navigation satellite system surveying networks using genetic algorithms," Eng. Appl. Artif. Intell., vol. 17, no. 1, pp. 111-122, 2004.
    • (2004) Eng. Appl. Artif. Intell. , vol.17 , Issue.1 , pp. 111-122
    • Saleh, H.A.1    Chelouah, R.2
  • 3
    • 84985781731 scopus 로고
    • A new multiperiod multiple traveling salesman problem with heuristic and application to a scheduling problem
    • K. C. Gilbert and R. B. Hofstra, "A new multiperiod multiple traveling salesman problem with heuristic and application to a scheduling problem," Decision Sci., vol. 23, no. 1, pp. 250-259, 1992.
    • (1992) Decision Sci. , vol.23 , Issue.1 , pp. 250-259
    • Gilbert, K.C.1    Hofstra, R.B.2
  • 4
    • 0033741404 scopus 로고    scopus 로고
    • A multiple traveling salesman problem model for hot rolling scheduling in Shanghai Baoshan Iron and Steel Complex
    • L. Tang, J. Liu, A. Rong, and Z. Yang, "A multiple traveling salesman problem model for hot rolling scheduling in Shanghai Baoshan Iron and Steel Complex," Eur. J. Oper. Res., vol. 124, no. 2, pp. 267-282, 2000.
    • (2000) Eur. J. Oper. Res. , vol.124 , Issue.2 , pp. 267-282
    • Tang, L.1    Liu, J.2    Rong, A.3    Yang, Z.4
  • 5
    • 0036951427 scopus 로고    scopus 로고
    • An implementation of evolutionary computation for path planning of cooperative mobile robots
    • Y. Zhong, J. Liang, G. Gu, R. Zhang, and H. Yang, "An implementation of evolutionary computation for path planning of cooperative mobile robots," in Proc. 4th World Congr. Intell. Control Autom., 2002, vol. 3, pp. 1798-1802.
    • (2002) Proc. 4th World Congr. Intell. Control Autom. , vol.3 , pp. 1798-1802
    • Zhong, Y.1    Liang, J.2    Gu, G.3    Zhang, R.4    Yang, H.5
  • 6
    • 50349103500 scopus 로고    scopus 로고
    • A new grouping genetic algorithm approach to the multiple traveling salesperson problem
    • A. Singh and A. S. Baghel, "A new grouping genetic algorithm approach to the multiple traveling salesperson problem," Soft Comput., vol. 13, no. 1, pp. 95-101, 2009.
    • (2009) Soft Comput. , vol.13 , Issue.1 , pp. 95-101
    • Singh, A.1    Baghel, A.S.2
  • 7
    • 80054957568 scopus 로고    scopus 로고
    • Medical image registration using evolutionary computation: An experimental survey
    • Nov
    • S. Damas, O. Cordon, and J. Santamaria, "Medical image registration using evolutionary computation: An experimental survey," IEEE Comput. Intell. Mag., vol. 6, no. 4, pp. 26-42, Nov. 2011.
    • (2011) IEEE Comput. Intell. Mag. , vol.6 , Issue.4 , pp. 26-42
    • Damas, S.1    Cordon, O.2    Santamaria, J.3
  • 8
    • 79960498819 scopus 로고    scopus 로고
    • Computational intelligence for the smart grid-history, challenges, and opportunities
    • Aug
    • P. J. Werbos, "Computational intelligence for the smart grid-history, challenges, and opportunities," IEEE Comput. Intell. Mag., vol. 6, no. 3, pp. 14-21, Aug. 2011.
    • (2011) IEEE Comput. Intell. Mag. , vol.6 , Issue.3 , pp. 14-21
    • Werbos, P.J.1
  • 9
    • 78951495036 scopus 로고    scopus 로고
    • Computational intelligence applications for defense [research frontier]
    • Feb
    • L. Perlovsky, "Computational intelligence applications for defense [research frontier]," IEEE Comput. Intell. Mag., vol. 6, no. 1, pp. 20-29, Feb. 2011.
    • (2011) IEEE Comput. Intell. Mag. , vol.6 , Issue.1 , pp. 20-29
    • Perlovsky, L.1
  • 11
    • 0036530772 scopus 로고    scopus 로고
    • A fast and elitist multiobjective genetic algorithm: NSGA-II
    • DOI 10.1109/4235.996017, PII S1089778X02041012
    • K. Deb, A. Pratap, S. Agarwal, and T. Meyarivan, "A fast and elitist multiobjective genetic algorithm: NSGA-II," IEEE Trans. Evol. Comput., vol. 6, no. 2, pp. 182-97, Apr. 2002. (Pubitemid 34555372)
    • (2002) IEEE Transactions on Evolutionary Computation , vol.6 , Issue.2 , pp. 182-197
    • Deb, K.1    Pratap, A.2    Agarwal, S.3    Meyarivan, T.4
  • 12
    • 0032141635 scopus 로고    scopus 로고
    • A multi-objective genetic local search algorithm and its application to flowshop scheduling
    • Aug
    • H. Ishibuchi, T. Yoshida, and T. Murata, "A multi-objective genetic local search algorithm and its application to flowshop scheduling," IEEE Trans. Syst., Man, Cybern. C, Appl. Rev., vol. 28, no. 3, pp. 204-223, Aug. 1998.
    • (1998) IEEE Trans. Syst., Man, Cybern. C, Appl. Rev. , vol.28 , Issue.3 , pp. 204-223
    • Ishibuchi, H.1    Yoshida, T.2    Murata, T.3
  • 13
    • 34548108555 scopus 로고    scopus 로고
    • MOEA/D: A multiobjective evolutionary algorithm based on decomposition
    • DOI 10.1109/TEVC.2007.892759
    • Q. Zhang and H. Li, "MOEA/D: A multiobjective evolutionary algorithm based on decomposition," IEEE Trans. Evol. Comput., vol. 11, no. 6, pp. 712-731, Dec. 2007. (Pubitemid 350187486)
    • (2007) IEEE Transactions on Evolutionary Computation , vol.11 , Issue.6 , pp. 712-731
    • Zhang, Q.1    Li, H.2
  • 17
    • 65149095882 scopus 로고    scopus 로고
    • Research topics in discrete estimation of distribution algorithms based on factorizations
    • R. Santana, P. Larranaga, and J. A. Lozano, "Research topics in discrete estimation of distribution algorithms based on factorizations," Memetic Comput., vol. 1, no. 1, pp. 35-54, 2009.
    • (2009) Memetic Comput. , vol.1 , Issue.1 , pp. 35-54
    • Santana, R.1    Larranaga, P.2    Lozano, J.A.3
  • 18
    • 48349106262 scopus 로고    scopus 로고
    • A decision-tree-based multi-objective estimation of distribution algorithm
    • X. Zhong andW. Li, "A decision-tree-based multi-objective estimation of distribution algorithm," in Proc. Int. Conf. Comput. Intell. Security, 2007, pp. 114-118.
    • (2007) Proc. Int. Conf. Comput. Intell. Security , pp. 114-118
    • Zhong, X.1    Li, W.2
  • 19
    • 84958959530 scopus 로고    scopus 로고
    • From recombination of genes to the estimation of distributions I. Binary parameters
    • Parallel Problem Solving from Nature - PPSN IV
    • H. Muhlenbein and G. Paass, "From recombination of genes to the estimation of distributions I. Binary parameters," in Proc. 4th Int. Conf. Parallel Problem Solving Nature, 1996, pp. 178-187. (Pubitemid 126128306)
    • (1996) Lecture Notes In ComputerScience , Issue.1141 , pp. 178-187
    • Muehlenbein, H.1    Paass, G.2
  • 20
    • 0011876133 scopus 로고    scopus 로고
    • Continuous iterated density estimation evolutionary algorithm within the IDEA Framework
    • P. A. N. Bosman and D. Thierens, "Continuous iterated density estimation evolutionary algorithm within the IDEA Framework," in Proc. OBUPM Workshop Genetic Evol. Comput. Conf., 2000, pp. 197-200.
    • (2000) Proc. OBUPM Workshop Genetic Evol. Comput. Conf. , pp. 197-200
    • Bosman, P.A.N.1    Thierens, D.2
  • 21
    • 79959445904 scopus 로고    scopus 로고
    • Restricted Boltzmann machine based algorithm for multi-objective optimization
    • Jul
    • H. J. Tang, V. A. Shim, K. C. Tan, and J. Y. Chia, "Restricted Boltzmann machine based algorithm for multi-objective optimization," in Proc. IEEE Congr. Evol. Comput., Jul. 2010, pp. 1-8.
    • (2010) Proc. IEEE Congr. Evol. Comput. , pp. 1-8
    • Tang, H.J.1    Shim, V.A.2    Tan, K.C.3    Chia, J.Y.4
  • 22
    • 72749086125 scopus 로고    scopus 로고
    • Solving complex high-dimensional problems with the multi-objective neural estimation of distribution algorithm
    • L. Marti, J. Garcia, A. Berlanga, and J. M. Molina, "Solving complex high-dimensional problems with the multi-objective neural estimation of distribution algorithm," in Proc. 11th Annu. Genetic Evol. Comput. Conf., 2009, pp. 619-626.
    • (2009) Proc. 11th Annu. Genetic Evol. Comput. Conf. , pp. 619-626
    • Marti, L.1    Garcia, J.2    Berlanga, A.3    Molina, J.M.4
  • 23
    • 40249102027 scopus 로고    scopus 로고
    • RM-MEDA: A regularity model-based multiobjective estimation of distribution algorithm
    • DOI 10.1109/TEVC.2007.894202
    • Q. Zhang, A. Zhou, and Y. Jin, "RM-MEDA: A regularity model-based multiobjective estimation of distribution algorithm," IEEE Trans. Evol. Comput., vol. 12, no. 1, pp. 41-63, Feb. 2008. (Pubitemid 351330331)
    • (2008) IEEE Transactions on Evolutionary Computation , vol.12 , Issue.1 , pp. 41-63
    • Zhang, Q.1    Zhou, A.2    Jin, Y.3
  • 24
    • 27744588516 scopus 로고    scopus 로고
    • The multiple traveling salesman problem: An overview of formulations and solution procedures
    • T. Bektas, "The multiple traveling salesman problem: An overview of formulations and solution procedures," Int. J. Manage. Sci., vol. 34, no. 3, pp. 209-219, 2005.
    • (2005) Int. J. Manage. Sci. , vol.34 , Issue.3 , pp. 209-219
    • Bektas, T.1
  • 26
    • 0035929097 scopus 로고    scopus 로고
    • Ahybrid genetic algorithm for the vehicle scheduling problem with due times and times deadlines
    • Y. B. Park, "Ahybrid genetic algorithm for the vehicle scheduling problem with due times and times deadlines," Int. J. Prod. Econ., vol. 73, no. 2, pp. 175-188, 2001.
    • (2001) Int. J. Prod. Econ. , vol.73 , Issue.2 , pp. 175-188
    • Park, Y.B.1
  • 27
    • 33749144475 scopus 로고    scopus 로고
    • A new approach to solving the multiple traveling salesperson problem using genetic algorithms
    • DOI 10.1016/j.ejor.2005.04.027, PII S0377221705004236
    • A. E. Carter and C. T. Ragsdale, "A new approach to solving the multiple traveling salesperson problem using genetic algorithms," Eur. J. Oper. Res., vol. 175, no. 1, pp. 246-257, 2006. (Pubitemid 44470720)
    • (2006) European Journal of Operational Research , vol.175 , Issue.1 , pp. 246-257
    • Carter, A.E.1    Ragsdale, C.T.2
  • 29
    • 78049280651 scopus 로고    scopus 로고
    • Optimization of multiple traveling salesman problem by a novel representation based genetic algorithm
    • A. Kiraly and J. Abonyi, "Optimization of multiple traveling salesman problem by a novel representation based genetic algorithm," in Proc. 10th Int. Symp. Hungarian Res. Comput. Intell. Informat., 2010, pp. 315-326.
    • (2010) Proc. 10th Int. Symp. Hungarian Res. Comput. Intell. Informat. , pp. 315-326
    • Kiraly, A.1    Abonyi, J.2
  • 31
    • 77951278725 scopus 로고    scopus 로고
    • Memetic computation-past, present & future
    • May
    • Y. S. Ong, M. Lim, and X. S. Chen, "Memetic computation-past, present & future," IEEE Comput. Intell. Mag., vol. 5, no. 2, pp. 24-31, May 2010.
    • (2010) IEEE Comput. Intell. Mag. , vol.5 , Issue.2 , pp. 24-31
    • Ong, Y.S.1    Lim, M.2    Chen, X.S.3
  • 32
    • 77449128548 scopus 로고    scopus 로고
    • Guest editorial: Memetic algorithms for evolutionary multi-objective optimization
    • K. Tang, K. C. Tan, andH. Ishibuchi, "Guest editorial: Memetic algorithms for evolutionary multi-objective optimization," Memetic Comput., vol. 2, no. 1, pp. 1-2, 2010.
    • (2010) Memetic Comput. , vol.2 , Issue.1 , pp. 1-2
    • Tang, K.1    Tan, K.C.2    Ishibuchi, H.3
  • 33
    • 79959382418 scopus 로고    scopus 로고
    • Memetic informed evolutionary optimization via data mining
    • J. Y. Chia, C. K. Goh, K. C. Tan, and V. A. Shim, "Memetic informed evolutionary optimization via data mining," Memetic Comput., vol. 3, no. 2, pp. 73-88, 2011.
    • (2011) Memetic Comput. , vol.3 , Issue.2 , pp. 73-88
    • Chia, J.Y.1    Goh, C.K.2    Tan, K.C.3    Shim, V.A.4
  • 34
    • 33750253671 scopus 로고    scopus 로고
    • Adaptation for parallel memetic algorithm based on population entropy
    • GECCO 2006 - Genetic and Evolutionary Computation Conference
    • J. Tang, M. H. Lim, and Y. S. Ong, "Adaptation for parallel memetic algorithm based on population entropy," in Proc. 8th Annu. Conf. Genetic Evol. Comput., 2006, pp. 575-582. (Pubitemid 44611373)
    • (2006) GECCO 2006 - Genetic and Evolutionary Computation Conference , vol.1 , pp. 575-582
    • Tang, J.1    Lim, M.H.2    Ong, Y.S.3
  • 35
    • 62549115259 scopus 로고    scopus 로고
    • Special issue on emerging trends in soft computing: Memetic algorithms
    • Y. S. Ong, M. H. Lim, F. Neri, and H. Ishibuchi, "Special issue on emerging trends in soft computing: Memetic algorithms," Soft Comput., vol. 13, no. 8-9, pp. 739-740, 2009.
    • (2009) Soft Comput. , vol.13 , Issue.8-9 , pp. 739-740
    • Ong, Y.S.1    Lim, M.H.2    Neri, F.3    Ishibuchi, H.4
  • 36
    • 77951285978 scopus 로고    scopus 로고
    • Memetic compact differential evolution for cartesian robot control
    • May
    • F. Neri and E. Mininno, "Memetic compact differential evolution for cartesian robot control," IEEE Comput. Intell. Mag., vol. 5, no. 2, pp. 54-65, May 2010.
    • (2010) IEEE Comput. Intell. Mag. , vol.5 , Issue.2 , pp. 54-65
    • Neri, F.1    Mininno, E.2
  • 37
    • 44349184898 scopus 로고    scopus 로고
    • Hybrid ant colony algorithms for path planning in sparse graphs
    • DOI 10.1007/s00500-007-0264-x
    • K. K. Lim, Y. S. Ong, M. H. Lim, X. Chen, and A. Agarwal, "Hybrid ant colony algorithms for path planning in sparse graphs," Soft Comput., vol. 12, no. 10, pp. 981-994, 2008. (Pubitemid 351736877)
    • (2008) Soft Computing , vol.12 , Issue.10 , pp. 981-994
    • Lim, K.K.1    Ong, Y.-S.2    Lim, M.-H.3    Chen, X.4    Agarwal, A.5
  • 38
    • 27844580705 scopus 로고    scopus 로고
    • A tabu search algorithm for static routing and wavelength assignment problem
    • DOI 10.1109/LCOMM.2005.1506721
    • Y. Wang, T. H. Cheng, and M. H. Lim, "A tabu search algorithm for static routing andwavelength assignment problem," IEEE Commun. Lett., vol. 9, no. 9, pp. 841-843, Sep. 2005. (Pubitemid 41644240)
    • (2005) IEEE Communications Letters , vol.9 , Issue.9 , pp. 841-843
    • Wang, Y.1    Cheng, T.H.2    Lim, M.H.3
  • 39
    • 0028565561 scopus 로고
    • Hybridizing genetic algorithms with hillclimbing methods for global optimization: Two possible ways
    • J. M. Renders and H. Bersini, "Hybridizing genetic algorithms with hillclimbing methods for global optimization: Two possible ways," in Proc. 1st IEEE Congr. Evol. Comput., Jun. 1994, vol. 1, pp. 312-317.
    • (1994) Proc. 1st IEEE Congr. Evol. Comput., Jun. , vol.1 , pp. 312-317
    • Renders, J.M.1    Bersini, H.2
  • 40
    • 7744222975 scopus 로고    scopus 로고
    • Blind source separation in post-nonlinear mixtures using competitive learning, simulated annealing, and a genetic algorithm
    • Nov
    • F. Rojas, C. G. Puntonet, M. Rodriquez, I. Rojas, and R. Martin, "Blind source separation in post-nonlinear mixtures using competitive learning, simulated annealing, and a genetic algorithm," IEEE Trans. Syst., Man, Cybern. C, Appl. Rev., vol. 34, no. 4, pp. 407-416, Nov. 2004.
    • (2004) IEEE Trans. Syst., Man, Cybern. C, Appl. Rev. , vol.34 , Issue.4 , pp. 407-416
    • Rojas, F.1    Puntonet, C.G.2    Rodriquez, M.3    Rojas, I.4    Martin, R.5
  • 41
    • 0032108106 scopus 로고    scopus 로고
    • Evolutionary algorithms and gradient search: Similarities and differences
    • Jul
    • R. Solomon, "Evolutionary algorithms and gradient search: Similarities and differences," IEEE Trans. Evol. Comput., vol. 2, no. 2, pp. 45-55, Jul. 1998.
    • (1998) IEEE Trans. Evol. Comput. , vol.2 , Issue.2 , pp. 45-55
    • Solomon, R.1
  • 42
    • 55749086527 scopus 로고    scopus 로고
    • An investigation on evolutionary gradient search for multi-objective optimization
    • C. K. Goh, Y. S. Ong, K. C. Tan, and E. J. Teoh, "An investigation on evolutionary gradient search for multi-objective optimization," in Proc. IEEE Congr. Evol. Comput., Jun. 2008, pp. 3741-3746.
    • (2008) Proc. IEEE Congr. Evol. Comput., Jun. , pp. 3741-3746
    • Goh, C.K.1    Ong, Y.S.2    Tan, K.C.3    Teoh, E.J.4
  • 43
    • 77952888744 scopus 로고    scopus 로고
    • A predictive gradient strategy for multiobjective evolutionary algorithms in a fast changing environment
    • W. T. Koo, C. K. Goh, and K. C. Tan, "A predictive gradient strategy for multiobjective evolutionary algorithms in a fast changing environment," Memetic Comput., vol. 2, no. 2, pp. 87-110, 2010.
    • (2010) Memetic Comput. , vol.2 , Issue.2 , pp. 87-110
    • Koo, W.T.1    Goh, C.K.2    Tan, K.C.3
  • 44
    • 38249029971 scopus 로고    scopus 로고
    • An effective method of balancing the workload amongst salesman
    • C. Okonjo, "An effective method of balancing the workload amongst salesman," Omega, vol. 16, no. 2, pp. 159-163, 1998.
    • (1998) Omega , vol.16 , Issue.2 , pp. 159-163
    • Okonjo, C.1
  • 46
    • 78650754270 scopus 로고    scopus 로고
    • Probabilistic based evolutionary optimizers in bi-objective traveling salesman problem
    • V. A. Shim, K. C. Tan, and J. Y. Chia, "Probabilistic based evolutionary optimizers in bi-objective traveling salesman problem," in Proc. 8th Int. Conf. Simulated Evol. Learning, 2010, pp. 588-592.
    • (2010) Proc. 8th Int. Conf. Simulated Evol. Learning , pp. 588-592
    • Shim, V.A.1    Tan, K.C.2    Chia, J.Y.3
  • 47
    • 58149236790 scopus 로고    scopus 로고
    • Comparison between MOEA/D and NSGAII on the multi-objective traveling salesman problem
    • C.-K. Goh, K. C. Tan, and Y.-S. Ong, Eds. New York: Springer-Verlag
    • W. Peng, Q. Zhang, and H. Li, "Comparison between MOEA/D and NSGAII on the multi-objective traveling salesman problem," in Multi-Objective Memetic Algorithm, vol. 171, C.-K. Goh, K. C. Tan, and Y.-S. Ong, Eds. New York: Springer-Verlag, 2009, pp. 309-324.
    • (2009) Multi-Objective Memetic Algorithm , vol.171 , pp. 309-324
    • Peng, W.1    Zhang, Q.2    Li, H.3
  • 49
    • 33745793010 scopus 로고    scopus 로고
    • A proposal to use stripes to maintain diversity in a multi-objective particle swarm optimizer
    • DOI 10.1109/SIS.2005.1501598, 1501598, Proceedings - 2005 IEEE Swarm Intelligence Symposium, SIS 2005
    • M. A. Villalobos-Arias, G. T. Pulido, and C. A. C. Coello, "A proposal to use stripes to maintain diversity in a multi-objective particle swarm optimizer," in Proc. 2005 IEEE Swarm Intell. Symp., 2005, pp. 23-30. (Pubitemid 44017879)
    • (2005) Proceedings - 2005 IEEE Swarm Intelligence Symposium, SIS 2005 , vol.2005 , pp. 23-30
    • Villalobos-Arias, M.A.1    Pulido, G.T.2    Coello Coello, C.A.3


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