Product Description
This book brings together - in an informal and tutorial fashion - the computer techniques, mathematical tools, and research results that will enable both students and practitioners to apply genetic algorithms to problems in many fields. Major concepts are illustrated with running examples, and major algorithms are illustrated by Pascal computer programs. No prior knowledge of GAs or genetics is assumed, and only a minimum of computer programming and mathematics background is required. 0201157675B07092001Amazon.com Review
David Goldberg's Genetic Algorithms in Search, Optimizationand Machine Learning is by far the bestselling introduction togenetic algorithms. Goldberg is one of the preeminent researchers inthe field--he has published over 100 research articles on geneticalgorithms and is a student of John Holland, the father of geneticalgorithms--and his deep understanding of the material shinesthrough. The book contains a complete listing of a simple geneticalgorithm in Pascal, which C programmers can easily understand. Thebook covers all of the important topics in the field, includingcrossover, mutation, classifier systems, and fitness scaling, giving anovice with a computer science background enough information toimplement a genetic algorithm and describe genetic algorithms to afriend. ... Read more

Customer Reviews (19)

Great start to your journey in Genetic Algorithms.
This is a great book to begin your journey on Genetic Algorithms (GA). The author is a pioneering authority on the subject and has explained the basics of a GA in a very gentle and easy to understand manner. The book has a great variety of specific but diverse examples, which may not be useful at first glance, but gives an insight to where all the technique has been applied!

However, some aspects of the book perhaps need an edition, like the more recent advances in GA operators, specifics of chromosomal representation schemes, non-linear optimization functions, etc. I have read several, well written books on the subject, but this one has a very distinct and sometimes interesting style of writing! The best would be to quickly read this one to get a fairly good understanding of the basics and then take up a recent book that addresses other aspects like Mitchell's book, for example.

Having said that, I think the book is a great and inspiring start to using genetic algorithms.

Genetic Algorithms in Search, Optimization, and Machine Learning by David E. Goldberg
Excellent book for Graduate students and instructors. Highly recommend!

