scholarly journals Dynamic Gaming Case of the R-Interdiction Median Problem with Fortification and an MILP-Based Solution Approach

2020 ◽  
Vol 12 (2) ◽  
pp. 581 ◽  
Author(s):  
Yiyong Xiao ◽  
Pei Yang ◽  
Siyue Zhang ◽  
Shenghan Zhou ◽  
Wenbing Chang ◽  
...  

This paper studies the cyclic dynamic gaming case of the r-interdiction median problem with fortification (CDGC-RIMF), which is important for strengthening a facility’s reliability and invulnerability under various possible attacks. We formulated the CDGC-RIMF as a bi-objective mixed-integer linear programming (MILP) model with two opposing goals to minimize/maximize the loss from both the designer (leader) and attacker (follower) sides. The first goal was to identify the most cost-effective plan to build and fortify the facility considering minimum loss, whereas the attacker followed the designer to seek the most destructive way of attacking to cause maximum loss. We found that the two sides could not reach a static equilibrium with a single pair of confrontational plans in an ordinary case, but were able to reach a dynamically cyclic equilibrium when the plan involved multiple pairs. The proposed bi-objective model aimed to discover the optimal cyclic plans for both sides to reach a dynamic equilibrium. To solve this problem, we first started from the designer’s side with a design and fortification plan, and then the attacker was able to generate their worst attack plan based on that design. After that, the designer changed their plan again based on the attacker’s plan in order to minimize loss, and the attacker correspondingly modified their plan to achieve maximum loss. This game looped until, finally, a cyclic equilibrium was reached. This equilibrium was deemed to be optimal for both sides because there was always more loss for either side if they left the equilibrium first. This game falls into the subgame of a perfect Nash equilibrium—a kind of complete game. The proposed bi-objective model was directly solved by the CPLEX solver to achieve optimal solutions for small-sized problems and near-optimal feasible solutions for larger-sized problems. Furthermore, for large-scale problems, we developed a heuristic algorithm that implemented dynamic iterative partial optimization alongside MILP (DIPO-MILP), which showed better performance compared with the CPLEX solver when solving large-scale problems.

2020 ◽  
Vol 69 ◽  
pp. 297-342
Author(s):  
Jacopo Banfi ◽  
Vikram Shree ◽  
Mark Campbell

This paper introduces and studies a graph-based variant of the path planning problem arising in hostile environments. We consider a setting where an agent (e.g. a robot) must reach a given destination while avoiding being intercepted by probabilistic entities which exist in the graph with a given probability and move according to a probabilistic motion pattern known a priori. Given a goal vertex and a deadline to reach it, the agent must compute the path to the goal that maximizes its chances of survival. We study the computational complexity of the problem, and present two algorithms for computing high quality solutions in the general case: an exact algorithm based on Mixed-Integer Nonlinear Programming, working well in instances of moderate size, and a pseudo-polynomial time heuristic algorithm allowing to solve large scale problems in reasonable time. We also consider the two limit cases where the agent can survive with probability 0 or 1, and provide specialized algorithms to detect these kinds of situations more efficiently.


Author(s):  
Masoud Rabbani ◽  
Sina Keyhanian ◽  
Mojtaba Aryaee ◽  
Esmat Sangari

In this article, an integrated sales and leasing company is considered. This company remanufactures leased products at the end of operating lease contracts to make them as good as new ones and sell them to the customers. In order to satisfy customers' demand, required products are provided from a third-party when the company meets inventory shortage. Non-linear competitive demand functions are used which are sensitive to manufacturer suggested retail price (MSRP) and inflation rate. A mixed integer non-linear mathematical model (MINLP) is developed to determine optimal price of selling products, optimal amount of monthly payments in leasing contracts, and optimal inventory control planning, i.e. the optimal amount of manufacturing and remanufacturing products and optimal inventory levels. The main objective is to maximize net profit of the company. Small, medium and large-scale sizes of the model are solved to show the applicability of the model. To solve the large-scale problem, differential evolution (DE) algorithm is applied as a meta-heuristic solution approach. Numerical results show high sensitivity of model to demands. Also, optimal trend behaviors of some main variables of the problem seem similar to the competitive behavior of demands.


2021 ◽  
Vol 2021 ◽  
pp. 1-11
Author(s):  
Jiajing Gao ◽  
Haolin Li ◽  
Jingwen Wu ◽  
Junyan Lyu ◽  
Zheyi Tan ◽  
...  

