Genetic and Evolutionary Protocols for Solving Distributed Asymmetric Constraint Satisfaction Problems

[1]  Nael B. Abu-Ghazaleh,et al.  A taxonomy of wireless micro-sensor network models , 2002, MOCO.

[2]  James Kennedy,et al.  The Behavior of Particles , 1998, Evolutionary Programming.

[3]  J. Hough.  Operations research: A fundamental approach , 1974 .

[4]  Ramesh Govindan,et al.  Understanding packet delivery performance in dense wireless sensor networks , 2003, SenSys '03.

[5]  Alice E. Smith,et al.  A genetic algorithm for the orienteering problem , 2000, Proceedings of the 2000 Congress on Evolutionary Computation. CEC00 (Cat. No.00TH8512).

[6]  Anthony V. Fiacco,et al.  Nonlinear programming;: Sequential unconstrained minimization techniques , 1968 .

[7]  S. Kulturel-Konak,et al.  Meta heuristics for the orienteering problem , 2002, Proceedings of the 2002 Congress on Evolutionary Computation. CEC'02 (Cat. No.02TH8600).

[8]  Paul Morris,et al.  The Breakout Method for Escaping from Local Minima , 1993, AAAI.

[9]  David E. Debeau.  Linear Programming Isn't Always the Answer , 1957 .

[10]  Bhaskar Krishnamachari,et al.  Distributed Constraint Satisfaction in a Wireless Sensor Tracking System , 2001 .

[11]  Robert G. Reynolds,et al.  Evolutionary computation: Towards a new philosophy of machine intelligence , 1997 .

[12]  Makoto Yokoo,et al.  The Distributed Constraint Satisfaction Problem: Formalization and Algorithms , 1998, IEEE Trans. Knowl. Data Eng..

[13]  Pravin Varaiya,et al.  Power efficient system for sensor networks , 2003, Proceedings of the Eighth IEEE Symposium on Computers and Communications. ISCC 2003.

[14]  Radha Poovendran,et al.  A novel power-efficient broadcast routing algorithm exploiting broadcast efficiency , 2003, 2003 IEEE 58th Vehicular Technology Conference. VTC 2003-Fall (IEEE Cat. No.03CH37484).

[15]  Ron Shonkwiler,et al.  Parallel Genetic Algorithms , 1993, ICGA.

[16]  Mihir Bellare,et al.  On Chromatic Sums and Distributed Resource Allocation , 1998, Inf. Comput..

[17]  Nong Ye,et al.  Comparison of distributed methods for resource allocation , 2005 .

[18]  A. Galstyan,et al.  Resource Allocation and Emergent Coordination in Wireless Sensor Networks , 2004 .

[19]  Barbara M. Smith,et al.  The Phase Transition and the Mushy Region in Constraint Satisfaction Problems , 1994, ECAI.

[20]  Christine Solnon,et al.  Ants can solve constraint satisfaction problems , 2002, IEEE Trans. Evol. Comput..

[21]  R. Palaniappan,et al.  Target detection and tracking using a UWB sensor web , 2004, IEEE Antennas and Propagation Society Symposium, 2004..

[22]  Philip Wolfe.  SOME SIMPLEX-LIKE NONLINEAR PROGRAMMING PROCEDURES, , 1961 .

[23]  Symeon Papavassiliou,et al.  On the connectivity modeling and the tradeoffs between reliability and energy efficiency in large scale wireless sensor networks , 2003, 2003 IEEE Wireless Communications and Networking, 2003. WCNC 2003..

[24]  Richard Bellman.  Some Applications of the Theory of Dynamic Programming - A Review , 1954, Oper. Res..

[25]  David W. Coit,et al.  Exploiting Tabu Search Memory in Constrained Problems , 2004, INFORMS J. Comput..

[26]  F. Glover,et al.  Fundamentals of Scatter Search and Path Relinking , 2000 .

[27]  Bernard Manderick,et al.  Fine-Grained Parallel Genetic Algorithms , 1989, ICGA.