Not the only paradigm for evolutionary computation
This book gives a good introduction to genetic algorithms for a general undergraduate audience. However, it is important to note that it does not cover Evolutionary Strategies, an approach to evolutionary computing that I have found quite usefulsince it is specifically designed for Euclidean space optimization problems where many if not most interesting optimization problems are formulated in (take for example the problem of determining the weights of a neural network that minimizes the network's overall classification error). Nor does it cover evolutionary programming (not to be confused with genetic programming). So after reading this book, I recommend (for the mathematically adventurous) Thomas Back's "Evolutionary Algorithms in Theory and Practice: Evolution Strategies, Evolutionary Programming, Genetic Algorithms"
ISBN: 0195099710

Happy reading and enjoy the fascinating world of evolutionary computation!

Read a review article instead!
I agree with another reviewer who said the book was unnecessarily long.Genetic Algorithms are a great programming tool, and there are some tips and tricks that can help your programs converge faster and more accurately, but this book had a lot of redundant information.

If you are interested in using GA for solution-finding, I doubt you'll find much useful in this book beyond the first chapter or so.Many of the examples later in the book were so specific that I couldn't see how they could be usefully generalized.Really optimizing a GA approach for a specific problem domain takes a fair amount of tuning, and this book won't help much with that.

I think time spent surfing siteseer or other publication sites would be better spent than reading this book.

Needs updating
OK, I agree with the previous reviewers: it's the classical textbook for GAs. But it definitely needs updating, as it's a 15-year old book and much has been done in the area. Niching methods, for example, are just outlined. I'd recommend Melanie Mitchell's book instead of this one. ... Read more

Product Description
Make room, James Bond -- Max Remy is an eleven-year-old superspy ready for action. Max may look like your typical kid, but she isn't. In truth she's a world-class superspy involved in a dangerous mission with the international agency Spy Force. When Max's mother sends her off to visit Aunt Eleanor and Uncle Ben for summer vacation, Max and her friend Linden encounter a Time and Space Machine that can carry them anywhere in the world. Dare they test their fate? ... Read more

Customer Reviews (1)

A special kind of agent
Ifyou thought all agents were cool and smart like James Bond or stupid and idiotic like Johnny English, think again!This new book is about the life of a sarcastic and modern agent: Max Remy.Max Remy is a rich kid and lives in her mother's posh city apartment.Her mother is a lot to do with famous personalities in Australia and Max's house is rather beautiful and modern.Max Remy's workoholic mum will be busy during the school holidays so Max Remy is sent to her uncle and aunt's farmhhouse in the Mindawarra.She meets up with her country relatives who she dislikes from first sight and wild boy Linden, until she finds out that her uncle and aunt are famous scientists and are working on a famous space and time machine!Max soon grows attached to her uncle and aunt and soon finds out that her uncle is still sad due to a argument he had 10 years ago with his elder brother, who was also a scientist.Max is determined to find her uncles's brother in London and bring him to Australia to see how sad he is without him using her uncle's time and space machine.Max and Linden go on a search to find her uncle's brother, but during the way they meet a beautiful university colleague who had been drawn down to become a lab assistant by an evil and unstoppable man, Mr Blue.Mr Blue wants to take over the world with the space and time machine and kidnap the two children, knowing that they have it.The two children wake up finding themselves in Blue's Industry.But when they meet Mr Blue they find themselves being lowered into a pit of jelly.Will they survive?

A great read for any children for a little bit of quirky adventure ... Read more

Customer Reviews (2)

favourite of Time Machine books
This was my favourite book of the Time Machine series.I liked learning about dinosaurs.

The search for dinosaurs (time machine 2)
This book is great. It is about you, as a time traveller. As with all the time machine series, you have to choose between several options as you travel back in time to the age of the dinosaurs. Your choise provides your destiny, can you complete the mission, or, as the publishers so well putit, "are you ready to face the danger?". ... Read more

Product Description
Depth search machines (DSMs) and their applications forprocessing combinatorial tasks are investigated and developed in thisbook. The combinatorial tasks are understood widely and containsorting and searching, processing NP-complete and isomorphic completeproblems, computational geometry, pattern recognition, image analysisand expert reasoning. The main philosophy is to see EXISTENCE andEVERY as the basic tasks, while IDENTIFICATION, SEARCHING and ALLalgorithms are given both for single and parallel DSMs. In this book,many IDENTIFICATION, SEARCHING and ALL algorithms are performed insingle and parallel DSMs. In order to support side applications of thegiven approach, there are many new models for representing differentcombinatorial problems. The given approach enables low computationalcomplexity for many practical algorithms to be reached, which istheoretically quite unexpected if the classic approach is followed. ... Read more

Product Description
The legendary story of Harley-Davidson's rise to power--not only as an international industry leader but as an American cultural icon.

How did the Harley-Davidson motorcycle, originally a machine for casual riders, evolve into a symbol of defiance and liberation? An embellished 1947 Life magazine article about a California town terrorized by gangs of motorcycle punks changed the world's perception of motorcycles from sporty machines to menaces-to-society, and as the loudest and heaviest bikes on the market, Harley-Davidsons were considered the baddest of them all.

Outlaw Machine chronicles the fascinating social history that built Harley-Davidson's reputation--including the rise of Hell's Angels and the counterculture classic Easy Rider--and, more entrancing still, the bike's and its company's storybook rise to international fame and popularity. Written by renowned automotive journalist Brock Yates, Outlaw Machine is the definitive book on the Harley-Davidson and its place in American culture.
Amazon.com Review
The Harley-Davidson motorcycle, writes Brock Yates, is aquintessentially American machine: "flawed but honest and forthright,bombastic and audacious like the nation that produced it." Anyone whohas pulled off the road to let a pack of Hells Angels roar by, or whohas watched an executive trade in his Rolex for leather chaps and acustom Softail, also knows that the allure of the Harley is itsrebellious, bad-guy mystique. In Outlaw Machine, Yates sets outto document the history of Harley-Davidson, as a company and as asymbol that helped create--and now sustains--American motorcycleculture.

What Yates gives us, in prose that aims for the sound and fury of his subject but sometimes suffers from a lack of agility, is a modern American success story--"the long ride of the Harley-Davidson into the mainstream." It is the story of how the Harley became the vehicle of choice for rebels and outlaw bikers; how the company distanced itself from this media-enhanced, antiestablishment image as it suffered the onslaught of Japanese imports; how the company stumbled, close to bankruptcy, into the '80s when it realized that the hard-core biker contingent exhibited unequaled brand loyalty. "If this rebelliousness, this sheer vitality and off-the-wall lust for the elemental life could somehow be tapped to offset the seamless onslaught of the Japanese, perhaps ... Harley-Davidson could survive."

Harley-Davidson has capitalized on its "reputation of veiled menace" to establish a marketing niche for the record books, and its classically styled, gleaming machines have become one of the most sought-after status symbols of the '90s. Yet Yates suggests that the Harley's power transcends the mainstream's co-option of its renegade image. "If that rumble, that ungodly roar, that death threat to collectivism and convention dies away, it will be time to turn out the lights." --Svenja Soldovieri ... Read more

Customer Reviews (19)

Outlaw Machine

This was published in 1999, the year before Wild Ride, by Tom Reynolds. The two books fit well together, and both discuss the role of the outlaw biker in the cultural image and the self-image of non-outlaw riders of H-D motorcycles. Yates spends some time on the topic of how the association of Harley-Davidson motorcycles with the outlaw biker has led to pervasive playacting among Harley riders. This book includes a history of the Harley-Davidson Motor Company (which Reynolds' book doesn't have). The telling of that history is not about the bikes as much as it is about the business-end of it and of how H-D eventually accepted the background influence of the outlaw bikers upon the popularity of their motorcycles.

The best explanation
This is by far the best and most honest explanation of why Harley Davidson motorcycles are what they are.Yates is outstanding!

American Soul
I found this read to be just great.It gives you a brief history of the begining of the company and brings you right through the culture of the biker and the attraction of the Harley Davidson.A true motorcyclist will be totally engrossed.

Good Introduction to Bike History
Having started with a minibike at age 5, and eventually moving up through dirt bikes, Japanese bikes and eventually to Harley's by the time I was 30, I wanted to know a bit of motorcycle history.

I picked up the book on a whim thinking it would have a good bit of history without taking the rest of my life to read, and wasn't disappointed.The book, though not a detailed account of every facet of motorcycling, served its purpose well.It's a good and entertaining introduction into the history of the Harley Davidson.

Several of its points rang true.For instance the fact that Japanese bikes, though undoubtedly technologically superior, just don't have the soul of a Harley sums up the reasons I eventually abandoned the former bikes for the American brand (the difference in price tags had a bit to do with buying one later in life as well, come to think of it).

I truly enjoyed the book, and would suggest it to anyone who is looking for an introduction into Harley history.

Take it for a ride
Brock Yates provides a compelling overview of the Harley-Davidson history, and interesting thoughts on what Harley means to America. In some cases his philsophical pronouncements exceed his grasp, and in a few spots he becomes repetitive. Still, as a Harley owner, I greatly enjoyed the book. It does not get mired in tech specs, nor in meaningless detail of the Davidson family lineage. It is definitely not a hagiography -- he strikes the balance between pointing out flaws and giving credit where due. Others here say he stumbled on some history, but I value his writing that quickly moved me from cover to cover. It hits the high spots, and entertainingly tells me more about the Harley company and history than I knew before. ... Read more

Product Description

Mike Burrows is a legend, and this is the masterwork from the world's most famous and irreverent bicycle designer and inventor. Bicycle Design is the essential handbook if you want to know how to go faster, if you want the secrets of great bike design, or if you simply love cycle technology.

Customer Reviews (9)

Eccentric Tinkerer
The book is short and doesn't claim to be anything that it isn't.Burrows is an eccentric tinkerer and he covers nearly every topic that a commuter like myself could querry.The section on aerodynamics is terrific, the suspension section omitted Zipp bikes and Soft Ride suspensions, perhaps Burrows doesn't consider Zipp 3001 bicycle frames and Soft Ride seats suspension at all.

Burrows doesn't cover everything, but what he does cover is covered with the honesty of trial and error.There's no index, but the bibliography covers anything that Burrows might've forgotten.

Decent review of basic design concepts
I just picked up brand new copy of "Bicycle Design" by Mike Burrows at used book store for $9 and I have to say that for that price it is very nice review of basic design ideas. Ir is true that that book is not technical at all and if I paid $70 for it I would be rather disappointed. I think that max price I would pay for it is about $18-20.

Not very objective
This is a fun read, but much is opinion, rather than fact...... OK for a laugh, see bicycle science for a more serious, and objective study.

Okay but not great
Mike Burrows is or was a designer for the Chinese bike mfr, Giant. He's a Brit and the book is replete with his understated and self-deprecating British humor, which I think some reviewers misunderstood. Other reviewers also seem put off by the lack of quantitative data in the book, in spite of Mike's title as an "engineer." However, the title of "engineer" in Britain has the connotation of a mechanical tinker, not just the math whiz designers that we turn out in the States. Mike Burrows rose to his current position from experience as a mechanical tinker, not through mastering calculus, and there's nothing wrong with that.

I was disappointed with the book, however, because it had the potential to be so much more. Mike obviously knows a lot, gives us his opinions but fails to present the basis for them. It's not terribly helpful, for example, for Mike to show a picture of a bicycle, pronounce it bad, then fail to give his rationale. Perhaps he feels the flaws to be evident from a simple picture but they're not.

It feels more like a coffee-table book than a serious bike book--thick glossy paper stock, sixteen color pages in the middle, etc. Graphically, it's attractive, even if many of the illustrations are cartoonish.

About the only sections where I found new information was when he discussed hub gears and suspensions.

I think it would be fairer if the book were entitled "Mike Burrows' opinions about bike design" than "Bicycle Design." Readers interested in quant stuff should get "Bicycle Science" by Wilson. Readers interested in building their own machine should get "Atomic Zombie's Bicycle Builder's Bonanza" by Graham and McGowan.

I read the book cover to cover in two sittings over three hours. I'll probably donate it to my local library. I would have been pleased to read it there, probably would have been okay with paying about $12.00 for it, but was disappointed that I spent $27.

Very Superficial
I only read about 25% of the sections. I did not proceed because every section I read was astonishingly shallow. Either nothing at all would be stated on a subject or extreme statements would be made with no back up reasoning what-so-ever. For example Mr Burrows says that all types and alloys of steel have equal rigidity in bicycle frames and anyone that claims otherwise "is a liar." This contradicts all the data about different qualities of the variety of steels. Maybe Burrows is right but he gives no supporting evidence at all. In other instances he will be wordy on a subject, send the reader to another publication sometimes stating "if you can find it available" -- This about steering and trail in the chapter dedicated to handling. About handling he concludes "tyre size is not so important... Wheelbase is unimportant and neither are angles or fork rake ... there are no good bikes just good riders. And I should know, because I'm crap on all bikes." This is an exact quote from page 35. ... Read more

Product Description
This text provides a historical and thematic survey of the range and types of UFOs and related phenomena. ... Read more

Customer Reviews (1)

Will leave you smarter--& more excited--than you were before
In 5th grade, this book seared my imagination. I couldn't stop thinking about it for months. Then, I recently reread it (I'm 29), and was blown away, still, by the suspenseful participation in it. What makes this book so much better than others is it's historical accuracy. It has been the most influential source for informing my knowledge of prehistoric earth. If you or your child want to gain a familiar working knowledge of time from the Cambrian to the Cretaceous, and be able to identify every dinosaur with it's correct time period, habitat, and diet, then this book is for you. ... Read more

