Recent Advances in Computational Optimization Results of the Workshop on Computational Optimization WCO 2019 9783030588830, 9783030588847

This book is a comprehensive collection of extended contributions from the Workshops on Computational Optimization 2019.

461 104 7MB

English Pages 199 [203] Year 2021

Report DMCA / Copyright

DOWNLOAD FILE

Recent Advances in Computational Optimization Results of the Workshop on Computational Optimization WCO 2019
 9783030588830, 9783030588847

Table of contents :
Organization
Conference Co-chairs
Program Committee
Preface
Contents
Validation and Optimization of Dam Break Flood Risk Mapping Based on Field Test Cases in Armenia
1 Introduction
2 Study Area
2.1 Geghi Reservoir
2.2 Geghanoush Tailing Storage Facility (TSF)
3 Methodology and Data Used for Simulations
3.1 Methodology
3.2 Data Sets Used for the Modelling
4 Simulation Results
4.1 Input Data
4.2 Software
4.3 Method Used
4.4 Result 1. Flood Hazard Index
4.5 Result 2. River Maximum Flow Analysis
4.6 Result 3. Dam Breach Maximum Outflow and Breach Hydrograph Calculation
5 Armenian Field Test Cases
5.1 The Road to the Field Exercises
5.2 Scenarios
5.3 Evaluation of the Field Exercises
5.4 Outcomes of the Field Exercises
6 Desktop Open Source GIS for Flood Hazard Map Visualization
7 Conclusion
References
Fire Simulator Capable to Analyze Fire Spread in Real Time with Limited Field Weather Data. Case Study—Kresna Fire (2017)
1 Introduction
2 Wildfire Simulation Tools Applied Since 2009 for Bulgarian Test Cases
3 Wildfire Analyst (WFA) Tool
4 Simulation Results for Kresna Gorge Fire (2017) Test Case
5 Conclusions
References
Utilizing Minimum Set-Cover Structures with Several Constraints for Knowledge Discovery on Large Literature Databases
1 Introduction
2 Problem Formulation and Definition
2.1 Generating and Optimisation of Search Queries
2.2 Complexity
2.3 Generating and Optimisation of Cluster Labels
2.4 Complexity
3 Hierarchical Approaches
3.1 Problem Description
3.2 Using Unique Keyword Descriptions on Bipartite Graphs
3.3 Dynamic Programming and Bipartite Graph Heuristic
3.4 Spanning Tree Approach
4 Non-hierarchical Approaches
4.1 Problem Description
4.2 An Integer Linear Program Approach
4.3 Dynamic Programming and Bipartite Graph Heuristic
5 Experimental Results
6 Conclusions
References
Evaluation of Optimal Charging Station Location for Electric Vehicles: An Italian Case-Study
1 Introduction
2 Literature Review
3 An Italian Case-Study
4 Mathematical Models for Optimal Location
4.1 p-Median
4.2 p-Center
4.3 p-Centdian
5 Key Performance Indicators
6 Numerical Experiments
7 Conclusions
References
InterCriteria Analysis of the Evaporation Parameter Influence on Ant Colony Optimization Algorithm: A Workforce Planning Problem
1 Introduction
2 Workforce Planning Problem
3 Ant Colony Optimization Algorithm
3.1 Main ACO Algorithm
3.2 Workforce Planing ACO
4 InterCriteria Analysis
5 Computational Results and Discussion
5.1 Numerical Experiments
5.2 Application of the InterCriteria Analysis
5.3 ICrA Results of Data for Average Number of Iterations
5.4 ICrA Results of Data for Maximum Number of Iterations
5.5 ICrA Results of Data from Ranking of the Results
6 Conclusion
References
Caterpillar Alignment Distance for Rooted Labeled Caterpillars: Distance Based on Alignments Required to Be Caterpillars
1 Introduction
2 Preliminaries
3 Alignment Distance
4 Caterpillar Alignment Distance
5 The Algorithm of Computing Caterpillar Alignment Distance
6 Experimental Results
7 Conclusion and Future Works
References
ICrA Over Ordered Pairs Applied to ABC Optimization Results
1 Introduction
2 InterCriteria Analysis Background
3 Artificial Bee Colony Optimization Algorithm
4 Case study: E. coli Fed-Batch Cultivation Process
5 Numerical Results
6 InterCriteria Analysis of the Results
7 Conclusion
References
A Game Theoretical Approach for VLSI Physical Design Placement
1 Introduction
1.1 The Placement Problem
1.2 Formal Description of the Placement Problem
1.3 Current Techniques for Efficient Placement
2 Our Local-Search Method for Solving the Placement Problem
2.1 The Placement Problem as a Game
2.2 Search for a Solution over the Solution Space
2.3 Algorithms Based on Best-Response Dynamics
2.4 Coordinated Deviation of a Cooperative
2.5 Expected Algorithms' Progress
3 Experimental Results
3.1 Experiments Setup
3.2 Results for Unilateral Deviations
3.3 Comparison with the Simulated Annealing Algorithm
3.4 Results for Coordinated Deviations
4 Summary and Conclusions
References
Application of Information Systems and Technologies in Transport
1 Introduction
2 Essence of an Information System
3 Information System for Solving a Two Level Hierarchical Tasks
4 Solution of Optimization Task for Maximum Flow
5 Conclusion
6 Conclusion
References
Online Algorithms for 1-Space Bounded Cube Packing and 2-Space Bounded Hypercube Packing
1 Introduction
1.1 Related Work
1.2 Our Results
2 The One-Space-Algorithm
2.1 Description of the One-Space-Algorithm
2.2 Competitive Ratio
3 The two-space-algorithm
3.1 Algorithm Small(Ci, mathcalBm)
3.2 Algorithm Subhypercube
References
Author Index

Polecaj historie