Results 21 to 30 of about 3,912 (195)
Parameterized Algorithms for MILPs with Small Treedepth
Solving (mixed) integer (linear) programs, (M)I(L)Ps for short, is a fundamental optimisation task with a wide range of applications in artificial intelligence and computer science in general. While hard in general, recent years have brought about vast progress for solving structurally restricted, (non-mixed) ILPs: n-fold, tree-fold, 2-stage stochastic
Cornelius Brand +2 more
openaire +3 more sources
This work addresses the minimization of the makespan criterion for the permutation flow shop problem with blocking, sequence and machine dependent setup times, which is a problem that has not been studied in previous works.
Mauricio Iwama Takano +1 more
doaj +1 more source
Exact solution approaches for the workload smoothing in assembly lines
In this paper, the problem of minimizing the smoothness index for an assembly line given a fixed cycle time and the number of workstations is studied. This problem which is known as the workload smoothing line balancing problem (WSLBP) is a mixed-integer
Derya Dinler, Mustafa Kemal Tural
doaj +1 more source
The uncertain natures of renewable energy lead to its underutilization; energy storage unit (ESU) is expected to be one of the most promising solutions to this issue. This paper evaluates the impact of ESUs on renewable energy curtailment.
Zhongjie Guo +6 more
doaj +1 more source
Optimization of Annual Operation of a PV-HPWH-BT Cooperative System in an All-Electric House to Achieve Maximum Electricity Self-Sufficiency [PDF]
In recent years, the introduction of renewable energy in Japan has been increasing to promote carbon neutrality and reduce greenhouse gas emissions. Among them, the spread of photovoltaic systems (PV) has been remarkable in the residential sector, as ...
Fujitsubo Shunsuke +3 more
doaj +1 more source
Δ-MILP: Deep Space Network Scheduling via Mixed-Integer Linear Programming
This paper introduces $\Delta $ -MILP, a powerful variant of the mixed-integer linear programming (MILP) optimization framework to solve NASA’s Deep Space Network (DSN) scheduling problem. This work is an extension of our original MILP framework (
Thomas Claudet +5 more
doaj +1 more source
Machine Learning-Additional Decision Constraints for Improved MILP Day-Ahead Unit Commitment Method
This paper introduces a two-stage (offline and online) artificial neural network (ANN) driven constraint creator model to improve the computational quality of day-ahead unit commitment (DAUC) in power systems.
Mohamed Ibrahim Abdelaziz Shekeew +1 more
doaj +1 more source
Location Routing Problem with Consideration of CO2 Emissions Cost: A Case Study
Location and routing are the main critical problems investigated in a logistic. Location-Routing Problem (LRP) involves determining the location of facilities and vehicle routes to supply customer's demands.
Ananda Noor Sholichah +2 more
doaj +1 more source
Solution space of interval linear programming model by new approach [PDF]
In this paper, solution space of interval linear programming (ILP) models that is a NP-hard problem, has been considered. In all of the solving methods of the ILP, feasibility condition has been only considered.
Mehdi Allahdadi, Hasan Mishmast Nehi
doaj +1 more source
MILP-Based Unsupervised Clustering
In this letter, we discuss the problem of unsupervised clustering of sensor signals based on their information content. In the past, the problem has been formulated as a matrix factorization problem and has been solved with different variants of gradient descent.
Akshay Malhotra, Ioannis D. Schizas
openaire +1 more source

