Algorytmy genetyczne, ewolucyjne i metaheurystyki : Wybrane zagadnienia

[1]  D. Shanno.  Conditioning of Quasi-Newton Methods for Function Minimization , 1970 .

[2]  M. Pirlot.  General local search methods , 1996 .

[3]  Andrzej Jaszkiewicz,et al.  Improving performance of genetic local search by changing local search space topology , 1999 .

[4]  Andrew B. Kahng,et al.  A new adaptive multi-start technique for combinatorial global optimizations , 1994, Oper. Res. Lett..

[5]  John von Neumann,et al.  Theory Of Self Reproducing Automata , 1967 .

[6]  G. Clarke,et al.  Scheduling of Vehicles from a Central Depot to a Number of Delivery Points , 1964 .

[7]  R. Fletcher,et al.  A New Approach to Variable Metric Algorithms , 1970, Comput. J..

[8]  David H. Wolpert,et al.  No free lunch theorems for optimization , 1997, IEEE Trans. Evol. Comput..

[9]  Bernd Freisleben,et al.  Fitness landscape analysis and memetic algorithms for the quadratic assignment problem , 2000, IEEE Trans. Evol. Comput..

[10]  Billy E. Gillett,et al.  A Heuristic Algorithm for the Vehicle-Dispatch Problem , 1974, Oper. Res..

[11]  Stanislaw Walukiewicz.  Integer Programming , 1991 .

[12]  D. Goldfarb.  A family of variable-metric methods derived by variational means , 1970 .

[13]  Fred Glover,et al.  Tabu Search - Part II , 1989, INFORMS J. Comput..

[14]  A. Stuart,et al.  Portfolio Selection: Efficient Diversification of Investments , 1959 .

[15]  S. Kataoka.  A Stochastic Programming Model , 1963 .

[16]  Brian W. Kernighan,et al.  An Effective Heuristic Algorithm for the Traveling-Salesman Problem , 1973, Oper. Res..

[17]  Robert J. Vanderbei,et al.  Interior-Point Methods for Nonconvex Nonlinear Programming: Filter Methods and Merit Functions , 2002, Comput. Optim. Appl..

[18]  John H. Holland,et al.  Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence , 1992 .

[19]  Melanie Mitchell,et al.  An introduction to genetic algorithms , 1996 .

[20]  Hande Y. Benson,et al.  INTERIOR-POINT METHODS FOR NONCONVEX NONLINEAR PROGRAMMING: COMPLEMENTARITY CONSTRAINTS , 2002 .

[21]  Marshall L. Fisher,et al.  A generalized assignment heuristic for vehicle routing , 1981, Networks.

[22]  Alex Van Breedam,et al.  An analysis of the behavior of heuristics for the vehicle routing problem for a selection of problems with vehicle-relatezd, customer-related, and time-related constraints , 1994 .

[23]  J. Bunch,et al.  Decomposition of a symmetric matrix , 1976 .

[24]  Andrzej Jaszkiewicz,et al.  Genetic local search with distance preserving recombination operator for a vehicle routing problem , 2003, Eur. J. Oper. Res..

[25]  Jin-Kao Hao,et al.  Hybrid Evolutionary Algorithms for Graph Coloring , 1999, J. Comb. Optim..

[26]  Dimitri P. Bertsekas,et al.  Nonlinear Programming , 1997 .

[27]  Gilbert Laporte,et al.  Metaheuristics: A bibliography , 1996, Ann. Oper. Res..

[28]  C. G. Broyden.  The Convergence of a Class of Double-rank Minimization Algorithms 2. The New Algorithm , 1970 .

[29]  Jörg Homberger,et al.  Two Evolutionary Metaheuristics For The Vehicle Routing Problem With Time Windows , 1999 .