Recent Advances in Computational Optimization: Results of the Workshop on Computational Optimization WCO 2020 (Studies in Computational Intelligence, 986)

✍ Scribed by Stefka Fidanova (editor)

• Publisher: Springer
• Year: 2021
• Tongue: English
• Leaves: 487
• Category: Library

✦ Synopsis

This book presents recent advances in computational optimization. Our everyday life is unthinkable without optimization. We try to minimize our effort and to maximize the achieved profit. Many real-world and industrial problems arising in engineering, economics, medicine and other domains can be formulated as optimization tasks.

The book is a comprehensive collection of extended contributions from the Workshops on Computational Optimization 2020. The book includes important real problems like modeling of physical processes, workforce planning, parameter settings for controlling different processes, transportation problems, wireless sensor networks, machine scheduling, air pollution modeling, solving multiple integrals and systems of differential equations which describe real processes, solving engineering problems. It shows how to develop algorithms for them based on new intelligent methods like evolutionary computations, ant colony optimization, constrain programming and others. This research demonstrates how some real-world problems arising in engineering, economics and other domains can be formulated as optimization problems.

✦ Table of Contents

Organization
Preface
Contents
Statistical Measurements of Metaheuristics for Solving Engineering Problems
1 Introduction
2 Constrained Optimization
3 Benchmark Problems
4 An Enhanced Approach for Solving Constrained Engineering Problems: BSGM
5 Multiple-Problem Analysis Tests
6 Experimental Settings
6.1 Parameter Settings
7 Results
8 Conclusion and Future Work
References
Heuristic Approaches for the Stochastic Multi-depot Vehicle Routing Problem with Pickup and Delivery
1 Introduction
1.1 Related Work
2 Problem Description and Model
2.1 MDVRPPD
2.2 S-MDVRPPD
3 The Expected Cost of an a Priori Route
4 ILS and VNS
4.1 Initial Solution Generation
4.2 Local Search
4.3 Perturbation Operators
4.4 VNS
4.5 ILS-VND
5 Tabu Search
6 Computational Experiments
7 Conclusion
References
Evaluation of MO-ACO Algorithms Using a New Fast Inter-Criteria Analysis Method
1 Introduction
2 Basics of Belief Functions
2.1 Basic Definitions
2.2 Canonical Decomposition of Dichotomous BBA
2.3 Fast Fusion of Dichotomous BBAs
3 The BF-ICrA Method
4 Fast BF-ICrA Method
5 Multi-objective ACO Algorithm
6 Application to WSN Layout Deployment
6.1 Application of Fast BF-ICrA in Example 1 (350times350 Points)
6.2 Application of Fast BF-ICrA in Example 2 (500times500 Points)
6.3 Application of Fast BF-ICrA in Example 3 (700times700 Points)
7 Application to Workforce Planning Problem (WPP)
7.1 The Workforce Planning Problem (WPP)
7.2 WPP Addressed in This Paper
7.3 Results of WPP Obtained with Fast BF-ICrA
8 Conclusions
References
Semantic Graph Queries on Linked Data in Knowledge Graphs
1 Introduction
2 Related Work
3 Background
4 Method
4.1 Pathfinding
4.2 CRPQ
5 Evaluation
5.1 Pathfinding
5.2 CRPQ
6 Applications from Digital Humanities: Centrality Measures
7 Classification of Problems
7.1 New Criteria
7.2 Complexity
8 Conclusion and Outlook
References
Online Single-Machine Scheduling via Reinforcement Learning
1 Introduction
2 Reinforcement Learning
3 Literature Review
4 Reinforcement Learning Algorithms for Online Scheduling
4.1 States, Actions, and Rewards
4.2 RL Algorithms Adopted
5 Simulation Setting
6 Experimental Results and Discussion
6.1 RL Algorithms Versus Random and EDD
6.2 Q(λ) Performance Against Different Job Arrival Rates
6.3 Comparison Between Q(λ) and DQN
7 Conclusions and Future Research Directions
References
Ant Colony Optimization Algorithm for Fuzzy Transport Modelling: InterCriteria Analysis
1 Introduction
2 Ant Colony Optimization Method
3 InterCriteria Analysis
4 Problem Formulation
5 Results and Discussion
5.1 Experimental Solutions
5.2 InterCriteria Analysis of the Results
6 Conclusion
References
Approximation and Exact Algorithms for Multiprocessor Scheduling Problem with Release and Delivery Times
1 Introduction
2 Approximation Algorithm MDT/IIT
3 Property of MDT/IIT Algorithm
4 Branch and Bound Method for P|ri,qi|Cmax
4.1 Branching Rule IIT
4.2 The Idle Time of All Processor I(UB)
4.3 Lower Bound Procedure
4.4 Elimination Rule
5 Computation Result
6 Conclusion
References
A Hybrid Method for Scheduling Multiprocessor Tasks on Two Dedicated Processors
1 Introduction
2 Background
3 Tackling the ST2P with a Hybrid Method
3.1 ST2P's Lower Bound
3.2 A Starting Solution
3.3 An Enhancing Strategy
3.4 Exploring the Search Space
3.5 An Overview of the Hybrid Method
4 Experimental Part
4.1 Parameter Settings
4.2 Behavior of HM Versus Available Methods (Set 1)
4.3 Behavior of HM Versus Available Methods (Set 2)
5 Conclusion
References
Mathematical Model and Its Optimization to Predict the Parameters of Compressive Strength Test
1 Introduction
2 Background
3 The Compressive Cement Strength: Parameters' Prediction
3.1 Regression Analysis
3.2 Adaptation of the Gradient Descent
3.3 Optimization and Prediction Processes
4 Computational Results
4.1 Effect of the Number of Iterations
4.2 Effect of the Learning Rate
4.3 Statistical Analysis
4.4 Behavior of the the Second Version of the Descent Method
5 Conclusion
References
Optimal Tree of a Complete Weighted Graph
1 Introduction
2 Sub-Problem: Tree Weight Optimisation
3 Problem: Tree Structure Optimisation
3.1 Simulated Annealing (SA)
3.2 Iterated Local Search (ILS)
3.3 Tree Structure Change for Optimisation
4 Results
4.1 Biased Versus Unbiased SA
4.2 SA Versus ILS
5 Conclusion
References
Simulation of Diffusion Processes in Bimetallic Nanofilms
1 Introduction
2 Literature Overview
3 Proposed Approach
4 Experiments
5 Conclusion
References
On the Problem of Bimetallic Nanostructures Optimization: An Extended Two-Stage Monte Carlo Approach
1 Introduction
2 The Basic Algorithms
2.1 The Wide-Lattice Monte Carlo Algorithm
2.2 The Diffusion Algorithm
2.3 Relaxation with Molecular Dynamics
3 The Combined Method
4 Verification
5 Conclusion
References
An Analysis on the Degrees of Freedom of Binary Representations for Solutions to Discretizable Distance Geometry Problems
1 Introduction
2 Current DDGP Solution Methods
3 A Binary Representation for DDGP Solutions
4 Conclusions and Perspectives
References
Dynamic Programming for the Synchronization of Energy Production and Consumption Processes
1 Introduction
2 The Energy Production/Consumption (EPC) Problem
3 Separately Handling Vehicle and Production Activities
3.1 Scheduling the Hydrogen Production Activity
3.2 Scheduling the Vehicle Activity: The Vehicle_Driver Problem
4 Linking Production and Vehicle DPS into a Unique Global Dynamic Programming Scheme
4.1 Logical Filtering Devices
4.2 Quality Based Filtering Devices: A Greedy Version of DP_EPC
5 Linking Production and Vehicle DPS in a Pipe-Line Collaborative Scheme
5.1 The Ext_Prod Extended Production Model
5.2 The DP_Ext_Prod Algorithm
5.3 The Pipeline Scheme
6 Numerical Experiments
7 Conclusion
References
Reducing the First-Type Error Rate of the Log-Rank Test: Asymptotic Time Complexity Analysis of An Optimized Test's Alternative
1 Introduction
2 Principles, Assumptions and Limitations of the Log-Rank Test
2.1 Principles of the Log-Rank Test
2.2 Some of the Assumptions and Limitations of the Log-Rank Test
3 Introduction of an Assumption-Free Alternative to the Log-Rank Test
3.1 Principle of the Proposed Assumption-Free Alternative to the Log-Rank Test
3.2 A Brief Analysis of Surface Bounded by Two Non-crossing Survival Curves and the Test's p-value
3.3 Approaches on Calculation the p-value of the Proposed Alternative to the Log-Rank Test
4 Simulation Study
5 Discussion
6 Conclusion
References
Zero Point Approach to Three-Dimensional Intuitionistic Fuzzy Transportation Problem
1 Introduction
1.1 A Brief Literature Review of the Methods for FTPs
1.2 A Brief Literature Review of the Methods for IFTPs
2 Preliminaries
2.1 Short Remarks on Intuitionistic Fuzzy (IF) Logic
2.2 Definition, Operations and Relations over 3-D Intuitionistic Fuzzy Index Matrices
3 Zero Point Approach to the 3-D IFTP
4 An Application of 3-D Intuitionistic Fuzzy Zero-Point Approach
5 Conclusion
References
On Index-Matrix Interpretation of Interval-Valued Intuitionistic Fuzzy Hamiltonian Cycle
1 Introduction
2 Basic Definitions of IVIFIMs, Interval-Valued Intuitionistic Fuzzy Pairs and IVIFGs
2.1 Short Remarks on IVIFPs
2.2 Definition, Operations and Relations over Extended Interval-Valued Intuitionistic Fuzzy Index Matrices (EIVIFIMs)
2.3 Interval-Valued Intuitionistic Fuzzy Graphs (IVIFGs)
3 Algorithms for Hamiltonian Cycle in an IVIFG
4 An Example for Hamiltonian Cycle in IVIFG
5 Conclusion
References
On the Conceptual Optimization of Generalized Net Models
1 Introduction
2 On the Concepts in Generalized Nets Models
3 Operators for Complexity of GN Models
4 Conceptual Optimization of a GN Model of a Queuing System
4.1 First GN Model of a Queuing System
4.2 Second GN Model of a Queuing System
4.3 Third GN Model of a Queuing System
4.4 Fourth GN Model of a Queuing System
5 Conclusion
References
Sensitivity Study of a Large-Scale Air Pollution Model by Using Optimized Latin Hyprecube Sampling
1 Introduction
2 Description of UNI-DEM
3 Implementation of UNI-DEM
4 Sobol Approach for Global Sensitivity Indices
5 Optimized Latin Hypercube Sampling
6 Sensitivity Studies with Respect to Emission Levels
7 Sensitivity Studies with Respect to Chemical Reactions Rates
8 Conclusion
References
Optimized Quasi-Monte Carlo Methods Based on Van der Corput Sequence for Sensitivity Analysis in Air Pollution Modelling
1 Introducton
2 Description of the Danish Eulerian Model and UNI-DEM
3 Mathematical Background of the Sensitivity Analysis
3.1 The Total Sensitivity Index (TSI)
3.2 Sobol Approach, Based on HDMR and ANOVA
4 The Van der Corput Sequence
5 Sensitivity Studies with Respect to Emission Levels
6 Sensitivity Studies with Respect to Chemical Reactions Rates
7 Conclusion
References
Advanced Stochastic Approaches Based on Lattice Rules for Multiple Integrals in Option Pricing
1 Introduction
2 Description of the Option Pricing Problem
3 Efficient Stochastic Approaches
3.1 The Sobol Sequence
3.2 Adaptive Approach
3.3 Lattice Rules
4 Numerical Examples and Results
5 Conclusion
References
Advanced Stochastic Approaches for Multidimensional Integrals in Neural Networks
1 Introduction
2 Problem Settings
2.1 Motivation
3 QMC Methods Based on Lattice Rules
4 Numerical Examples
5 Conclusion
References
Improved Stochastic Approaches for Evaluation of the Wigner Kernel
1 Introduction
2 Description of the Optimized Adaptive Approach
3 The Presentation of the Wigner Kernel
4 Numerical Examples
5 Conclusions
References
A Numerical Study on Optimal Monte Carlo Algorithm for Multidimensional Integrals
1 Introduction
2 Description of the Optimal Monte Carlo Algorithm
3 Numerical Examples
4 Conclusions
References
Expansions on Quadrature Formulas and Numerical Solutions of Ordinary Differential Equations
1 Introduction
2 Problem Settings
3 Numerical Solution of First Order ODEs
4 Numerical Solution of Second Order ODEs
5 Conclusion
References
Research of the Use of Battery Shunting Locomotive with Regenerative Brake
1 Introduction
2 Operation of Shunting Locomotives
3 The System Under Study
4 Results
5 Conclusion
References
Author Index