Mathematical programming model to optimise an environmentally constructed supply chain: A genetic algorithm approach

2021 ◽  
Vol 1 (1) ◽  
pp. 1
Author(s):  
Vaibhav Narwane ◽  
Bhaskar Gardas ◽  
Sejal Dhange ◽  
Rakesh Raut ◽  
Balkrishna Narkhede ◽  
...  
2011 ◽  
Vol 110-116 ◽  
pp. 3624-3630
Author(s):  
Saeede Ajorlou ◽  
Issac Shams ◽  
Mirbahador G. Aryanezhad

In this paper, a new mathematical programming model is developed to address common issues relating to single-stage CONstant-Work-In-Process based production lines. A Ge-netic Algorithm (GA) approach is then proposed to directly solve the model in order to simultaneously determines the optimal job sequence and WIP level. Unlike many existing approaches, which are based on deterministic search algorithms such as nonlinear programming and mixed integer programming, our proposed method does not rely on a linearized or simplified model of the system. results from a comprehensive numerical example indicate computational efficiency and validation of our method.


2018 ◽  
Vol 21 (06n07) ◽  
pp. 1850022 ◽  
Author(s):  
MEHRDAD AGHA MOHAMMAD ALI KERMANI ◽  
REZA GHESMATI ◽  
MASOUD JALAYER

Influence maximization is a well-known problem in the social network analysis literature which is to find a small subset of seed nodes to maximize the diffusion or spread of information. The main application of this problem in the real-world is in viral marketing. However, the classic influence maximization is disabled to model the real-world viral marketing problem, since the effect of the marketing message content and nodes’ opinions have not been considered. In this paper, a modified version of influence maximization which is named as “opinion-aware influence maximization” (OAIM) problem is proposed to make the model more realistic. In this problem, the main objective is to maximize the spread of a desired opinion, by optimizing the message content, rather than the number of infected nodes, which leads to selection of the best set of seed nodes. A nonlinear bi-objective mathematical programming model is developed to model the considered problem. Some transformation techniques are applied to convert the proposed model to a linear single-objective mathematical programming model. The exact solution of the model in small datasets can be obtained by CPLEX algorithm. For the medium and large-scale datasets, a new genetic algorithm is proposed to cope with the size of the problem. Experimental results on some of the well-known datasets show the efficiency and applicability of the proposed OAIM model. In addition, the proposed genetic algorithm overcomes state-of-the-art algorithms.


2017 ◽  
Vol 34 (05) ◽  
pp. 1750026 ◽  
Author(s):  
Yuxiang Yang ◽  
Zuqing Huang ◽  
Qiang Patrick Qiang ◽  
Gengui Zhou

A firm sets up his facilities including manufacturing/remanufacturing plants and distribution/collection centers, incorporating an existing closed-loop supply chain (CLSC) network. The entering firm has to compete with the existing firms in the existing network. The entering firm behaves as the leader of a Stackelberg game while the existing firms in the existing network are followers. We assume that the entering firm can anticipate the existing firms’ reaction to his potential location decision before choosing his optimal policy. We use a CLSC network equilibrium model in which the decision makers are faced with multiple objectives to capture the existing firms’ reaction. A mathematical programming model with equilibrium constraints is developed for this competitive CLSC network design problem by taking into account the market competition existing in the decentralized CLSC network. A solution method is developed by integrating Genetic algorithm with an inexact logarithmic-quadratic proximal augmented Lagrangian method. Finally, numerical examples and the related results are studied for illustration purpose.


Author(s):  
Chrysanthi Gkini ◽  
Christina Iliopoulou ◽  
Konstantinos Kepaptsoglou ◽  
Eleni I. Vlahogianni

Curbside parking is associated with various adverse impacts on urban traffic networks and is rarely recommended. However, there are cases where parking demand dictates the establishment of on-street parking lanes. Proper planning of the number and type of curbside parking lanes to be located is essential for maximizing roadway capacity and minimizing the resulting impacts of parking operations on the network’s performance. This paper develops a bi-level mathematical programming model for planning and sizing curbside parking lanes in an urban network. The model is solved using a genetic algorithm and demonstrated for a medium-sized urban network.


2020 ◽  
Vol 22 (2) ◽  
pp. 85-92
Author(s):  
Achmad Pratama Rifai ◽  
Setyo Tri Windras Mara ◽  
Putri Adriani Kusumastuti ◽  
Rakyan Galuh Wiraningrum

The double row layout problem (DRLP) is an NP-hard and has many applications in the industry. The problem concerns on arranging the position of  machines on the two rows so that the material handling cost is minimized. Although several mathematical programming models and local heuristics have been previously proposed, there is still a requirement to develop an approach that can solve the problem efficiently. Here, a genetic algorithm is proposed, which is aimed to solve the DRLP in a reasonable and applicable time. The performances of the proposed method, both its obtained objective values and computational time, are evaluated by comparing it with the existing mathematical programming model. The results demonstrate that the proposed GA can find relatively high-quality solutions in much shorter time than the mathematical programming model, especially in the problem with large number of machines.


Sign in / Sign up

Export Citation Format

Share Document