Modern heuristic techniques for combinatorial problems. Fred Glover. Loading Preview. Sorry, preview is currently unavailable. You can download the paper by . computation, and other heuristic optimization techniques, and how they are problems, to compare and judge the efficacy of modern heuristic optimization. Modern Heuristic Techniques for Combinatorial Problems by Colin R. Reeves, , available at Book Depository with free delivery.
|Language:||English, Spanish, Dutch|
|Genre:||Science & Research|
|ePub File Size:||29.59 MB|
|PDF File Size:||9.46 MB|
|Distribution:||Free* [*Regsitration Required]|
Faced with the challenge of solving hard optimization problems that The meta- heuristic approach called tabu search (TS) is dramatically. Meta-heuristics are the most recent development in approximate search methods for. solving complex optimization problems, that arise in. MODERN HEURISTIC. TECHNIQUES FOR. COMBINATORIAL PROBLEMS. Edited by. COLIN R REEVES BSc, MPhil. Department of Statistics and Operational.
Heragu and J. Feo and H. CrossRef Google Scholar. Meta-heuristics are the most recent development in approximate search methods for solving complex optimization problems, that arise in business, commerce, engineering, industry, and many other areas. Fox Integrating and accelerating tabu search, simulated annealing and genetic algorithms, Annals of Operations Research , 41 , 47— Laguna, E.
Friend Reviews. To see what your friends thought of this book, please sign up. Lists with This Book. This book is not yet featured on Listopia.
Community Reviews. Showing Rating details.
Sort order. May 09, Mohamed Negm rated it it was ok. Amelia Sugandy added it Dec 15, Sanal added it Dec 06, Salim Bo marked it as to-read Jan 01, Semakaleng marked it as to-read Jan 17, James P.
Naty Alzate marked it as to-read Feb 27, Kanagaraj Ganesan marked it as to-read Apr 22, Hossam Selim marked it as to-read May 04, Mona Hamid marked it as to-read Sep 20, Martisch marked it as to-read Oct 04, Sreekumar marked it as to-read Nov 19, Ema Santic marked it as to-read Dec 29, Ham Sham marked it as to-read Mar 12, Zyx marked it as to-read Mar 13, Abe Abe added it Mar 28, Moacir marked it as to-read May 05, Ewqqqq marked it as to-read Jun 09, Maya marked it as to-read Jul 31, Jihan added it Aug 25, Nattapol Paisarnvirosrak marked it as to-read Sep 24, Bruna Mercer marked it as to-read Mar 06, Hertz, and G.
Laporte A tabu search heuristic for the vehicle routing problem, Management Science 40 , — Ghaziri Supervision in the self-organizing feature map: Application to the vehicle routing in: Osman and J.
Kelly, Kluwers Academic Publishers, Boston. Glass and C. Potts A comparison of local search methods for flow shop scheduling, Annals of Operations Research , 60 Forthcoming.
Glover, E. Pesch and I.
Glover, J. Kelly, and M. Glover, M. Laguna, E. Taillard and D. Baltzer Science Publishers, Basel, Switzerland. Glover Tabu search: Improved solution alternatives, in: Mathematical Programming, State of the Art , Eds.
Brige and K. Murty, The University of Michigan, Michigan.
Glover and A. Glover Tabu thresholding: Glover Ejection chains, reference structures and alternating path methods for the travelling salesman problems, Working paper, Graduate School of Business, University of Colorado, Boulder, CO Glover Future paths for integer programming and links to artificial intelligence, Computers and Operations Research , 1 , — Hart and A.
Shogan Semi-greedy heuristics: Hasan and I. Osman Local search algorithms for the maximal planar layout problem, International Transactions in Operations Research , 2 , 89— Hopfield and D. Tank Neural computation of decisions in optimization problems, Biological Cybernetics , 52 , — Husbscher and F. Ingber Simulated annealing — practice versus theory, Mathematical And Computer Modelling 18 , Jones Genetic algorithms and their applications to the design of neural networks, Neural Computing and Applications , 1 , 32— Laguna and F.
Soriano and M.
Gendreau Diversification strategies in tabu search algorithm for the maximum clique problem, Annals of Operations Research , 60 Forthcoming. Kirkpatrick, C. Gelatt, and P. Vecchi Optimization by simulated annealing, Science , , — Kolen and E. Pesch Genetic local search in combinatorial optimization, Discrete Applied Mathematics , 48 , Kontoravdis and J.
Antony and R. Aarts Simulated Annealing: Theory and Applications , Reidl, Dordrecht. Laguna, T. Feo and H.
Elrod A greedy randomized adaptive search procedure for the two-partition problem, Operations Research , 42 , — Laporte and I. Osman a Meta-heuristics in Combinatorial Optimization , J.
Baltzer Science Publishers, Basel, Switzerland, Osman b Routing Problems: A bibliography, Annals of Operations Research , Forthcoming. Lawler Combinatorial Optimization: Lin, C. Kao and C. Metropolis, A. Roenbluth, M. Rosenbluth, A. Teller, and E. Teller Equation of the state calculations by fast computing machines, Journal of Chemical Physics , 21 , — Mulhenbein Evolutionary algorithms: Lenstra, John Wiley and Sons, Chichester. Nagar, S. Heragu and J. Haddock A combined branch-and-bound and genetic algorithm based approach for a flowshop scheduling problem, Annals of Operations Research , 60 , Forthcoming.
Nemhauser and L. Nissen Evolutionary algorithm in Management Science: Osman a An introduction to Meta-heuristics, in: Wildson and M. Lawrence Operational Research Society Press, Osman b Heuristics for the generalized assignment problem: Osman Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problems, Annals of Operations Research , 41 , — Osman and G. Laporte Metaheuristics for combinatorial optimization problems: An annotated bibliography, Annals of Operational Research , 60, Forthcoming.
Osman and N. Christofides Capacitated clustering problems by hybrid simulated annealing and tabu search, International Transactions in Operational Research , 1 , — Osman and S.
Papadimitriou and K. Steiglitz Combinatorial optimization: