"Evolutionary Computation in Combinatorial Optimization" - Information and Links:

Evolutionary Computation in Combinatorial Optimization - Info and Reading Options

17th European Conference, EvoCOP 2017, Amsterdam, the Netherlands, April 19-21, 2017, Proceedings

"Evolutionary Computation in Combinatorial Optimization" was published by Springer International Publishing AG in 2017 - Cham, it has 249 pages and the language of the book is English.


“Evolutionary Computation in Combinatorial Optimization” Metadata:

  • Title: ➤  Evolutionary Computation in Combinatorial Optimization
  • Authors:
  • Language: English
  • Number of Pages: 249
  • Publisher: ➤  Springer International Publishing AG
  • Publish Date:
  • Publish Location: Cham

“Evolutionary Computation in Combinatorial Optimization” Subjects and Themes:

Edition Specifications:

  • Weight: 4.044

Edition Identifiers:

AI-generated Review of “Evolutionary Computation in Combinatorial Optimization”:


"Evolutionary Computation in Combinatorial Optimization" Description:

Open Data:

Intro -- Preface -- Organization -- Contents -- A Computational Study of Neighborhood Operators for Job-Shop Scheduling Problems with Regular Objectives -- 1 Introduction -- 2 The Job-Shop Scheduling Problem -- 3 Neighborhood Structures for Job Shop Scheduling -- 4 Experimental Study -- 4.1 Experimental Evaluation -- 4.2 Iterative Best Improvement Versus Iterative First Improvement for Single Neighborhoods -- 4.3 First-Improvement Variable Neighborhood Descent -- 4.4 Iterated Local Search Algorithm -- 5 Conclusions -- References -- A Genetic Algorithm for Multi-component Optimization Problems: The Case of the Travelling Thief Problem -- 1 Introduction -- 2 Travelling Thief Problem -- 3 Multi-component Genetic Algorithm -- 4 Methodology and Results -- 5 Conclusion and Future Work -- References -- A Hybrid Feature Selection Algorithm Based on Large Neighborhood Search -- 1 Introduction -- 2 Literature Review -- 3 WFLNS: A Wrapper Filter Feature Selection Based on LNS -- 3.1 Encoding Representation and Initialization -- 3.2 Destroy and Repair Methods -- 3.3 Objective Function -- 3.4 Acceptance Method -- 4 Experimental Results and Discussion -- 4.1 Classification Accuracy -- 4.2 Effect of Destruction Degree Parameter -- 4.3 Effect of Acceptance Criteria -- 5 Conclusion -- References -- A Memetic Algorithm to Maximise the Employee Substitutability in Personnel Shift Scheduling -- 1 Introduction -- 2 Problem Definition and Formulation -- 3 A Memetic Algorithm to Maximise the Employee Substitutability -- 3.1 Population Initialisation -- 3.2 Local Search (LS) -- 3.3 Repair (R) -- 3.4 Evolutionary Cycle -- 4 Computational Experiments -- 4.1 Test Design -- 4.2 Validation of the Proposed Procedure -- 5 Conclusions -- References

Read “Evolutionary Computation in Combinatorial Optimization”:

Read “Evolutionary Computation in Combinatorial Optimization” by choosing from the options below.

Search for “Evolutionary Computation in Combinatorial Optimization” downloads:

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

Find “Evolutionary Computation in Combinatorial Optimization” in Libraries Near You:

Read or borrow “Evolutionary Computation in Combinatorial Optimization” from your local library.

Buy “Evolutionary Computation in Combinatorial Optimization” online:

Shop for “Evolutionary Computation in Combinatorial Optimization” on popular online marketplaces.