Registered Data

Contents

1 [CT126]

[CT126]

[01361] A Novel Numerical Algorithm for Time-Space Reaction Diffusion Equation

Session Date & Time : 3C (Aug.23, 13:20-15:00)
Type : Contributed Talk
Abstract : In this talk, we propose a novel numerical algorithm for time-space reaction diffusion equations using time-graded meshes. We shall discuss the error and the stability analysis, and illustrate the efficiency of the scheme using some numerical examples.
Classification : 68W10, 65M06, 65M12, 35R11
Author(s) :
- Yusuf Olawale Afolabi (University of Louisiana at Lafayette)

[00788] Using multi-objective evolutionary algorithms when performing preventive maintenance actions

Session Date & Time : 3C (Aug.23, 13:20-15:00)
Type : Industrial Contributed Talk
Abstract : Maintenance has always been a key activity in the manufacturing industry, because of its economic consequences. Nowadays, its importance is increasing thanks to the ``Industry 4.0'' or the ``fourth industrial revolution'', which promotes automation through computer systems in manufacturing and aims to achieve intelligent or smart factory. There are more and more complex systems to maintain, and to keep all these devices in proper conditions maintenance management must gain efficiency and effectiveness. Within maintenance, Condition-Based Maintenance (CBM) programs can provide significant advantages, but it can be said that often these programs are complex to manage and understand, so several researches propose as simple as possible approaches that can be understood by users and modified by experts. With these context conditions, this paper focuses on CBM optimization in an industrial environment, with the objective of determining the optimal values of preventive intervention limits for equipment under corrective and preventive maintenance cost criteria. It develops a cost-benefit mathematical model that considers the evolution in quality and production speed, along with condition based, corrective and preventive maintenance. The cost-benefit optimization is performed using a Multi-Objective Evolutionary Algorithm. Both the model and the optimization approach are applied to an industrial case.
Classification : 68W50, 68T20, 90C59
Author(s) :
- Eilsabete Alberdi (University of the Basque Country UPV/EHU)
- Aitor Goti (University of Deusto)
- Aitor Oyarbide-Zubillaga (University of Deusto)
- Pablo Garcia-Bringas (University of Deusto)
- Ana Sánchez (Polytechnic University of Valencia)

[00809] Mathematical Aspects of Metaheuristics in Medical Imaging and Pattern Recognition

Session Date & Time : 3C (Aug.23, 13:20-15:00)
Type : Contributed Talk
Abstract : Medical imaging and pattern recognition have very important applications in the health and other industrial sectors. In this talk, we will be focusing on the mathematical model that deals with high-order graph matching using a metaheuristic technique. This model has been tested real-life images including identifying white blood cells in human blood. The models work on the idea of artificial intelligence and have a high level of efficiency with good results. The role of AI is in terms of AI-based metaheuristics which are used as search and optimization techniques to address aforementioned problems.
Classification : 68W50, 68U10, 68T42, 68T10, 68T05, Evolutionary Algorithms, Agent Based Systems, Graph Matching
Author(s) :
- Anupam Yadav (Dr BR Ambedkar National Institute of Technology Jalandhar)

[01813] THERMAL ARTIFICIAL BEE COLONY ALGORITHM TO EFFICIENTLY SOLVE LARGE SCALE JOB SHOP SCHEDULING PROBLEM

Session Date & Time : 3C (Aug.23, 13:20-15:00)
Type : Contributed Talk
Abstract : This research work presents a detailed description and existing solutions to large-scale job shop scheduling problems (JSSP). Getting the optimum solution for large-scale JSSP instances is still an inspirational task. The swarm intelligence (SI) centered algorithms are executing effectively to solve JSSP. The artificial bee colony (ABC) algorithm is one of the significant SI-centered algorithms that efficiently find out the solutions to real-world optimization problems. The basic version of the ABC algorithm may suffer from stagnation as per the reviewed literature. To overcome the shortcomings of the ABC algorithm, a temperature-based solution search mechanism is mingled with basic ABC after the scout honeybee phase. The presented algorithm is named as thermal ABC algorithm. This research aims to design a discrete strategy of the proposed thermal ABC to solve 105 large-scale benchmark instances of JSSP. The considered instances include 15 SWV, 40 DMU, and 50 TA instances as available in the literature. The performance of the designed thermal ABC is evaluated while compared with the available solutions of JSSP in the literature. The obtained outcomes of this research in terms of best-known solution (BKS) and statistical analysis validate the competitiveness of the proposed approach to solve large-scale JSSP.
Classification : 68W50, 68W40
Author(s) :
- Harish Sharma (Rajasthan Technical University Kota)

[02125] TNL: Numerical Library for Modern Parallel Architectures

Session Date & Time : 3C (Aug.23, 13:20-15:00)
Type : Contributed Talk
Abstract : TNL (www.tnl-project.org) is a collection of building blocks that facilitate the development of efficient numerical solvers and HPC algorithms. It is implemented in C++ using modern programming paradigms in order to provide a flexible and user-friendly interface similar to, for example, the C++ Standard Template Library. TNL provides native support for modern hardware architectures such as multicore CPUs, GPUs, and distributed systems, which can be managed via a unified interface. In our presentation, we will demonstrate the main features of the library together with efficiency of the implemented algorithms and data structures.
Classification : 68W99, 68U01, 65N99, High-performance computing
Author(s) :
- Tomáš Oberhuber (Czech Technical University in Prague)
- Jakub Klinkovský (Czech Technical University in Prague)
- Radek Fučík (Czech Technical University in Prague)