Product Description
This digital document is a journal article from Computers and Operations Research, published by Elsevier in 2004. The article is delivered in HTML format and is available in your Amazon.com Media Library immediately after purchase. You can view it with any web browser.

Description:
In this study, we consider the problem of scheduling a set of independent jobs with sequence dependent setups on a set of uniform parallel machines such that total tardiness is minimized. Jobs have non-identical due dates and arrival times. A tabu search (TS) approach is employed to attack this complex problem. In order to obtain a robust search mechanism, several key components of TS such as candidate list strategies, tabu classifications, tabu tenure and intensification/diversification strategies are investigated. Alternative approaches to each of these issues are developed and extensively tested on a set of problems obtained from the literature. The results obtained are considerably better than those reported previously and constitute the best solutions known for the benchmark problems as to date. Scope and purpose Several surveys on parallel machine scheduling with due date related objectives (Oper. Res. 38(1) (1990) 22; EJOR 38 (1989) 156; Oper. Res. 42 (1994) 1025) reveal that the NP-hard nature of the problem renders it a challenging area for many researchers who studied various versions. However, most of these studies make the assumption that jobs are available at the beginning of the scheduling period, which is an important deviation form reality. In this study, as well as distinct due dates and ready times, features such as sequence dependent setup times and different processing rates for machines are incorporated into the classical model. These enhancements approach the model to the actual practice at the expense of complicating the problem further. For this complex problem, we present a tabu search (TS) algorithm to minimize total tardiness and provide the best solutions known for a set of benchmark problems. ... Read more

