Ant Colony Optimization: a literature survey - FEP - Working Papers

More documents

Recommendations

Info

Chen CH, Ting CJ (2008) Combining lagrangian heuristic and ant colony system to solve thesingle source capacitated facility location problem. Transportation Research Part E: Logisticsand Transportation Review 44(6):1099 – 1122, DOI DOI: 10.1016/j.tre.2007.09.001Cordon O, Herrera F, Stützle T (2002) A review on the ant colony optimization metaheuristic:Basis, models and new trends. Mathware & Soft Computing 9:141–175Crawford B, Castro C (2006) Integrating lookahead and post processing procedures with acofor solving set partitioning and covering problems. In: ICAISC, pp 1082–1090Deneubourg JL, Aron S, Goss S, Pasteels JM (1990) The self-organizing exploratory pattern ofthe argentine ant. Journal of Insect Behaviour 3:159–168Dorigo M, Di Caro G (1999) The ant colony optimization meta-heuristic, McGraw-Hill Ltd.,UK, Maidenhead, UK, England, pp 11–32Dorigo M, Gambardella LM (1997) Ant colony system: A cooperative learning approach to thetravelling salesman problem. IEEE Transactions on Evolutionary Computation 1:53–66Dorigo M, Stützle T (2004) Ant Colony Optimization. MIT Press, Cambridge, MADorigo M, Maniezzo V, Colorni A (1996) The ant system: Optimization by a colony of cooperatingagents. IEEE Transactions on Systems, Man, and Cybernetics - Part B 26(1):29–41Dorigo M, Caro GD, Gambardella LM (1999) Ant algorithms for discrete optimization. ArtificialLife 5(2):137–172Eswaramurthy V, Tamilarasi A (2009) Hybridizing tabu search with ant colony optimization forsolving job shop scheduling problems. The International Journal of Advanced ManufacturingTechnology 40:1004–1015García-Martínez C, Cordón O, Herrera F (2007) A taxonomy and an empirical analysis of multipleobjective ant colony optimization algorithms for the bi-criteria TSP. European Journalof Operational Research 180(1):116–148Goss S, Aron S, Deneubourg J, Pasteels J (1989) Self-organized shortcuts in the argentine ant.Naturwissenschaften 76:579–581Lessing L, Dumitrescu I, Stützle T (2004) A comparison between aco algorithms for the setcovering problem. In: ANTS, pp 1–12Maniezzo V (1999) Exact and approximate nondeterministic tree-search procedures for thequadratic assignment problem. INFORMS journal on computing 11:358–36923
Mehrabi AD, Mehrabi S, Mehrabi A (2009) A prunning based ant colony algorithm for minimumvertex cover problem. In: International Joint Conference on Computational Intelligence(IJCCI’09), pp 281–286Monteiro MSR, Fontes DBMM, Fontes FACC (2012) Concave minimum cost network flowproblems solved with a colony of ants. Journal of Heuristics (To appear)Mullen R, Monekosso D, Barman S, Remagnino P (2009) A review of ant algorithms. ExpertSystems with Applications 36:9608–9617Musa R, Arnaout JP, Jung H (2010) Ant colony optimization algorithm to solve for the transportationproblem of cross-docking network. Computers & Industrial Engineering 59(1):85– 92Neumann F, Witt C (2010) Ant colony optimization and the minimum spanning tree problem.Theoretical Computer Science 411(25):2406 – 2413Pour HD, Nosraty M (2006) Solving the facility layout and location problem by ant-colonyoptimization-meta heuristic. International Journal of Production Research 44:5187–5196Rappos E, Hadjiconstantinou E (2004) An ant colony heuristic for the design of two-edge connectedflow networks. In: ANTS Workshop, pp 270–277Reimann M, Laumanns M (2006) Savings based ant colony optimization for the capacitatedminimum spanning tree problem. Computers & Operations Research 33:1794–1822Santos L, ao Coutinho-Rodrigues J, Current JR (2010) An improved ant colony optimizationbased algorithm for the capacitated arc routing problem. Transportation Research Part B:Methodological 44(2):246 – 266Shyu SJ, Yin PY, Lin BMT (2004) An ant colony optimization algorithm for the minimumweight vertex cover problem. Annals of Operations Research 131:283–304Shyu SJ, Lin BMT, Hsiao TS (2006) Ant colony optimization for the cell assignment problemin pcs networks. Computers & Operations Research 33(6):1713–1740Solimanpur M, Vrat P, Shankar R (2004) Ant colony optimization algorithm to the inter-cell layoutproblem in cellular manufacturing. European Journal of Operational Research 157:592–606Solimanpur M, Vrat P, Shankar R (2005) An ant algorithm for the single row layout problem inflexible manufacturing systems. Computers & Operations Research 32:583–598Stützle T, Hoos H (1997) Max-min ant system and local search for the traveling salesmanproblem. In: IEEE International Conference On Evolutionary Computation (ICEC’97), IEEEPress, Piscataway,NJ, pp 309–31424
Page 1: n. 474 December 2012ISSN: 0870-8541
Page 5 and 6: that was firstly proposed to solve
Page 7 and 8: The best values for the parameters
Page 9 and 10: • allowing the construction of un
Page 11 and 12: ⌊ ∑ ⌋if a =d i∑j (s + U[0,
Page 13 and 14: heuristic information takes into ac
Page 17 and 18: has to be paid for using that arc.
Page 19 and 20: where δ(S k , a) = 1 if arc a belo
Page 21 and 22: ⎧⎪⎨l =⎪⎩∑τ a /w a∈ A
Page 23: ReferencesAfshar MH (2005) A new tr
Page 27: Recent FEP Working Papers473 João

Ant Colony Optimization: a literature survey - FEP - Working Papers

You also want an ePaper? Increase the reach of your titles

Delete template?

Save as template?