The increasing gap between medical waste production and disposal stresses the urgency of further development of urban medical waste recycling. This paper investigates an integrated optimisation problem in urban medical waste recycling network. It combines the vehicle routing problem of medical facilities with different requirements and the collection problem of clinics’ medical waste to the affiliated hospital. To solve this problem, a compact mixed-integer linear programming model is proposed, which takes account of the differentiated collection strategy and time windows. Since the medical waste recycling operates according to a two-day pattern, the periodic collection plan is also embedded in the model. Moreover, we develop a particle swarm optimisation (PSO) solution approach for problem-solving. Numerical experiments are also conducted to access the solution efficiency of the proposed algorithm, which can obtain a good solution in solving large-scale problem instances within a reasonable computation time. Based on the results, some managerial implications can be recommended for the third-party recycling company.


2017 ◽  
Vol 2017 ◽  
pp. 1-13 ◽  
Author(s):  
Yuanchao Yang

Unit commitment, one of the significant tasks in power system operations, faces new challenges as the system uncertainty increases dramatically due to the integration of time-varying resources, such as wind. To address these challenges, we propose the formulation and solution of a generalized unit commitment problem for a system with integrated wind resources. Given the prespecified interval information acquired from real central wind forecasting system for uncertainty representation of nodal wind injections with their correlation information, the proposed unit commitment problem solution is computationally tractable and robust against all uncertain wind power injection realizations. We provide a solution approach to tackle this problem with complex mathematical basics and illustrate the capabilities of the proposed mixed integer solution approach on the large-scale power system of the Northwest China Grid. The numerical results demonstrate that the approach is realistic and not overly conservative in terms of the resulting dispatch cost outcomes.


2013 ◽  
Vol 221 (3) ◽  
pp. 190-200 ◽  
Author(s):  
Jörg-Tobias Kuhn ◽  
Thomas Kiefer

Several techniques have been developed in recent years to generate optimal large-scale assessments (LSAs) of student achievement. These techniques often represent a blend of procedures from such diverse fields as experimental design, combinatorial optimization, particle physics, or neural networks. However, despite the theoretical advances in the field, there still exists a surprising scarcity of well-documented test designs in which all factors that have guided design decisions are explicitly and clearly communicated. This paper therefore has two goals. First, a brief summary of relevant key terms, as well as experimental designs and automated test assembly routines in LSA, is given. Second, conceptual and methodological steps in designing the assessment of the Austrian educational standards in mathematics are described in detail. The test design was generated using a two-step procedure, starting at the item block level and continuing at the item level. Initially, a partially balanced incomplete item block design was generated using simulated annealing, whereas in a second step, items were assigned to the item blocks using mixed-integer linear optimization in combination with a shadow-test approach.


Author(s):  
Yan Pan ◽  
Shining Li ◽  
Qianwu Chen ◽  
Nan Zhang ◽  
Tao Cheng ◽  
...  

Stimulated by the dramatical service demand in the logistics industry, logistics trucks employed in last-mile parcel delivery bring critical public concerns, such as heavy cost burden, traffic congestion and air pollution. Unmanned Aerial Vehicles (UAVs) are a promising alternative tool in last-mile delivery, which is however limited by insufficient flight range and load capacity. This paper presents an innovative energy-limited logistics UAV schedule approach using crowdsourced buses. Specifically, when one UAV delivers a parcel, it first lands on a crowdsourced social bus to parcel destination, gets recharged by the wireless recharger deployed on the bus, and then flies from the bus to the parcel destination. This novel approach not only increases the delivery range and load capacity of battery-limited UAVs, but is also much more cost-effective and environment-friendly than traditional methods. New challenges therefore emerge as the buses with spatiotemporal mobility become the bottleneck during delivery. By landing on buses, an Energy-Neutral Flight Principle and a delivery scheduling algorithm are proposed for the UAVs. Using the Energy-Neutral Flight Principle, each UAV can plan a flying path without depleting energy given buses with uncertain velocities. Besides, the delivery scheduling algorithm optimizes the delivery time and number of delivered parcels given warehouse location, logistics UAVs, parcel locations and buses. Comprehensive evaluations using a large-scale bus dataset demonstrate the superiority of the innovative logistics UAV schedule approach.


Water ◽  
2021 ◽  
Vol 13 (7) ◽  
pp. 899
Author(s):  
Djordje Mitrovic ◽  
Miguel Crespo Chacón ◽  
Aida Mérida García ◽  
Jorge García Morillo ◽  
Juan Antonio Rodríguez Diaz ◽  
...  

