Registered Data

Contents

1 [CT159]

[CT159]

[02513] Models for the Interdiction Problem for the Minimum Spanning Tree

Session Date & Time : 3C (Aug.23, 13:20-15:00)
Type : Contributed Talk
Abstract : The Minimum Spanning Tree Interdiction (MSTI) problem is a two-player game between a network operator aiming to determine a Minimum Spanning Tree (MST) and an interdictor which, constrained by a budget, changes the network topology to increase the weight of a MST. Mathematical formulations for a generalization of the MSTI problem are devised, and valid inequalities are proposed. Dominance relations between the models are studied, and computational experiments are presented to evaluate their efficiencies.
Classification : 90-10, 90C10, 90C46, Bilevel programming
Author(s) :
- Luis Salazar-Zendeja (INRIA)
- Diego Cattaruzza (Centrale Lille)
- Martine Labbé (Université Libre de Bruxelles)
- Frédéric Semet (Centrale Lille)

[02627] A Semi-Integer Programming for Portfolio Optimization of Green Financing Companies

Session Date & Time : 3C (Aug.23, 13:20-15:00)
Type : Industrial Contributed Talk
Abstract : Investment is one of society’s tendencies to earn more and gain passive income. The term investment has been widely used by society i.e., by companies with the concept of green financing. Those companies aim to fund renewable energy projects and carbon reduction to support sustainable development. Our research proposes to develop an efficient optimization approach based on Benders Decomposition to solve a Semi-Integer Programming problem arising from the investment problem of green financing companies.
Classification : 90-10, 90C11, 90C20, 90C25, Applied Optimization
Author(s) :
- Sena Safarina (Sepuluh Nopember Institute of Technology)
- Sekar Rizkihutami (Sepuluh Nopember Institute of Technology)

[02649] Inventory Models with Carbon Reduction Policy

Session Date & Time : 3C (Aug.23, 13:20-15:00)
Type : Contributed Talk
Abstract : Carbon emission is becoming a crucial problem all over the world. To reduce the carbon emissions, the government adopted many reduction policies like carbon cap, cap and trade and carbon tax. That works by issuing a set number of emissions permits that effectively caps the total tons of emissions allowed. Also carbon tax is a type of penalty that businesses and industries must pay for excessive greenhouse gas emissions. Businesses and industries must pay a carbon tax due to the production of carbon dioxide through their operations. In this proposal we deal with such types of problems.
Classification : 90-10, 90B05, 90B50, 90C31, 90C10
Author(s) :
- Soniya Gupta (Ismail National Mahila PG College, Meerut )
- Shiv Raj Singh (CCS University, Meerut)

[00070] SDDS-SABC based Algorithm for solving non-linear optimization problems

Session Date & Time : 3C (Aug.23, 13:20-15:00)
Type : Contributed Talk
Abstract : Optimizing complex non-linear constrained optimization problems is often a challenging task. This work proposes a new hybrid method called SDDS-SABC based on the Split-Detect-Discard-Shrink technique and Sophisticated ABC algorithm to optimize the said problems. The SDDS method is responsible for shrinking the full search region through a recursive breakdown and improves computational effort to focus on the subregion covering potential solutions for further decomposition. SABC plays a vital role in extracting the best solutions from the subregions whose values help detect the promising subregion. Both SDDS and SABC are sequentially repeated until the region reduces to a nominal width representing the optimization problem's global/ close to global solution(s). The Ranking and selection rules have been applied to assist optimistic decision-making with an attitude to discard the subregion covering non-promising solution (s). At the same time, the subregion with a promising solution is accepted as the current shrink region for a further split. We introduce a new initialization scheme for food sources in the SABC algorithm, which excels the existing initialization process. Develop Dual-strategy Employed bee's phase, allowing bees to split into two groups and use their respective group strategies to explore their neighbourhood while maintaining their collaborative contribution. We also introduce a new Dynamic penalty method that is free from extra parameters or factors like most existing penalty methods do to improve the optimization efficiency. To check the validity of SDDS-SABC, we have applied it to benchmark functions and engineering problems. To measure our proposed method's statistical significance against other existing heuristic optimization methods, we carried out the non-parametric Friedman and Wilcoxon rank tests.
Classification : 90-xx, 90-08, 90-10, optimization algorithms
Author(s) :
- Dhirendra Sharma (Birla Institute of Technology Mesra, Ranchi)
- Darakhshan Jabeen Syeda (Birla Institute of Technology Mesra, Ranchi)

[00254] Estimation of Directional Marginal Productivity in Supply Chain Capacity Planning and Resource Allocation: A Case Study of the Power Industry

Session Date & Time : 3C (Aug.23, 13:20-15:00)
Type : Industrial Contributed Talk
Abstract : Marginal productivity (MP) estimation is utilized to plan for maximum output levels and to allocate resources to address fluctuating demand for fuel in the power plant sector as well as adjust the power generated in the transmission and distribution lines. It also adjusts the amount of energy produced in the transmitter and distributor lines. In this paper, a data envelopment analysis (DEA) model is introduced for estimating the directional marginal productivity (DMP) of supply chain divisions. This model measures efficiency by maximizing the marginal profit for multiple outputs in predetermined directions. The purpose of this study is to establish whether adding an extra unit of input or reallocating resources can have significant effects on economic return.
Classification : 90-XX, 90BXX, 90B06
Author(s) :
- Mojgan pouralizadeh (Islamic Azad University, Lahijan Branch,Lahijan,Iran)