Registered Data
Contents
- 1 [CT162]
- 1.1 [02418] A two-stage method for an industrial NP-hard bin packing problem
- 1.2 [01418] Non-linear Particle Swarm Optimization Algorithm for Non-linear Fixed-charge Transportation Problems
- 1.3 [02269] Mathematical model for prioritize patient in operating room block scheduling
- 1.4 [02457] Optimizing Bunkering Management Strategy to Support Green Shipping Using Artificial Bee Colony Algorithm (ABC)
- 1.5 [01358] Compartment Models for Ideas on Social Media Networks
[CT162]
- Session Time & Room
- Classification
[02418] A two-stage method for an industrial NP-hard bin packing problem
- Session Time & Room : 3E (Aug.23, 17:40-19:20) @D505
- Type : Industrial Contributed Talk
- Abstract : Our industrial problem consists of building batch annealings from a sample of steel coils. We have to consider all the rules/constraints related to the characteristics of coils and constraints related to technology. The objective is to ensure the annealing of coils at the minimum cost. This problem is a simultaneous NP-hard bin packing type. A two-stage method is developed in this paper to address this problem: stage one refers to a smart enumeration of all possible and feasible bins. Then, the second stage will consist of finding the optimal solution for an ILP.
- Classification : 90B30, 90C10
- Format : Talk at Waseda University
- Author(s) :
- Abdelghani Bouras (Industrial Engineering Department, College of Engineering, Al lFaisalUniversity)
[01418] Non-linear Particle Swarm Optimization Algorithm for Non-linear Fixed-charge Transportation Problems
- Session Time & Room : 3E (Aug.23, 17:40-19:20) @D505
- Type : Industrial Contributed Talk
- Abstract : The non-linear fixed-charge transportation problems are one of the challenging NP-hard problems. Hence, a new non-linear particle swarm optimization algorithm (NPSO) with new inertia weight and acceleration coefficients have been introduced that not only explores the search space but also maintains the feasibility condition of the transportation problem. The performance of the proposed NPSO is compared with its existing variants. Also, some benchmarks problems from the literature have been solved and the results are compared.
- Classification : 90B06, 90C30, 90C90, 90C06
- Format : Talk at Waseda University
- Author(s) :
- Shivani Saini (Dr B R Ambedkar National Institute of Technology Jalandhar (INDIA))
- Deepika Rani (Dr B R Ambedkar National Institute of Technology Jalandhar (INDIA))
[02269] Mathematical model for prioritize patient in operating room block scheduling
- Session Time & Room : 3E (Aug.23, 17:40-19:20) @D505
- Type : Contributed Talk
- Abstract : We concentrate on the scheduling problem in surgical operating room that involves limited equipment and surgical specialities. Our objective is develop a feasible schedule that consider resources utilization, prioritized patients in health risk condition and availability of the surgical specialities teams. Our approach is the assignation of operating room by block using week horizon with different relative weight. A mathematical model is proposed to optimum the operating room scheduling performance.
- Classification : 90B35
- Format : Online Talk on Zoom
- Author(s) :
- Syarifah Zyurina Nordin (Malaysia Japan International Institute of Technology (MJIIT), Universiti Teknologi Malaysia)
[02457] Optimizing Bunkering Management Strategy to Support Green Shipping Using Artificial Bee Colony Algorithm (ABC)
- Session Time & Room : 3E (Aug.23, 17:40-19:20) @D505
- Type : Contributed Talk
- Abstract : Sea transportation has been considered as more eco-friendly transportation compared to other transportation. However, maritime logistic has produced a lot of carbon emissions. Therefore, this research is performed for optimizing the development of bunkering management strategies. It will focus on choosing a fuel with an affordable price and producing fewer carbon emissions. The problem can be formulated as the MINLP to minimize the total cost and can be solved by ABC algorithm as an optimization method.
- Classification : 90Bxx, 90Cxx, 90-08
- Format : Online Talk on Zoom
- Author(s) :
- Nurul Fajr Romadhona (Sepuluh Nopember Institute of Technology)
- Sena Safarina (Sepuluh Nopember Institute of Technology)
- Oktaviani Turbaningsih (University of Tasmania)
[01358] Compartment Models for Ideas on Social Media Networks
- Session Time & Room : 3E (Aug.23, 17:40-19:20) @D505
- Type : Contributed Talk
- Abstract : The concept of virality and the structure of social media networks lend themselves to the use of SIR-like compartment models to study the spread of ideas between users on these platforms. This talk introduces the USBA - Unexposed, Sending, Bored, and Acclimated - family of discrete compartment models as a means of simulating how ideas reach and affect users and change the network structure, leading to the formation of echo chambers and polarization in sentiment.
- Classification : 91D30, 91D10, 34C60, Internet Studies
- Format : Online Talk on Zoom
- Author(s) :
- Adam Mark Furman (University of Oxford Mathematical Institute)