Evolutionary computation in combinatorial optimization - Info and Reading Options

Open Data:

Title -- Preface -- Organization -- Table of Contents -- Dual Sequence Simulated Annealing with Round-Robin Approach for University Course Timetabling -- Introduction -- Problem Descriptions -- The Algorithm -- Neighbourhood Structures -- Constructive Heuristic -- Improvement Algorithm: DSA -- Round Robin Algorithm, RR -- Experimental Results -- Conclusion and Future Work -- References -- Heuristic and Exact Methods for the Discrete (r | p)-Centroid Problem -- Introduction -- Problem Formulation -- Lower Bounds -- Initial Population -- Main Operators and Parameters -- Tabu Search -- Upper Bounds -- AnExactMethod -- Computational Results -- Conclusions -- References -- On the Benefit of Sub-optimality within the Divide-and-Evolve Scheme -- Introduction -- Planning Problems -- Divide-and-Evolve -- Representation -- Fitness, and Embedded Planners -- Initialization and Variation Operators -- Evolution Engine and Parameter Settings -- Experimental Results -- Conclusion -- References -- A Real-Integer-Discrete-Coded Differential Evolution Algorithm: A Preliminary Study -- Introduction -- Related Works -- The Real-Coded Differential Evolution Algorithm -- The Proposed Real-Integer-Discrete-Coded Differential Evolution Algorithm -- Vector Representation and Initialization -- Mutation Operator -- Crossover Operator -- Acceptance Operator -- Diversity Generating Mechanism -- Numerical Experiments and Discussions -- The Integer-Valued Gear Train Design Problem -- The Real-Integer-Discrete-Valued Coil Spring Design Problem -- Conclusions -- References -- Fitness Distance Correlation and Search Space Analysis for Permutation Based Problems -- Introduction -- Definitions and Operators -- Operators -- Fitness Distance Correlation and Point Quality -- Distance Algorithms -- Data Generation and Test Problems -- Results -- Conclusion -- References

Search for “Evolutionary computation in combinatorial optimization” downloads:

Visit our Downloads Search page to see if downloads are available.

Borrow "Evolutionary computation in combinatorial optimization" Online:

Check on the availability of online borrowing. Please note that online borrowing has copyright-based limitations and that the quality of ebooks may vary.

• Is Online Borrowing Available: Yes
• Preview Status: full
• Check if available: The Open Library & The Internet Archive

Find “Evolutionary computation in combinatorial optimization” in Libraries Near You:

Read or borrow “Evolutionary computation in combinatorial optimization” from your local library.

• The WorldCat Libraries Catalog: Find a copy of “Evolutionary computation in combinatorial optimization” at a library near you.