Ibrahim H. Osman – författare
Visar alla böcker från författaren Ibrahim H. Osman. Handla med fri frakt och snabb leverans.
4 produkter
4 produkter
Meta-Heuristics
Advances and Trends in Local Search Paradigms for Optimization
Inbunden, Engelska, 1998
2 192 kr
Skickas inom 10-15 vardagar
This volume comprises a carefully refereed selection of extended versions of the best papers presented at the Second Meta-Heuristics Conference (MIC 97). The selected articles describe the most recent developments in theory and applications of meta-heuristics, heuristics for specific problems, and comparative case studies. The book is divided into six parts, grouped mainly by the techniques considered. The extensive first part with 12 papers covers tabu search and its application to a great variety of well-known combinatorial optimization problems (including the resource-constrained project scheduling problem and vehicle routing problems). In the second part is one paper where tabu search and simulated annealing are investigated comparatively, and two papers which consider hybrid methods combining tabu search with genetic algorithms. The third part has four papers on genetic and evolutionary algorithms. Part four arrives at a new paradigm within meta-heuristics. The fifth part studies the behaviour of parallel local search algorithms mainly from a tabu search perspective.
3 285 kr
Skickas inom 10-15 vardagar
Meta-heuristics have developed dramatically since their inception in the early 1980s. They have had widespread success in attacking a variety of practical and difficult combinatorial optimization problems. These families of approaches include, but are not limited to, greedy random adaptive search procedures, genetic algorithms, problem-space search, neural networks, simulated annealing, tabu search, threshold algorithms, and their hybrids. They incorporate concepts based on biological evolution, intelligent problem solving, mathematical and physical sciences, nervous systems, and statistical mechanics. Since the 1980s, a great deal of effort has been invested in the field of combinatorial optimization theory in which heuristic algorithms have become an important area of research and applications. This volume is drawn from the first conference on Meta-Heuristics and contains 41 papers on the state of the art in heuristic theory and applications. The book treats the following meta-heuristics and applications: genetic algorithms, simulated annealing, tabu search, networks and graphs, scheduling and control, TSP, and vehicle routing problems.It represents research from the fields of operations research, management science, artificial intelligence and computer science.
3 732 kr
Skickas inom 10-15 vardagar
Meta-heuristics have developed dramatically since their inception in the early 1980s. They have had widespread success in attacking a variety of practical and difficult combinatorial optimization problems. These families of approaches include, but are not limited to greedy random adaptive search procedures, genetic algorithms, problem-space search, neural networks, simulated annealing, tabu search, threshold algorithms, and their hybrids. They incorporate concepts based on biological evolution, intelligent problem solving, mathematical and physical sciences, nervous systems, and statistical mechanics. Since the 1980s, a great deal of effort has been invested in the field of combinatorial optimization theory in which heuristic algorithms have become an important area of research and applications. This volume is drawn from the first conference on Meta-Heuristics and contains 41 papers on the state-of-the-art in heuristic theory and applications. The book treats the following meta-heuristics and applications: Genetic Algorithms, Simulated Annealing, Tabu Search, Networks & Graphs, Scheduling and Control, TSP, and Vehicle Routing Problems. It represents research from the fields of Operations Research, Management Science, Artificial Intelligence and Computer Science.
2 136 kr
Skickas inom 10-15 vardagar
Meta-Heuristics: Advances and Trends in Local Search Paradigms for Optimizations comprises a carefully refereed selection of extended versions of the best papers presented at the Second Meta-Heuristics Conference (MIC 97). The selected articles describe the most recent developments in theory and applications of meta-heuristics, heuristics for specific problems, and comparative case studies. The book is divided into six parts, grouped mainly by the techniques considered. The extensive first part with twelve papers covers tabu search and its application to a great variety of well-known combinatorial optimization problems (including the resource-constrained project scheduling problem and vehicle routing problems). In the second part we find one paper where tabu search and simulated annealing are investigated comparatively and two papers which consider hybrid methods combining tabu search with genetic algorithms. The third part has four papers on genetic and evolutionary algorithms. Part four arrives at a new paradigm within meta-heuristics. The fifth part studies the behavior of parallel local search algorithms mainly from a tabu search perspective. The final part examines a great variety of additional meta-heuristics topics, including neural networks and variable neighbourhood search as well as guided local search. Furthermore, the integration of meta-heuristics with the branch-and-bound paradigm is investigated.