Application of Linear Programming Model to Refugee Migrating Problem

The refugee immigration problem can be considered as a special “transportation problem”. Linear Programming Model is built, where two objectives with weight in the objective function, for the shortest routes that the refugees go along and the minimum number of refugees stayed in each country. An example of EU is introduced and calculated on Lingo software. The results show that the model is available to solve the refugee immigration problem in different scale.

Managing Tourism Development in the Dutch City of Utrecht using a Linear Programming Model of the Tourist Carrying Capacity

As one part of the Landstad International Metropolitan Area,Utrecht has become known as one of the best tourist destinations in recent years,with the rapid growth of worldwide travel trends.In this paper,through the adaption of the linear programming model,the paper intends to not only quantify the optimum number of visitors to Utrecht but also formulate a number of policy recommendations based on the reconstruction of this optimum.The paper draws the following conclusions:(1) tourist carrying capacity of Utrecht is not yet exceeded;(2) restrictive accommodation policy does not currently seem necessary;(3) the cultural-historical attractions are not yet optimally used;(4) investing in strategic provisions is currently not necessary.And from the conclusion,the paper further puts forward the following suggestions on the city’s tourism development strategy:(1) to identify "tourist flood plains";(2) to encourage the tourist disclosure of these alternatives;(3) to invest even more explicitly in residential tourism and,where possible,curb day tourism;(4) to introduce a new business model.

Cutting CO_(2)emissions through demand side regulation:Implications from multi-regional input-output linear programming model

This study combines multi-regional inputoutput(MRIO)model with linear programming(LP)model to explore economic structure adjustment strategies for the reduction of carbon dioxide(CO_(2))emissions.A particular feature of this study is the identification of the optimal regulation sequence of final products in various regions to reduce CO_(2)emissions with the minimum loss in gross domestic product(GDP).By using China's MRIO tables 2017 with 28 regions and 42 economic sectors,results show that reduction in final demand leads to simultaneous reductions in GDP and CO_(2)emissions.Nevertheless,certain demand side regulation strategy can be adopted to lower CO_(2)emissions at the smallest loss of economic growth.Several key final products,such as metallurgy,nonmetal,metal,and chemical products,should first be regulated to reduce CO_(2)emissions at the minimum loss in GDP.Most of these key products concentrate in the coastal developed regions in China.The proposed MRIO-LP model considers the inter-relationship among various sectors and regions,and can aid policy makers in designing effective policy for industrial structure adjustment at the regional level to achieve the national environmental and economic targets.

Application of Linear Programming Algorithm in the Optimization of Financial Portfolio of Golden Guinea Breweries Plc, Nigeria

In this study, Simplex Method, a Linear Programming technique was used to create a mathematical model that optimized the financial portfolio of Golden Guinea Breweries Plc, Nigeria. This work was motivated by the observed and anticipated miscalculations which Golden Guinea Breweries was bound to face if appropriate linear programming techniques were not applied in determining the profit level. This study therefore aims at using Simplex Method to create a Mathematical Model that will optimize the production of brewed drinks for Golden Guinea Breweries Plc. The first methodology involved the collection of sample data from the company, analyzed and the relevant coefficients were deployed for the coding of the model. Secondly, the indices collected from the first method were deployed in the software model called PHP simplex, an online software for solving Linear Programming Problem to access the profitability of the organization. The study showed that Linear Programming Model would give a high profit coefficient of N9,190,862,833 when compared with the result obtained from the manual computation which gave a profit coefficient of N7,172,093,375. Also, Bergedoff Lager, Eagle Stout and Bergedoff Malta were found not to contribute to overall profitability of the company and it was therefore recommended that their productions should be discontinued. It also recommends that various quantities of Golden Guinea Lager (1 × 12) and Golden Guinea Lager (1 × 24) should be produced.

Unmanned Aerial Vehicle Inspection Routing and Scheduling for Engineering Management

