Similar Search Results

A novel core-based optimization framework for binary integer programs- the multidemand multidimesional Knapsack problem as a test problem

Al-Shihabi, Sameh - In: Operations research perspectives 8 (2021), pp. 1-13

The effectiveness and efficiency of optimization algorithms might deteriorate when solving large-scale binary integer programs (BIPs). Consequently, researchers have tried to fix the values of certain variables called adjunct variables, and only optimize a small problem version formed from the...

Persistent link: https://www.econbiz.de/10012596505

Inbound traffic capture link-design problem independent of assumptions on users' route choices

Sase, Ruri; Sugiura, Satoshi - In: EURO journal on transportation and logistics 13 (2024), pp. 1-15

employing the graph theory concept of the minimum cut, and use the concept of a Steiner tree with auxiliary network flows to …

Persistent link: https://www.econbiz.de/10015193410

Using infeasible path cuts to solve Electric Vehicle Routing Problems with realistic charging functions exactly within a branch-and-cut framework

Schulz, Arne - In: EURO journal on transportation and logistics 13 (2024), pp. 1-14

The paper investigates the Electric Vehicle Routing Problem with a non-linear concave and strictly monotonic increasing charging function. In the literature, the non-linear charging function is typically approximated by a piecewise linear charging function which does not overestimate the real...

Persistent link: https://www.econbiz.de/10015193415

An integer programming model for obtaining cyclic quasi-difference matrices

Martínez, Luis; Merino, María; Montoya, Juan Manuel - In: Operations research perspectives 10 (2023), pp. 1-6

Orthogonal arrays are of great importance in mathematical sciences. This paper analyses a certain practical advantage of quasi-difference matrices over difference matrices to obtain orthogonal arrays with given parameters. We also study the existence of quasi-difference matrices over cyclic...

Persistent link: https://www.econbiz.de/10014447799

A mixed-integer non-linear no-wait open-shop scheduling model for minimizing makespan and total tardiness in manufacturing

Mirmozaffari, Mirpouya; Hejazi, Seyed Mojtaba; … - In: Decision analytics journal 10 (2024), pp. 1-23

Open shop scheduling problems (OSSP) are highly significant in engineering and industry, involving critical scheduling challenges. The job type determines the duration required for material transfer between machines and remains unaffected by distance, eliminating any waiting time for transfers....

Persistent link: https://www.econbiz.de/10014541881

A bi-objective mixed-integer non-linear programming model with Grasshopper Optimization Algorithm for military-based humanitarian supply chains

Aghsami, Amir; Sharififar, Simintaj; Moghaddam, Nader … - In: Decision analytics journal 10 (2024), pp. 1-22

Military systems have many components, such as garrisons, border guards, and industries with a large population that may be affected by disasters. Garrisons, hospitals, clinics, and other facilities in military systems are needed to reduce human casualties. However, these facilities may not have...

Persistent link: https://www.econbiz.de/10014541915

A novel non-redundant path method for the maximum covering species problem with connection requirements

Hilbert, Markus; Wiens, Cynthia; Kleine, Andreas - In: Decision analytics journal 10 (2024), pp. 1-14

This paper proposes a novel model formulation for the Maximum Covering Species Problem that incorporates spatial connectivity requirements. This model, called the Connected Maximum Covering Species Problem, enforces structural connectivity and relies on knowledge of induced paths, or what we...

Persistent link: https://www.econbiz.de/10015101625

Solving constrained mean-variance portfolio optimization problems using spiral optimization algorithm

Febrianti, Werry; Sidarto, Kuntjoro Adji; Sumarti, Novriana - In: International Journal of Financial Studies : open … 11 (2023) 1, pp. 1-12

Portfolio optimization is an activity for balancing return and risk. In this paper, we used mean-variance (M-V) portfolio models with buy-in threshold and cardinality constraints. This model can be formulated as a mixed integer nonlinear programming (MINLP) problem. To solve this constrained...

Persistent link: https://www.econbiz.de/10013543067

Optimization of material flow and product allocation in inter-unit operations : a case study of a refrigerator manufacturing facility

Karagoz, Selman; Karagoz, Yasin - 2025

Background: Logistics operations are integral to manufacturing systems, particularly in the transportation processes that occur not only between facilities and stakeholders but also between warehouses and workstations within a facility. The design of functional areas and allocating goods to...

Persistent link: https://www.econbiz.de/10015337562

Portfolio optimization for extreme risks with maximum diversification : an empirical analysis

Mehta, Navya Jayesh; Yang, Fan - In: Risks : open access journal 10 (2022) 5, pp. 1-26

huge losses for financial institutions. Diversification ratio (DR) measures the degree of diversification using the Value … effect of diversification for extreme risks. In this paper, we empirically examine the DR strategy by using more than 350 S … turnover, and the degree of diversification. DR outperforms other strategies. In particular, DR shows the highest return and …

Persistent link: https://www.econbiz.de/10013358817