scholarly journals MINLP Model for Operational Optimization of LNG Terminals

Processes ◽  
2021 ◽  
Vol 9 (4) ◽  
pp. 599
Author(s):  
Zhencheng Ye ◽  
Xiaoyan Mo ◽  
Liang Zhao
Keyword(s):  
Energy Consumption ◽  
Natural Gas ◽  
Fossil Fuels ◽  
Programming Model ◽  
Mixed Integer ◽  
Integer Variables ◽  
Operational Optimization ◽  
Minlp Model ◽  
Different Seasons ◽  
Nonlinear Programming Model

Liquefied natural gas (LNG) is a clear and promising fossil fuel which emits less greenhouse gas (GHG) and has almost no environmentally damaging sulfur dioxide compared with other fossil fuels. An LNG import terminal is a facility that regasifies LNG into natural gas, which is supplied to industrial and residential users. Modeling and optimization of the LNG terminals may reduce energy consumption and GHG emission. A mixed-integer nonlinear programming model of the LNG terminal is developed to minimize the energy consumption, where the numbers of boil-off gas (BOG) compressors and low-pressure (LP) pumps are considered as integer variables. A case study from an actual LNG terminal is carried out to verify the practicality of the proposed method. Results show that the proposed approach can decrease the operating energy consumption from 9.15% to 26.1% for different seasons.

scholarly journals A Four-Type Decision-Variable MINLP Model for a Supply Chain Network Design

2010 ◽  
Vol 2010 ◽  
pp. 1-16 ◽  
Author(s):  
M. M. Monteiro ◽  
J. E. Leal ◽  
F. M. P. Raupp
Keyword(s):  
Supply Chain ◽  
Programming Model ◽  
Planning Horizon ◽  
Mixed Integer ◽  
Decision Variable ◽  
Abc Classification ◽  
Computational Implementation ◽  
Minlp Model ◽  
Nonlinear Programming Model ◽  
Outer Approximation Algorithm

We propose a mixed integer nonlinear programming model for the design of a one-period planning horizon supply chain with integrated and flexible decisions on location of plants and of warehouses, on levels of production and of inventory, and on transportation models, considering stochastic demand and the ABC classification for finished goods, which is an NP-hard industrial engineering optimization problem. Furthermore, computational implementation of the proposed model is presented through the direct application of the outer approximation algorithm on some randomly generated supply chain data.

scholarly journals Context-aware heatstroke relief station placement and route optimization for large outdoor events

2021 ◽  
Vol 20 (1) ◽  
Author(s):  
Yan Wu ◽  
Tianqi Xia ◽  
Adam Jatowt ◽  
Haoran Zhang ◽  
Xiao Feng ◽  
...  
Keyword(s):  
Physical Environment ◽  
Emergency Service ◽  
Programming Model ◽  
Heterogeneous Data ◽  
Route Optimization ◽  
Mixed Integer ◽  
Context Aware ◽  
Outdoor Activities ◽  
Integer Nonlinear Programming ◽  
Nonlinear Programming Model

Abstract Background Heatstroke is becoming an increasingly serious threat to outdoor activities, especially, at the time of large events organized during summer, including the Olympic Games or various types of happenings in amusement parks like Disneyland or other popular venues. The risk of heatstroke is naturally affected by a high temperature, but it is also dependent on various other contextual factors such as the presence of shaded areas along traveling routes or the distribution of relief stations. The purpose of the study is to develop a method to reduce the heatstroke risk of pedestrians for large outdoor events by optimizing relief station placement, volume scheduling and route. Results Our experiments conducted on the planned site of the Tokyo Olympics and simulated during the two weeks of the Olympics schedule indicate that planning routes and setting relief stations with our proposed optimization model could effectively reduce heatstroke risk. Besides, the results show that supply volume scheduling optimization can further reduce the risk of heatstroke. The route with the shortest length may not be the route with the least risk, relief station and physical environment need to be considered and the proposed method can balance these factors. Conclusions This study proposed a novel emergency service problem that can be applied in large outdoor event scenarios with multiple walking flows. To solve the problem, an effective method is developed and evaluates the heatstroke risk in outdoor space by utilizing context-aware indicators which are determined by large and heterogeneous data including facilities, road networks and street view images. We propose a Mixed Integer Nonlinear Programming model for optimizing routes of pedestrians, determining the location of relief stations and the supply volume in each relief station. The proposed method can help organizers better prepare for the event and pedestrians participate in the event more safely.

scholarly journals Multi-Objective Sustainable Truck Scheduling in a Rail–Road Physical Internet Cross-Docking Hub Considering Energy Consumption

2019 ◽  
Vol 11 (11) ◽  
pp. 3127 ◽  
Author(s):  
Tarik Chargui ◽  
Abdelghani Bekrar ◽  
Mohamed Reghioui ◽  
Damien Trentesaux
Keyword(s):  
Energy Consumption ◽  
Programming Model ◽  
Mixed Integer ◽  
Computational Time ◽  
Neighborhood Search ◽  
Optimal Solutions ◽  
Multi Objective ◽  
Sustainable Logistics ◽  
Cross Docking ◽  
Physical Internet

