Probability Collectives: A multi-agent approach for solving combinatorial optimization problems

Applied Soft Computing Journal

Volumn 10, Issue 3, 2010, Pages 759-771

  Kulkarni, Anand J ^a   Tai, K ^a  

^a NANYANG TECHNOLOGICAL UNIVERSITY   (Singapore)

Author keywords

Collective Intelligence; Multi Agent System; Multiple Traveling Salesmen Problem; Probability Collectives; Rosenbrock function

Indexed keywords

COLLECTIVE INTELLIGENCES; COMBINATORIAL OPTIMIZATION PROBLEMS; COMPLEX SYSTEMS; COMPUTATIONAL COSTS; ENTIRE SYSTEM; GLOBAL OBJECTIVE; HEURISTIC TECHNIQUES; INDIVIDUAL COMPONENTS; MINIMUM COST; MULTI-AGENT APPROACH; NUMBER OF COMPONENTS; PROBABILITY COLLECTIVES; TEST CASE; TRAVELING SALESMAN;

AUTONOMOUS AGENTS; COMBINATORIAL OPTIMIZATION; COORDINATION REACTIONS; FUZZY CLUSTERING; HEURISTIC METHODS; MULTI AGENT SYSTEMS; PROBABILITY;

LARGE SCALE SYSTEMS;

EID: 77649238246     PISSN: 15684946     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.asoc.2009.09.006     Document Type: Article

References (64)