Technological advancements in unmanned aerial vehicles(UAVs)have revolutionized various industries,enabling the widespread adoption of UAV-based solutions.In engineering management,UAV-based inspection has emerged as a highly efficient method for identifying hidden risks in high-risk construction environments,surpassing traditional inspection techniques.Building on this foundation,this paper delves into the optimization of UAV inspection routing and scheduling,addressing the complexity introduced by factors such as no-fly zones,monitoring-interval time windows,and multiple monitoring rounds.To tackle this challenging problem,we propose a mixed-integer linear programming(MILP)model that optimizes inspection task assignments,monitoring sequence schedules,and charging decisions.The comprehensive consideration of these factors differentiates our problem from conventional vehicle routing problem(VRP),leading to a mathematically intractable model for commercial solvers in the case of large-scale instances.To overcome this limitation,we design a tailored variable neighborhood search(VNS)metaheuristic,customizing the algorithm to efficiently solve our model.Extensive numerical experiments are conducted to validate the efficacy of our proposed algorithm,demonstrating its scalability for both large-scale and real-scale instances.Sensitivity experiments and a case study based on an actual engineering project are also conducted,providing valuable insights for engineering managers to enhance inspection work efficiency.

Supply-based optimal scheduling of oil product pipelines

Oil product pipelines have features such as transporting multiple materials, ever-changing operating conditions, and synchronism between the oil input plan and the oil offloading plan. In this paper, an optimal model was established for a single-source multi-distribution oil pro- duct pipeline, and scheduling plans were made based on supply. In the model, time node constraints, oil offloading plan constraints, and migration of batch constraints were taken into consideration. The minimum deviation between the demanded oil volumes and the actual offloading volumes was chosen as the objective function, and a linear programming model was established on the basis of known time nodes＇ sequence. The ant colony optimization algo- rithm and simplex method were used to solve the model. The model was applied to a real pipeline and it performed well.

Exploring the Constrained Maximum Edge-weight Connected Graph Problem

Given an edge weighted graph, the maximum edge-weight connected graph （MECG） is a connected subgraph with a given number of edges and the maximal weight sum. Here we study a special case, i.e. the Constrained Maximum Edge-Weight Connected Graph problem （CMECG）, which is an MECG whose candidate subgraphs must include a given set of k edges, then also called the k-CMECG. We formulate the k-CMECG into an integer linear programming model based on the network flow problem. The k-CMECG is proved to be NP-hard. For the special case 1-CMECG, we propose an exact algorithm and a heuristic algorithm respectively. We also propose a heuristic algorithm for the k-CMECG problem. Some simulations have been done to analyze the quality of these algorithms. Moreover, we show that the algorithm for 1-CMECG problem can lead to the solution of the general MECG problem.

Optimal replication strategy for mitigating burst traffic in information-centric satellite networks: a focus on remote sensing image transmission

Information-centric satellite networks play a crucial role in remote sensing applications,particularly in the transmission of remote sensing images.However,the occurrence of burst traffic poses significant challenges in meeting the increased bandwidth demands.Traditional content delivery networks are ill-equipped to handle such bursts due to their pre-deployed content.In this paper,we propose an optimal replication strategy for mitigating burst traffic in information-centric satellite networks,specifically focusing on the transmission of remote sensing images.Our strategy involves selecting the most optimal replication delivery satellite node when multiple users subscribe to the same remote sensing content within a short time,effectively reducing network transmission data and preventing throughput degradation caused by burst traffic expansion.We formulate the content delivery process as a multi-objective optimization problem and apply Markov decision processes to determine the optimal value for burst traffic reduction.To address these challenges,we leverage federated reinforcement learning techniques.Additionally,we use bloom filters with subdivision and data identification methods to enable rapid retrieval and encoding of remote sensing images.Through software-based simulations using a low Earth orbit satellite constellation,we validate the effectiveness of our proposed strategy,achieving a significant 17%reduction in the average delivery delay.This paper offers valuable insights into efficient content delivery in satellite networks,specifically targeting the transmission of remote sensing images,and presents a promising approach to mitigate burst traffic challenges in information-centric environments.