In the context of supply chain sustainability, Physical Internet (PI or π ) was presented as an innovative concept to create a global sustainable logistics system. One of the main components of the Physical Internet paradigm consists in encapsulating products in modular and standardized PI-containers able to move via PI-nodes (such as PI-hubs) using collaborative routing protocols. This study focuses on optimizing operations occurring in a Rail–Road PI-Hub cross-docking terminal. The problem consists of scheduling outbound trucks at the docks and the routing of PI-containers in the PI-sorter zone of the Rail–Road PI-Hub cross-docking terminal. The first objective is to minimize the energy consumption of the PI-conveyors used to transfer PI-containers from the train to the outbound trucks. The second objective is to minimize the cost of using outbound trucks for different destinations. The problem is formulated as a Multi-Objective Mixed-Integer Programming model (MO-MIP) and solved with CPLEX solver using Lexicographic Goal Programming. Then, two multi-objective hybrid meta-heuristics are proposed to enhance the computational time as CPLEX was time consuming, especially for large size instances: Multi-Objective Variable Neighborhood Search hybridized with Simulated Annealing (MO-VNSSA) and with a Tabu Search (MO-VNSTS). The two meta-heuristics are tested on 32 instances (27 small instances and 5 large instances). CPLEX found the optimal solutions for only 23 instances. Results show that the proposed MO-VNSSA and MO-VNSTS are able to find optimal and near optimal solutions within a reasonable computational time. The two meta-heuristics found optimal solutions for the first objective in all the instances. For the second objective, MO-VNSSA and MO-VNSTS found optimal solutions for 7 instances. In order to evaluate the results for the second objective, a one way analysis of variance ANOVA was performed.

scholarly journals A Refueling Scheme Optimization Model for the Voyage Charter with Fuel Price Fluctuation and Ship Deployment Consideration

2017 ◽  
Vol 5 (3) ◽  
pp. 267-278 ◽  
Author(s):  
Peng Jia ◽  
Weilun Zhang ◽  
E Wenhao ◽  
Xueshan Sun
Keyword(s):  
Programming Model ◽  
Optimal Solution ◽  
Arma Model ◽  
Maritime Transportation ◽  
Mixed Integer ◽  
Fuel Price ◽  
Shipping Company ◽  
Significant Difference ◽  
Nonlinear Programming Model ◽  
Operation Cycle

Abstract Due to the long operation cycle of maritime transportation and frequent fluctuations of the bunker fuel price, the refueling expenditure of a chartered ship at different time or ports of call make significant difference. From the perspective of shipping company, an optimal set of refueling schemes for a ship fleet operating on different voyage charter routes is an important decision. To address this issue, this paper presents an approach to optimize the refueling scheme and the ship deployment simultaneously with considering the trend of fuel price fluctuations. Firstly, an ARMA model is applied to forecast a time serials of the fuel prices. Then a mixed-integer nonlinear programming model is proposed to maximize total operating profit of the shipping company. Finally, a case study on a charter company with three bulk carriers and three voyage charter routes is conducted. The results show that the optimal solution saves the cost of 437,900 USD compared with the traditional refueling scheme, and verify the rationality and validity of the model.

scholarly journals Congestion Service Facilities Location Problem with Promise of Response Time

2013 ◽  
Vol 2013 ◽  
pp. 1-11 ◽  
Author(s):  
Dandan Hu ◽  
Zhi-Wei Liu ◽  
Wenshan Hu
Keyword(s):  
Response Time ◽  
Location Problem ◽  
Service Providers ◽  
Programming Model ◽  
Mixed Integer ◽  
Specific Response ◽  
Location Decision ◽  
Decision Variables ◽  
Facilities Location ◽  
Nonlinear Programming Model

In many services, promise of specific response time is advertised as a commitment by the service providers for the customer satisfaction. Congestion on service facilities could delay the delivery of the services and hurts the overall satisfaction. In this paper, congestion service facilities location problem with promise of response time is studied, and a mixed integer nonlinear programming model is presented with budget constrained. The facilities are modeled as M/M/c queues. The decision variables of the model are the locations of the service facilities and the number of servers at each facility. The objective function is to maximize the demands served within specific response time promised by the service provider. To solve this problem, we propose an algorithm that combines greedy and genetic algorithms. In order to verify the proposed algorithm, a lot of computational experiments are tested. And the results demonstrate that response time has a significant impact on location decision.

scholarly journals Median location problem with two probabilistic line barriers: Extending the Hook and Jeeves algorithm

2021 ◽  
Vol 0 (0) ◽  
pp. 0
Author(s):  
Saber Shiripour ◽  
Nezam Mahdavi-Amiri
Keyword(s):  
Location Problem ◽  
Programming Model ◽  
Distance Functions ◽  
Mixed Integer ◽  
Lower And Upper Bounds ◽  
Rectilinear Distance ◽  
Proposed Model ◽  
Integer Nonlinear Programming ◽  
Nonlinear Programming Model ◽  
New Facility

<p style='text-indent:20px;'>We consider a median location problem in the presence of two probabilistic line barriers on the plane under rectilinear distance. It is assumed that the two line barriers move on their corresponding horizontal routes uniformly. We first investigate different scenarios for the position of the line barriers on the plane and their corresponding routes, and then define the visibility and invisibility conditions along with their corresponding expected barrier distance functions. The proposed problem is formulated as a mixed-integer nonlinear programming model. Our aim is to locate a new facility on the plane so that the total weighted expected rectilinear barrier distance is minimized. We present efficient lower and upper bounds using the forbidden location problem for the proposed problem. To solve the proposed model, the Hooke and Jeeves algorithm (HJA) is extended. We investigate various sample problems to test the performance of the proposed algorithm and appropriateness of the bounds. Also, an empirical study in Kingston-upon-Thames, England, is conducted to illustrate the behavior and applicability of the proposed model.</p>

Sign in / Sign up

Export Citation Format

Share Document