Product Description
Designed for anyone with a general interest in science; students and researchers in computer studies, artificial intelligence, mathematics; psychologists and physiologists interested in attempts to make machines mimic brain function. ... Read more

Product Description
This digital document is a journal article from European Journal of Operational Research, published by Elsevier in 2006. The article is delivered in HTML format and is available in your Amazon.com Media Library immediately after purchase. You can view it with any web browser.

Description:
An m-objective tabu search algorithm for sequencing of n jobs on a single machine with sequence-dependent setup times is proposed. The algorithm produces a solution set that is reflective of the objectives' weights and close to the best observed values of the objectives. We also formulate a mixed integer linear program to obtain the optimal solution of a three-objective problem. Numerical examples are used to study the behavior of the proposed m-objective tabu search algorithm and compare its solutions with those of the mixed integer linear program. ... Read more

Product Description
This digital document is a journal article from European Journal of Operational Research, published by Elsevier in 2007. The article is delivered in HTML format and is available in your Amazon.com Media Library immediately after purchase. You can view it with any web browser.

Description:
In this study, a tabu search (TS) approach to the single machine total weighted tardiness problem (SMTWT) is presented. The problem consists of a set of independent jobs with distinct processing times, weights and due dates to be scheduled on a single machine to minimize total weighted tardiness. The theoretical foundation of single machine scheduling with due date related objectives reveal that the problem is NP-hard, rendering it a challenging area for meta-heuristic approaches. This paper presents a totally deterministic TS algorithm with a hybrid neighborhood and dynamic tenure structure, and investigates the strength of several candidate list strategies based on problem specific characteristics in increasing the efficiency of the search. The proposed TS approach yields very high quality results for a set of benchmark problems obtained from the literature. ... Read more

