{"text_format":"2","workbook":"xls","n_sheets":1,"sheets":["report2"],"not_rendered":{"charts":0,"images":0,"macros":0,"external_links":1,"defined_names":1,"comments":0,"pivot_tables":0},"unopened":[],"bounds":{"document_bytes":16777216,"sheet_cells":100000,"run_cost":"one","rows_first":2000,"rows_last":500,"rows_between":2000,"halvings":0,"cell_chars":16384,"cell_head_chars":4096},"cells_cut":0,"cells_raw":0,"read":"whole","date_system":"1900","formulas":"cached_only"}

{"sheet":"report2","index":0,"n_rows":25,"n_cols":5,"rows_kept":25,"cut":false,"hidden":false,"merged":[[0,2,0,3],[0,4,0,5],[1,2,1,3],[1,4,1,5],[2,2,2,3],[3,2,3,3],[4,2,4,3],[5,2,5,3],[6,2,6,3],[7,2,7,3],[8,2,8,3],[18,2,18,3],[19,2,19,3],[22,2,22,3]],"flags":["formulas_cached_only"]}
[null,"1.","Record Nr.",null,"UNINA9910483329803321"]
[null,null,"Titolo",null,"Evolutionary Computation in Combinatorial Optimization : 17th European Conference, EvoCOP 2017, Amsterdam, The Netherlands, April 19-21, 2017, Proceedings / / edited by Bin Hu, Manuel López-Ibáñez"]
[null,null,"Pubbl/distr/stampa",null,"Cham : , : Springer International Publishing : , : Imprint : Springer, , 2017"]
[null,null,"ISBN",null,"3-319-55453-0"]
[null,null,"Edizione",null,"[1st ed. 2017.]"]
[null,null,"Descrizione fisica",null,"1 online resource (XII, 249 p. 46 illus.)"]
[null,null,"Collana",null,"Theoretical Computer Science and General Issues, , 2512-2029 ; ; 10197"]
[null,null,"Disciplina",null,"005.432"]
[null,null,"Soggetti",null,"Numerical analysis"]
[{"$nulls":4},"Algorithms"]
[{"$nulls":4},"Computer science - Mathematics"]
[{"$nulls":4},"Discrete mathematics"]
[{"$nulls":4},"Computer science"]
[{"$nulls":4},"Artificial intelligence"]
[{"$nulls":4},"Numerical Analysis"]
[{"$nulls":4},"Discrete Mathematics in Computer Science"]
[{"$nulls":4},"Theory of Computation"]
[{"$nulls":4},"Artificial Intelligence"]
[null,null,"Lingua di pubblicazione",null,"Inglese"]
[null,null,"Formato",null,"Materiale a stampa"]
[null,null,null,"Livello bibliografico","Monografia"]
[null,null,null,"Nota di bibliografia","Includes bibliographical references and index."]
[null,null,"Nota di contenuto",null,"A Computational Study of Neighborhood Operators for Job-shop Scheduling Problems with Regular Objectives -- A Genetic Algorithm for Multi-Component Optimization Problems: the Case of the Travelling Thief Problem -- A Hybrid Feature Selection Algorithm Based on Large Neighborhood Search -- A Memetic Algorithm to Maximise the Employee Substitutability in Personnel Shift Scheduling -- Construct, Merge, Solve and Adapt versus Large Neighborhood Search for Solving the Multi-Dimensional Knapsack Problem: Which One Works Better When -- Decomposing SAT Instances with Pseudo Backbones -- Efficient Consideration of Soft Time Windows in a Large Neighborhood Search for the Districting and Routing Problem for Security Control -- Estimation of Distribution Algorithms for the Firefighter Problem -- LCS-Based Selective Route Exchange Crossover for the Pickup and "]
[{"$nulls":4},"Delivery Problem with Time Windows -- Multi-rendezvous Spacecraft Trajectory Optimization with Beam P-ACO -- Optimizing Charging Station Locations for Electric Car-Sharing Systems -- Selection of Auxiliary Objectives Using Landscape Features and Offline Learned Classifier -- Sparse, Continuous Policy Representations for Uniform Online Bin Packing via Regression of Interpolants -- The Weighted Independent Domination Problem: ILP Model and Algorithmic ."]
[null,null,null,"Sommario/riassunto","This book constitutes the refereed proceedings of the 17th European Conference on Evolutionary Computation in Combinatorial Optimization, EvoCOP 2017, held in Amsterdam, The Netherlands, in April 2017, co-located with the Evo*2017 events EuroGP, EvoMUSART and EvoApplications. The 16 revised full papers presented were carefully reviewed and selected from 39 submissions. The papers cover both empirical and theoretical studies on a wide range of academic and real-world applications. The methods include evolutionary and memetic algorithms, large neighborhood search, estimation of distribution algorithms, beam search, ant colony optimization, hyper-heuristics and matheuristics. Applications include both traditional domains, such as knapsack problem, vehicle routing, scheduling problems and SAT; and newer domains such as the traveling thief problem, location planning for car-sharing systems and spacecraft trajectory optimization. Papers also study important concepts such as pseudo-backbones, phase transitions in local optima networks, and the analysis of operators. This wide range of topics makes the EvoCOP proceedings an important source for current research trends in combinatorial optimization."]