scholarly journals Detecting Semantic Groups in MIP Models

Author(s):  
Domenico Salvagnin
Keyword(s):  
2021 ◽  
Vol 765 ◽  
pp. 144494
Author(s):  
He Chen ◽  
Junguo Liu ◽  
Ganquan Mao ◽  
Zifeng Wang ◽  
Zhenzhong Zeng ◽  
...  

Author(s):  
Li Zhang ◽  
Kenneth J. Davis ◽  
Andrew E. Schuh ◽  
Andrew R. Jacobson ◽  
Sandip Pal ◽  
...  
Keyword(s):  

2014 ◽  
Vol 2014 ◽  
pp. 1-19 ◽  
Author(s):  
Duygu Yilmaz Eroglu ◽  
H. Cenk Ozmutlu

We developed mixed integer programming (MIP) models and hybrid genetic-local search algorithms for the scheduling problem of unrelated parallel machines with job sequence and machine-dependent setup times and with job splitting property. The first contribution of this paper is to introduce novel algorithms which make splitting and scheduling simultaneously with variable number of subjobs. We proposed simple chromosome structure which is constituted by random key numbers in hybrid genetic-local search algorithm (GAspLA). Random key numbers are used frequently in genetic algorithms, but it creates additional difficulty when hybrid factors in local search are implemented. We developed algorithms that satisfy the adaptation of results of local search into the genetic algorithms with minimum relocation operation of genes’ random key numbers. This is the second contribution of the paper. The third contribution of this paper is three developed new MIP models which are making splitting and scheduling simultaneously. The fourth contribution of this paper is implementation of the GAspLAMIP. This implementation let us verify the optimality of GAspLA for the studied combinations. The proposed methods are tested on a set of problems taken from the literature and the results validate the effectiveness of the proposed algorithms.


2020 ◽  
Vol 12 (12) ◽  
pp. 4877
Author(s):  
Jiseong Noh ◽  
Jong Soo Kim ◽  
Seung-June Hwang

Recently, as global warming has become a major issue, many companies have increased their efforts to control carbon emissions in green supply chain management (GSCM) activities. This paper deals with the multi-item replenishment problem in GSCM, from both economic and environmental perspectives. A single buyer orders multiple items from a single supplier, and simultaneously considers carbon cap-and-trade under limited storage capacity and limited budget. In this case we can apply a can-order policy, which is a well-known multi-item replenishment policy. Depending on the market characteristics, we develop two mixed-integer programming (MIP) models based on the can-order policy. The deterministic model considers a monopoly market in which a company fully knows the market information, such that both storage capacity and budget are already determined. In contrast, the fuzzy model considers a competitive or a new market, in which case both of those resources are considered as fuzzy numbers. We performed numerical experiments to validate and assess the efficiency of the developed models. The results of the experiments showed that the proposed can-order policy performed far better than the traditional can-order policy in GSCM. In addition, we verified that the fuzzy model can cope with uncertainties better than the deterministic model in terms of total expected costs.


2016 ◽  
Vol 36 (1) ◽  
pp. 167-196 ◽  
Author(s):  
Gislaine Mara Melega ◽  
Silvio Alexandre de Araujo ◽  
Raf Jans

2016 ◽  
Vol 67 (11) ◽  
pp. 1395-1407 ◽  
Author(s):  
Flavio Molina ◽  
Reinaldo Morabito ◽  
Silvio Alexandre de Araujo

2020 ◽  
Vol 10 (23) ◽  
pp. 8367
Author(s):  
Intaek Gong ◽  
Sukmun Oh ◽  
Yunhong Min

We consider a train scheduling problem in which both local and express trains are to be scheduled. In this type of train scheduling problem, the key decision is determining the overtaking stations at which express trains overtake their preceding local trains. This problem has been successfully modeled via mixed integer programming (MIP) models. One of the obvious limitation of MIP-based approaches is the lack of freedom to the choices objective and constraint functions. In this paper, as an alternative, we propose an approach based on reinforcement learning. We first decompose the problem into subproblems in which a single express train and its preceding local trains are considered. We, then, formulate the subproblem as a Markov decision process (MDP). Instead of solving each instance of MDP, we train a deep neural network, called deep Q-network (DQN), which approximates Q-value function of any instances of MDP. The learned DQN can be used to make decision by choosing the action which corresponds to the maximum Q-value. The advantage of the proposed method is the ability to incorporate any complex objective and/or constraint functions. We demonstrate the performance of the proposed method by numerical experiments.


2014 ◽  
Vol 65 (11) ◽  
pp. 1649-1663 ◽  
Author(s):  
Ricardo Andrade ◽  
Ernesto G Birgin ◽  
Reinaldo Morabito ◽  
Débora P Ronconi

Sign in / Sign up

Export Citation Format

Share Document