Product Description
This digital document is an article from Modern Machine Shop, published by Gardner Publications, Inc. on September 1, 2010. The length of the article is 445 words. The page length shown above is based on a typical 300-word page. The article is delivered in HTML format and is available immediately after purchase. You can view it with any web browser.

Citation Details
Title: Streamline your search for new machine tools: trying to determine what specific new mill, lathe or grinding machine to buy? An online resource with comprehensive machine model specs can help you identify the right one for your application.(ONE OFF)
Author: Derek Korn
Publication: Modern Machine Shop (Magazine/Journal)
Date: September 1, 2010
Publisher: Gardner Publications, Inc.
Volume: 83Issue: 4Page: 14(1)

Distributed by Gale, a part of Cengage Learning ... Read more

Product Description
This digital document is a journal article from European Journal of Operational Research, published by Elsevier in . The article is delivered in HTML format and is available in your Amazon.com Media Library immediately after purchase. You can view it with any web browser.

Description:
This paper considers the problem of scheduling jobs on unrelated parallel machines to minimize the makespan. Recovering Beam Search is a recently introduced method for obtaining approximate solutions to combinatorial optimization problems. A traditional Beam Search algorithm is a type of truncated branch and bound algorithm approach. However, Recovering Beam Search allows the possibility of correcting wrong decisions by replacing partial solutions with others. We develop a Recovering Beam Search algorithm for our unrelated parallel machine scheduling problem that requires polynomial time. Computational results show that it is able to generate approximate solutions for instances with large size (up to 1000 jobs) using a few minutes of computation time. ... Read more

Product Description
This digital document is a journal article from European Journal of Operational Research, published by Elsevier in 2006. The article is delivered in HTML format and is available in your Amazon.com Media Library immediately after purchase. You can view it with any web browser.

Description:
This paper addresses the one-machine scheduling problem where the objective is to minimize a sum of costs such as earliness-tardiness costs. Since the sequencing problem is NP-hard, local search is very useful for finding good solutions. Unlike scheduling problems with regular cost functions, the scheduling (or timing) problem is not trivial when the sequence is fixed. Therefore, the local search approaches must deal with both job interchanges in the sequence and the timing of the sequenced jobs. We present a new approach that efficiently searches in a large neighborhood and always returns a solution for which the timing is optimal. ... Read more

Product Description
This digital document is a journal article from European Journal of Operational Research, published by Elsevier in 2006. The article is delivered in HTML format and is available in your Amazon.com Media Library immediately after purchase. You can view it with any web browser.

Description:
We consider the Just-in-Time scheduling problem where the Just-in-Time notion is captured by means of multiple conflicting criteria. The calculation of any non-dominated solution for these criteria is achieved by solving an extension of the single machine problem of minimising the mean weighted deviation from distinct due dates. In the extended problem each job to schedule is also constrained by a release date and a deadline. This problem is NP-Hard in the strong sense and we propose heuristic algorithms to solve it. Computational experiments show that, among those algorithms, the most effective heuristic, in terms of quality, is a Recovering Beam Search algorithm. ... Read more