[28]  R. Shamir.  The Efficiency of the Simplex Method: A Survey , 1987 .

[29]  Gregory J. Pottie,et al.  Protocols for self-organization of a wireless sensor network , 2000, IEEE Wirel. Commun..

[30]  D. J. White,et al.  A Method for Approximate Solutions to Stochastic Dynamic Programming Problems Using Expectations , 1968, Oper. Res..

[31]  Alice E. Smith,et al.  A genetic approach to the quadratic assignment problem , 1995, Comput. Oper. Res..

[32]  Harvey M. Wagner,et al.  The Simplex Method for Beginners , 1958 .

[33]  Zbigniew Michalewicz,et al.  Adaptation in evolutionary computation: a survey , 1997, Proceedings of 1997 IEEE International Conference on Evolutionary Computation (ICEC '97).

[34]  Osamu Katai,et al.  Solving constraint satisfaction problems by using coevolutionary genetic algorithms , 1998, 1998 IEEE International Conference on Evolutionary Computation Proceedings. IEEE World Congress on Computational Intelligence (Cat. No.98TH8360).

[35]  Michel Raynal.  A Distributed Solution to the k-out of-M Resources Allocation Problem , 1991, ICCI.

[36]  W. Karush.  A General Algorithm for the Optimal Distribution of Effort , 1962 .

[37]  Luca Maria Gambardella,et al.  Ant Algorithms for Discrete Optimization , 1999, Artificial Life.

[38]  C. Yangt,et al.  Constraint Networks: A Survey , 2004 .

[39]  Ivor P. Page,et al.  Fast Algorithms for Distributed Resource Allocation , 1993, IEEE Trans. Parallel Distributed Syst..

[40]  Stanislaw Walukiewicz.  Integer Programming , 1991 .

[41]  Panganamala Ramana Kumar,et al.  The Number of Neighbors Needed for Connectivity of Wireless Networks , 2004, Wirel. Networks.

[42]  Vikram Srinivasan,et al.  Design of optimal energy aware protocols for wireless sensor networks , 2001, IEEE VTS 53rd Vehicular Technology Conference, Spring 2001. Proceedings (Cat. No.01CH37202).

[43]  Weixiong Zhang,et al.  Distributed breakout revisited , 2002, AAAI/IAAI.

[44]  Bernard O. Koopman,et al.  The Optimum Distribution of Effort , 1953, Oper. Res..

[45]  Jan M. Rabaey,et al.  Distributed algorithms for transmission power control in wireless sensor networks , 2003, 2003 IEEE Wireless Communications and Networking, 2003. WCNC 2003..

[46]  Lawrence J. Fogel,et al.  Artificial Intelligence through Simulated Evolution , 1966 .

[47]  Anantha Chandrakasan,et al.  MobiCom poster: top five myths about the energy consumption of wireless communication , 2003, MOCO.

[48]  Harvey M. Wagner,et al.  A Comparison of the Original and Revised Simplex Methods , 1957 .

[49]  Frederick S. Hillier,et al.  Introduction of Operations Research , 1967 .

[50]  Yves Deville,et al.  A Distributed Arc-Consistency Algorithm , 1995, Sci. Comput. Program..

[51]  Ming-Hsuan Yang,et al.  Constraint networks: a survey , 1997, 1997 IEEE International Conference on Systems, Man, and Cybernetics. Computational Cybernetics and Simulation.

[52]  Günter Rudolph,et al.  Global Optimization by Means of Distributed Evolution Strategies , 1990, PPSN.

[53]  R.L. Carter,et al.  Resource allocation in a distributed computing environment , 1998, 17th DASC. AIAA/IEEE/SAE. Digital Avionics Systems Conference. Proceedings (Cat. No.98CH36267).

[54]  Ilkka Tuomi,et al.  The Lives and Death of Moore's Law , 2002, First Monday.

[55]  Wei-Min Shen,et al.  Dynamic Distributed Resource Allocation: A Distributed Constraint Satisfaction Approach , 2001, ATAL.

[56]  Gerry V. Dozier,et al.  Solving Distributed Asymmetric CSPs via a Society of Hill-Climbers , 2002, IC-AI.

[57]  Jean-Pierre Hubaux,et al.  Minimum-energy broadcast in all-wireless networks: NP-completeness and distribution issues , 2002, MobiCom '02.

[58]  Alan K. Mackworth.  Consistency in Networks of Relations , 1977, Artif. Intell..

[59]  Marco Zuniga,et al.  Optimal Transmission Radius for Flooding in Large Scale Sensor Networks , 2005, Cluster Computing.

[60]  David B. Fogel,et al.  Revisiting evolutionary programming , 1998, Defense, Security, and Sensing.

[61]  Anantha Chandrakasan,et al.  Low-power wireless sensor networks , 2001, VLSI Design 2001. Fourteenth International Conference on VLSI Design.

[62]  Koji Nakano,et al.  Fundamental protocols for wireless sensor networks , 2001, Proceedings 15th International Parallel and Distributed Processing Symposium. IPDPS 2001.

[63]  A. Odlyzko,et al.  Growth of the Internet , 2002 .

[64]  Leonidas J. Guibas,et al.  Counting Targets: Building and Managing Aggregates in Wireless Sensor Networks , 2002 .

[65]  Kenneth A. De Jong,et al.  On the State of Evolutionary Computation , 1993, ICGA.

[66]  P. Dodin,et al.  Analysis of the multisensor multitarget tracking resource allocation problem , 2000, Proceedings of the Third International Conference on Information Fusion.

[67]  Hanan Luss,et al.  Algorithms for Separable Nonlinear Resource Allocation Problems , 1998, Oper. Res..

[69]  Milind Tambe,et al.  Distributed Resource Allocation : Formalization , Complexity Results and Mappings to Distributed CSPs , 2002 .

[70]  Stuart E. Dreyfus.  Computational Aspects of Dynamic Programming , 1957 .

[71]  Toshihide Ibaraki,et al.  Resource allocation problems - algorithmic approaches , 1988, MIT Press series in the foundations of computing.

[72]  K. Schittkowski,et al.  NONLINEAR PROGRAMMING , 2022 .

[73]  B. Naudts,et al.  Ant colonies are good at solving constraint satisfaction problems , 2000, Proceedings of the 2000 Congress on Evolutionary Computation. CEC00 (Cat. No.00TH8512).

[74]  Miodrag Potkonjak,et al.  Coverage problems in wireless ad-hoc sensor networks , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

[75]  Mokhtar S. Bazaraa,et al.  Nonlinear Programming: Theory and Algorithms , 1993 .

[76]  Marcus Randall,et al.  A General Meta-Heuristic Based Solver for Combinatorial Optimisation Problems , 2001, Comput. Optim. Appl..

[77]  Gerry V. Dozier,et al.  Solving Distributed Constraint Satisfaction Problems with an Ant-Like Society of Hill-Climbers , 2003, IC-AI.

[78]  Patrick Prosser,et al.  A constraint maintenance system for the distributed resource allocation problem , 1992 .

[79]  Leonidas J. Guibas,et al.  A Distributed Algorithm for Managing Multi-target Identities in Wireless Ad-hoc Sensor Networks , 2003, IPSN.

[80]  Andrew Whinston,et al.  A Comparison of Two Methods for Quadratic Programming , 1966, Oper. Res..

[81]  Peng-Jun Wan,et al.  Asymptotic critical transmission radius and critical neighbor number for k-connectivity in wireless ad hoc networks , 2004, MobiHoc '04.

[82]  Eugene C. Freuder,et al.  Privacy/Efficiency Tradeoffs in Distributed Meeting Scheduling by Constraint- Based Agents 1 , 2001 .

[83]  Clayton W. Commander,et al.  A Survey of the Quadratic Assignment Problem, with Applications , 2003 .

[84]  James C. Bean,et al.  A Genetic Algorithm for the Multiple-Choice Integer Program , 1997, Oper. Res..

[85]  Makoto Yokoo,et al.  Algorithms for Distributed Constraint Satisfaction: A Review , 2000, Autonomous Agents and Multi-Agent Systems.

[86]  Ian F. Akyildiz,et al.  Wireless sensor networks: a survey , 2002, Comput. Networks.

[87]  Y. Owechko,et al.  Comparison of neural network and genetic algorithms for a resource allocation problem , 1994, Proceedings of 1994 IEEE International Conference on Neural Networks (ICNN'94).

[88]  Robert Nowak,et al.  Distributed optimization in sensor networks , 2004, Third International Symposium on Information Processing in Sensor Networks, 2004. IPSN 2004.

[89]  A. Charnes,et al.  The Theory of Search: Optimum Distribution of Search Effort , 1958 .

[90]  María Cristina Riff,et al.  Evolutionary algorithms for constraint satisfaction problems , 1998, Proceedings SCCC'98. 18th International Conference of the Chilean Society of Computer Science (Cat. No.98EX212).

[91]  Theodore C. Belding,et al.  The Distributed Genetic Algorithm Revisited , 1995, ICGA.

[92]  Gerry V. Dozier.  Solving Distributed Asymmetric Constraint Satisfaction Problems Using an Evolutionary Society of Hill-Climbers , 2003, GECCO.

[93]  Fred W. Glover,et al.  A user's guide to tabu search , 1993, Ann. Oper. Res..

[94]  Alice E. Smith,et al.  An ant system approach to redundancy allocation , 1999, Proceedings of the 1999 Congress on Evolutionary Computation-CEC99 (Cat. No. 99TH8406).

[95]  Thomas Bäck,et al.  A Survey of Evolution Strategies , 1991, ICGA.

[96]  Joseph S. Pliskin,et al.  A Stochastic Allocation Problem , 1980, Oper. Res..

[97]  M. Sebag,et al.  A society of hill-climbers , 1997, Proceedings of 1997 IEEE International Conference on Evolutionary Computation (ICEC '97).

[98]  Reiko Tanese,et al.  Distributed Genetic Algorithms , 1989, ICGA.

[99]  Peter J. Angeline,et al.  Adaptive and Self-adaptive Evolutionary Computations , 1995 .

[100]  James Kennedy,et al.  Particle swarm optimization , 2002, Proceedings of ICNN'95 - International Conference on Neural Networks.

[101]  J. Shapiro.  Dynamic Programming Algorithms for the Integer Programming Problem—I: The Integer Programming Problem Viewed as a Knapsack Type Problem , 1968 .

[102]  Viktor K. Prasanna,et al.  Energy-latency tradeoffs for data gathering in wireless sensor networks , 2004, IEEE INFOCOM 2004.

[103]  Thomas L. Morin,et al.  Branch-and-Bound Strategies for Dynamic Programming , 2015, Oper. Res..

[104]  C. D. Gelatt,et al.  Optimization by Simulated Annealing , 1983, Science.

[105]  Gerard Tel,et al.  Introduction to Distributed Algorithms: Contents , 2000 .

[106]  Marko Fabiunke,et al.  Parallel Distributed Constraint Satisfaction , 1999, PDPTA.

[107]  Yann Chevaleyre,et al.  Issues in Multiagent Resource Allocation , 2006, Informatica.

[108]  Faramarz Fekri,et al.  On connectivity properties of large-scale sensor networks , 2004, 2004 First Annual IEEE Communications Society Conference on Sensor and Ad Hoc Communications and Networks, 2004. IEEE SECON 2004..

[109]  D. McErlean,et al.  Distributed detection and tracking in sensor networks , 2002, Conference Record of the Thirty-Sixth Asilomar Conference on Signals, Systems and Computers, 2002..

[110]  Thomas Bäck,et al.  An Overview of Evolutionary Computation , 1993, ECML.

[111]  Deborah Estrin,et al.  An energy-efficient MAC protocol for wireless sensor networks , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.

[112]  Leonidas J. Guibas,et al.  Wireless sensor networks - an information processing approach , 2004, The Morgan Kaufmann series in networking.

[113]  William Miehle.  Numerical Solution of the Problem of Optimum Distribution of Effort , 1954, Oper. Res..

[114]  Akihiko Konagaya,et al.  A Fine-Grained Parallel Genetic Algorithm for Distributed Parallel Systems , 1993, ICGA.

[115]  David W. Coit,et al.  Solving the redundancy allocation problem using a combined neural network/genetic algorithm approach , 1996, Comput. Oper. Res..

[116]  Ming S. Hung,et al.  Technical Note - A Polynomial Simplex Method for the Assignment Problem , 1983, Oper. Res..

[117]  Stephen Fitzpatrick,et al.  An Experimental Assessment of a Stochastic, Anytime, Decentralized, Soft Colourer for Sparse Graphs , 2001, SAGA.

[118]  V. Klee,et al.  HOW GOOD IS THE SIMPLEX ALGORITHM , 1970 .

[119]  Weixiong Zhang,et al.  An analysis and application of distributed constraint satisfaction and optimization algorithms in sensor networks , 2003, AAMAS '03.

[120]  Sanjay Kumar Madria,et al.  Sensor networks: an overview , 2003 .

[121]  Makoto Yokoo,et al.  Distributed Constraint Satisfaction , 2000, Springer Series on Agent Technology.

[122]  Gary B. Lamont,et al.  Solving the multi-objective quadratic assignment problem using a fast messy genetic algorithm , 2003, The 2003 Congress on Evolutionary Computation, 2003. CEC '03..

[123]  Way Kuo,et al.  An annotated overview of system-reliability optimization , 2000, IEEE Trans. Reliab..

[124]  Manhoi Choy,et al.  Efficient fault-tolerant algorithms for distributed resource allocation , 1995, TOPL.

[125]  David J. Pannell,et al.  Introduction to practical linear programming , 1996 .

[126]  Vipin Kumar,et al.  Algorithms for Constraint-Satisfaction Problems: A Survey , 1992, AI Mag..

[127]  Gerry V. Dozier,et al.  Distributed Constraint Satisfaction, Restricted Recombination, and Hybrid Genetic Search , 2004, GECCO.

[128]  Narendra Karmarkar,et al.  A new polynomial-time algorithm for linear programming , 1984, STOC '84.

[129]  Jorng-Tzong Horng,et al.  Resolution of quadratic assignment problems using an evolutionary algorithm , 2000, Proceedings of the 2000 Congress on Evolutionary Computation. CEC00 (Cat. No.00TH8512).

[130]  Peter Norvig,et al.  Artificial Intelligence: A Modern Approach , 1995 .

[131]  Willard I. Zangwill,et al.  The Convex Simplex Method , 1967 .

[132]  James Bowen,et al.  Solving constraint satisfaction problems using hybrid evolutionary search , 1998, IEEE Trans. Evol. Comput..

[133]  David B. Fogel,et al.  An Evolutionary Programming Approach to Self-Adaptation on Finite State Machines , 1995, Evolutionary Programming.

[134]  Martina Gorges-Schleuter,et al.  ASPARAGOS An Asynchronous Parallel Genetic Optimization Strategy , 1989, ICGA.

[135]  K. Mani Chandy,et al.  The drinking philosophers problem , 1984, ACM Trans. Program. Lang. Syst..

[136]  Toby Walsh,et al.  Random Constraint Satisfaction: Theory Meets Practice , 1998, CP.

[137]  G. V. Shenoy,et al.  Linear programming: methods and applications , 1958 .

[138]  Éva Tardos,et al.  A Strongly Polynomial Algorithm to Solve Combinatorial Linear Programs , 1986, Oper. Res..

[139]  A. E. Eiben,et al.  Solving constraint satisfaction problems using genetic algorithms , 1994, Proceedings of the First IEEE Conference on Evolutionary Computation. IEEE World Congress on Computational Intelligence.

[140]  Li Li,et al.  Distributed topology control for power efficient operation in multihop wireless ad hoc networks , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

[141]  Loren Schwiebert,et al.  Power efficient topologies for wireless sensor networks , 2001, International Conference on Parallel Processing, 2001..

[142]  Ted Burghart,et al.  Distributed Computing Overview , 1998 .

[143]  Luca Maria Gambardella,et al.  Ant colony system: a cooperative learning approach to the traveling salesman problem , 1997, IEEE Trans. Evol. Comput..

[144]  Makoto Yokoo,et al.  An asynchronous complete method for distributed constraint optimization , 2003, AAMAS '03.

[145]  Gerry Dozier.  Distributed constraint satisfaction via a society of hill-climbers , 2002, Proceedings of the 5th Biannual World Automation Congress.

[146]  David G. Luenberger,et al.  Reducing the Memory Requirements of Dynamic Programming , 1968, Oper. Res..

[147]  Yu Hen Hu,et al.  Detection, classification, and tracking of targets , 2002, IEEE Signal Process. Mag..

[148]  Christos G. Cassandras,et al.  Descent algorithms for discrete resource allocation problems , 1994, Proceedings of 1994 33rd IEEE Conference on Decision and Control.

[149]  David B. Fogel,et al.  The Advantages of Evolutionary Computation , 1997, BCEC.

[150]  Jacques de Guenin.  Optimum Distribution of Effort: An Extension of the Koopman Basic Theory , 1961 .

[151]  Marco Dorigo,et al.  Ant system: optimization by a colony of cooperating agents , 1996, IEEE Trans. Syst. Man Cybern. Part B.

[152]  Alice E. Smith,et al.  An ant colony optimization algorithm for the redundancy allocation problem (RAP) , 2004, IEEE Transactions on Reliability.

[153]  James Bowen,et al.  Solving randomly generated constraint satisfaction problems using a micro-evolutionary hybrid that evolves a population of hill-climbers , 1995, Proceedings of 1995 IEEE International Conference on Evolutionary Computation.

[154]  Hamdy A. Taha,et al.  Operations research: an introduction / Hamdy A. Taha , 1982 .

[155]  Dorothea Heiss-Czedik,et al.  An Introduction to Genetic Algorithms. , 1997, Artificial Life.

[156]  Makoto Yokoo,et al.  Distributed constraint satisfaction for formalizing distributed problem solving , 1992, [1992] Proceedings of the 12th International Conference on Distributed Computing Systems.

[157]  Alice E. Smith,et al.  Efficiently Solving the Redundancy Allocation Problem Using Tabu Search , 2003 .

[158]  Weixiong Zhang,et al.  Distributed Stochastic Search for Constraint Satisfaction and Optimization: Parallelism, Phase Transitions and Performance , 2002 .

[159]  Steven Minton,et al.  Minimizing Conflicts: A Heuristic Repair Method for Constraint Satisfaction and Scheduling Problems , 1992, Artif. Intell..

[160]  Di Tian,et al.  Energy efficient routing with guaranteed delivery in wireless sensor networks , 2003, 2003 IEEE Wireless Communications and Networking, 2003. WCNC 2003..

[161]  T. Ishida,et al.  An equilibratory market-based approach for distributed resource allocation and its applications to communication network control , 1996 .

[162]  Marco Dorigo,et al.  Swarm intelligence: from natural to artificial systems , 1999 .

[163]  Zack J. Butler,et al.  Tracking a moving object with a binary sensor network , 2003, SenSys '03.

[164]  Christophe Lecoutre.  Constraint Networks , 1992 .

[165]  David B. Fogel,et al.  Exploring Self-Adaptive Methods to Improve the Efficiency of Generating Approximate Solutions to Travelling Salesman Problems Using Evolutionary Programming , 1997, Evolutionary Programming.

[166]  Vittorio Maniezzo,et al.  The Ant System Applied to the Quadratic Assignment Problem , 1999, IEEE Trans. Knowl. Data Eng..