1. Wolpert D.H. Information theory-the bridge connecting bounded rational game theory and statistical physics. In: Braha D., Minai A.A., and Bar-Yam Y. (Eds). Complex Engineered Systems (2006), Springer, Cambridge, Massachusetts 262-290 Chapter 12
2. Wolpert D.H., Antoine N.E., Bieniawski S.R., and Kroo I.R. Fleet assignment using collective intelligence. 42nd AIAA Aerospace Science Meeting Exhibit (2004)
3. Basar T., and Olsder G.J. Dynamic Non-cooperative Game Theory (1995), Academic Press, London/New York
4. Kulkarni A.J., and Tai K. Probability collectives for decentralized, distributed optimization: a collective intelligence approach. Proceedings of the 2008 IEEE International Conference on Systems, Man, and Cybernetics (2008) 1271-1275
5. Kulkarni A.J., and Tai K. Probability collectives: a decentralized, distributed optimization for multi-agent systems. Proceedings of the Online World Conference on Soft Computing in Industrial Applications, paper no. 098 (2008)
6. Bhadra S., Shakkotai S., and Gupta P. Min-cost selfish multicast with network coding. IEEE Transactions on Information Theory 52 11 (2006) 5077-5087
7. Xi Y., and Yeh E.M. Distributed algorithms for minimum cost multicast with network coding in wireless networks. Proceedings of 4th International Symposium on Modeling and Optimization in Mobile, Ad Hoc and Wireless Networks (2006)
8. Yuan J., Li Z., Yu W., and Li B. A cross-layer optimization framework for multicast in multi-hop wireless networks. First International Conference on Wireless Internet (2005) 47-54
9. Chatterjee M., Sas S., and Turgut K.D. An on-demand weighted clustering algorithm (WCA) for ad hoc networks. Proceedings of 43rd IEEE Global Telecommunications Conference (2000) 1697-1701
10. Amerimehr M.H., Khalaj B.K., and Crespo P.M. A distributed cross-layer optimizationmethod for multicast in interference-limited multihop wireless networks. Journal on Wireless Communications and Networking (2008) Article ID 702036
11. Mohammad H.A., and Babak H.K. A distributed probability collectives optimization method for multicast in CDMA wireless data networks. Proceedings of 4th IEEE Internatilonal Symposium on Wireless Communication Systems, art. no. 4392414 (2007) 617-621
12. Ryder G.S., and Ross K.G. A probability collectives approach to weighted clustering algorithms for ad hoc networks. Proceedings of Third IASTED International Conference on Communications and Computer Networks (2005) 94-99
13. Turgut D., Turgut B., Elmasri R., and Le T.V. Optimizing clustering algorithm in mobile ad hoc networks using simulated annealing. Proceedings of Wireless Communications and Networking, vol. 3 (2003) 1492-1497
14. Abara J. Applying integer linear programming to the fleet assignment problem. Interfaces 19 (1989) 20-28
15. Hane C.A., Barnhart C., Johnson E.L., Marsten R.E., Nemhauser G.L., and Sigismondi G. The fleet assignment problem: solving a large-scale integer program. Mathematical Programming 70 2 (1995) 211-232
16. Ahuja R.K., Jha K.C., Orlin J.B., and Sharma D. Very large-scale neighborhood search for the quadratic assignment problem. Informs Journal on Computing 19 4 (2007) 646-657
17. Chung T., and Chung J. Airline fleet assignment using genetic algorithms. Genetic and Evolutionary Computation Conference (2002) 255-262
18. Bieniawski S.R., Kroo I.M., and Wolpert D.H. Discrete continuous, and constrained optimization using collectives. 10th AIAA/ISSMO Multidisciplinary Analysis and Optimization Conference, vol. 5 (2004) 3079-3087
19. Goldberg D.E., and Samtani M.P. Engineering optimization via genetic algorithm. Proceedings of 9th Conference on Electronic Computation (1986) 471-484
20. Ghasemi M.R., and Wood E.H.R.D. Optimization of trusses using genetic algorithms for discrete and continuous variables. Engineering Computations 16 3 (1999) 272-301
21. Moh J., and Chiang D. Improved simulated annealing search for structural optimization. AIAA Journal 38 10 (2000) 1965-1973
22. Huang C.F., Bieniawski S., Wolpert D., and Strauss C.E.M.A. Comparative study of probability collectives based multiagent systems and genetic algorithms. Proceedings of the Conference on Genetic and Evolutionary Computation (2005) 751-752
23. Vasirani M., and Ossowski S. Collective-based multiagent coordination: a case study. LNAI 4995 (2008) 240-253
24. Modi P., Shen W., Tambe M., and Yokoo M. Adopt: asynchronous distributed constraint optimization with quality guarantees. Journal of Artificial Intelligence 161 (2005) 149-180
25. Busoniu L., Babuska L., and Schutter B. A comprehensive survey of multiagent reinforcement learning. IEEE Transactions on Systems, Man, and Cybernetics-Part C: Applications and Reviews 38 2 (2008) 156-172
26. Y. Shoham, R. Powers, T. Grenager, Multi-agent reinforcement learning: a critical survey, Technical Report, Department of Computer Science, Stanford University CA, USA, 2003, Available online: http://multiagent.stanford.edu/papers/MALearning_ACriticalSurvey_2003_0516.pdf.
27. Bowling M., and Veloso M. Multiagent learning using a variable learning rate. Artificial Intelligence 136 2 (2002) 215-250
28. Bowling M., and Veloso M. Rational and convergent learning in stochastic games. Proceedings of 17th International Conference on Artificial Intelligence (2001) 1021-1026
29. D.H. Wolpert, K. Tumer, An introduction to COllective INtelligence, Technical Report, NASA ARC-IC-99-63, NASA Ames Research Center, 1999.
30. Cheng C.T., Wang W.C., Xu D.M., and Chau K.W. Optimizing hydropower reservoir operation using hybrid genetic algorithm and chaos. Water Resource Management 22 (2008) 895-909
31. Blumenthal H.J., and Parker G.B. Benchmarking punctuated anytime learning for evolving a multi-agent team's binary controllers. World Automation Congress (2006)
32. L.S. Tan, M. Srinivas, G.P. Rangaiah, Global Optimization of Benchmark and Phase Equilibrium Problems Using Differential Evolution, Available online: http://www.ies.org.sg/journal/current/v46/v462_3.pdf.
33. Bouvry P., Arbab F., and Seredynski F. Distributed evolutionary optimization, in manifold: Rosenbrock's function case study. Information Sciences 122 (2000) 141-159
34. Bektas T. The multiple traveling salesman problem: an overview of formulations and solution procedures. Omega 34 (2006) 209-219
35. Kara I., and Bektas T. Integer linear programming formulations of multiple salesman problems and its variations. European Journal of Operational Research 174 (2006) 1449-1458
36. Golden B., Levy L., and Dahl R. Two generalizations of the traveling salesman problem. Omega 9 4 (1981) 439-441
37. Lawler E., Lenstra J., Rinnooy Kan A.H., and Shmoys G.D. The Traveling Salesman Problem (1985), Wiley, Chichester
38. Laporte G. The traveling salesman problem: an overview of exact and approximate algorithms. European Journal of Operational Research 59 (1992) 231-247
39. In: Gutin G., and Punnen A.P. (Eds). Traveling Salesman Problem and Its Variations (2002), Kluwer Academic Publishers, Dordrecht
40. Carter A., and Ragsdale C.T. Scheduling pre-printed newspaper advertising inserts using genetic algorithms. Omega 30 (2002) 415-421
41. Tang L., Liu J., Rong A., and Yang Z. A multiple traveling salesman problem model for hot rolling scheduling in Shangai Baoshan Iron & Steel Complex. European Journal of Operational Research 124 2 (2000) 267-282
42. Christofides N., and Eilon S. An algorithm for the vehicle dispatching problem. Operations Research Quarterly 20 (1969) 309-318
43. Savelsbergh M.W.P. The general pickup and delivery problem. Transactions of Science 29 (1995) 17-29
44. Saleh H., and Chelouah A.R. The design of the global navigation satellite system surveying networks using genetic algorithms. Engineering Application of Artificial Intelligence 17 (2004) 111-122
45. Calvo R.W., and Cordone R. A heuristic approach to the overnight security service problem. Computers & Operations Research 30 (2003) 1269-1287
46. Bellmore M., and Hong S. Transformation of multisalesmen problem to the standard traveling salesman problem. Journal of the Association Computer Machinery 21 (1974) 500-504
47. Lenstra J.K., and Rinnooy Kan A.H.G. Some simple applications of the traveling salesman problem. Operational Research Quarterly 26 (1975) 717-733
48. Somhom S., Modares A., and Enkawa T. Competition-based neural network for the multiple travelling salesmen problem with minmax objective. Computers & Operations Research 26 (1999) 395-407
49. Pan J., and Wang D. An ant colony optimization algorithm for multiple travelling salesman problem. First International Conference on Innovative Computing, Information and Control (2006) 210-213
50. Christofides N., Mingozzi A., and Toth P. Exact algorithms for the vehicle routing problem, based on spanning tree and shortest path relaxations. Mathematical Programming 20 (1981) 255-282
51. Laporte G., and Nobert Y. A cutting planes algorithms for the m-salesmen problem. Operations Research Quarterly 31 (1980) 1017-1023
52. Zhu Q., Qian L., Li Y., and Zhu S. An improved particle swarm optimization algorithm for vehicle routing problem with time windows. Proceedings of the IEEE Congress on Evolutionary Computation (2006) 1386-1390
53. Wacholder E., Han J., and Mann R.C. An extension of the Hopfield-Tank model for solution of the multiple traveling salesmen problem. IEEE International Conference on Neural Networks, vol. 2 (1988) 305-324
54. Shima T., Rasmussen S., and Gross D. Assigning micro UAVs to task tours in an urban terrain. IEEE Transactions on Control Systems Technology 15 4 (2007) 601-612
55. Rathinam S., Sengupta R., and Darbha S. A resource allocation algorithm for multivehicle systems with nonholonomic constraints. IEEE Transactions on Automation Science and Engineering 4 1 (2007) 98-104
56. Reimann M., Doerner K., and Hartl R.F. D-ants: savings based ants divide and conquer the vehicle routing problem. Computers & Operations Research 31 4 (2004) 563-591
57. Shetty V.K., Sudit M., and Nagi R. Priority-based assignment and routing of a fleet of unmanned combat aerial vehicles. Computers & Operations Research 35 (2008) 1813-1828
58. Gambardella L.M., Taillard E.D., and Agazzi G. MACS-VRPTW: A multiple ant colony system for vehicle routing problems with time windows. In: Corne D., Dorigo M., and Glover F. (Eds). New ideas in optimization (1999), McGraw-Hill, London 63-76
59. Skok N., Skrlec D., and Krajcar S. The genetic algorithm method for multiple depot capacitated vehicle routing problem solving. Proceedings of Fourth International Conference on Knowledge-Based Intelligent Engineering Systems & Allied Technologies. Burmingham, UK (2000) 520-526
60. Chen A.-L., Yang G.-K., and Wu Z.-M. Hybrid discrete particle swarm optimization algorithm for capacitated vehicle routing problem. Journal of Zhejiang University: Science 7 4 (2006) 607-614
61. Potvin J.Y. A review of bio-inspired algorithms for vehicle routing. Studies in Computational Intelligence 161 (2009) 1-34
62. Vakhutinsky I.A., and Golden L.B. Solving vehicle routing problems using elastic net. Proceedings of IEEE International Conference on Neural Network (1994) 4535-4540
63. Thangiah S.R., and Salhi S. Genetic clustering: an adaptive heuristic for the multidepot vehicle routing problem. Applied Artificial Intelligence 15 (2001) 361-383
64. Miliotis P. Using cutting planes to solve the symmetric traveling salesman problem. Mathematical Programming 15 (1978) 177-188