Studies have shown micro-hydropower (MHP) opportunities for energy recovery and CO2 reductions in the water sector. This paper conducts a large-scale assessment of this potential using a dataset amassed across six EU countries (Ireland, Northern Ireland, Scotland, Wales, Spain, and Portugal) for the drinking water, irrigation, and wastewater sectors. Extrapolating the collected data, the total annual MHP potential was estimated between 482.3 and 821.6 GWh, depending on the assumptions, divided among Ireland (15.5–32.2 GWh), Scotland (17.8–139.7 GWh), Northern Ireland (5.9–8.2 GWh), Wales (10.2–8.1 GWh), Spain (375.3–539.9 GWh), and Portugal (57.6–93.5 GWh) and distributed across the drinking water (43–67%), irrigation (51–30%), and wastewater (6–3%) sectors. The findings demonstrated reductions in energy consumption in water networks between 1.7 and 13.0%. Forty-five percent of the energy estimated from the analysed sites was associated with just 3% of their number, having a power output capacity >15 kW. This demonstrated that a significant proportion of energy could be exploited at a small number of sites, with a valuable contribution to net energy efficiency gains and CO2 emission reductions. This also demonstrates cost-effective, value-added, multi-country benefits to policy makers, establishing the case to incentivise MHP in water networks to help achieve the desired CO2 emissions reductions targets.


Author(s):  
Paul Oehlmann ◽  
Paul Osswald ◽  
Juan Camilo Blanco ◽  
Martin Friedrich ◽  
Dominik Rietzel ◽  
...  

AbstractWith industries pushing towards digitalized production, adaption to expectations and increasing requirements for modern applications, has brought additive manufacturing (AM) to the forefront of Industry 4.0. In fact, AM is a main accelerator for digital production with its possibilities in structural design, such as topology optimization, production flexibility, customization, product development, to name a few. Fused Filament Fabrication (FFF) is a widespread and practical tool for rapid prototyping that also demonstrates the importance of AM technologies through its accessibility to the general public by creating cost effective desktop solutions. An increasing integration of systems in an intelligent production environment also enables the generation of large-scale data to be used for process monitoring and process control. Deep learning as a form of artificial intelligence (AI) and more specifically, a method of machine learning (ML) is ideal for handling big data. This study uses a trained artificial neural network (ANN) model as a digital shadow to predict the force within the nozzle of an FFF printer using filament speed and nozzle temperatures as input data. After the ANN model was tested using data from a theoretical model it was implemented to predict the behavior using real-time printer data. For this purpose, an FFF printer was equipped with sensors that collect real time printer data during the printing process. The ANN model reflected the kinematics of melting and flow predicted by models currently available for various speeds of printing. The model allows for a deeper understanding of the influencing process parameters which ultimately results in the determination of the optimum combination of process speed and print quality.


2020 ◽  
Vol 30 (Supplement_5) ◽  
Author(s):  
D Panatto ◽  
P Landa ◽  
D Amicizia ◽  
P L Lai ◽  
E Lecini ◽  
...  

Abstract Background Invasive disease due to Neisseria meningitidis (Nm) is a serious public health problem even in developed countries, owing to its high lethality rate (8-15%) and the invalidating sequelae suffered by many (up to 60%) survivors. As the microorganism is transmitted via the airborne route, the only available weapon in the fight against Nm invasive disease is vaccination. Our aim was to carry out an HTA to evaluate the costs and benefits of anti-meningococcal B (MenB) vaccination with Trumenba® in adolescents in Italy, while also considering the impact of this new vaccination strategy on organizational and ethics aspects. Methods A lifetime Markov model was developed. MenB vaccination with the two-dose schedule of Trumenba® in adolescents was compared with 'non-vaccination'. Two perspectives were considered: the National Health Service (NHS) and society. Three disease phases were defined: acute, post-acute and long-term. Epidemiological, economic and health utilities data were taken from Italian and international literature. The analysis was conducted by means of Microsoft Excel 2010®. Results Our study indicated that vaccinating adolescents (11th year of life) with Trumenba® was cost-effective with an ICER = € 7,912/QALY from the NHS perspective and € 7,758/QALY from the perspective of society. Vaccinating adolescents reduces the number of cases of disease due to meningococcus B in one of the periods of highest incidence of the disease, resulting in significant economic and health savings. Conclusions This is the first study to evaluate the overall impact of free MenB vaccination in adolescents both in Italy and in the international setting. Although cases of invasive disease due to meningococcus B are few, if the overall impact of the disease is adequately considered, it becomes clear that including anti-meningococcal B vaccination into the immunization program for adolescents is strongly recommended from the health and economic standpoints. Key messages Free, large-scale MenB vaccination is key to strengthening the global fight against invasive meningococcal disease. Anti-meningococcal B vaccination in adolescents is a cost-effective health opportunity.


Sign in / Sign up

Export Citation Format

Share Document