An exact approach for the r-interdiction median problem with fortification

2019 ◽  
Vol 53 (2) ◽  
pp. 505-516 ◽  
Author(s):  
Marcos Costa Roboredo ◽  
Artur Alves Pessoa ◽  
Luiz Aizemberg
Keyword(s):  
Exact Algorithm ◽  
Branch And Cut ◽  
Total System ◽  
Demand Point ◽  
Median Problem ◽  
System Cost ◽  
Exact Approach ◽  
Knowing That

We study the r-interdiction median problem with fortification (RIMF), which considers demand points that are served by facilities. If a facility is interdicted, it can not serve any demand point, increasing the total system cost. To avoid an interdiction, a facility can be fortified. The problem consists of fortifying facilities knowing that some facilities will be interdicted. We propose a branch-and-cut algorithm for the RIMF and several experiments attest that our method outperforms the best exact algorithm found.

An Exact Algorithm for Large-Scale Continuous Nonlinear Resource Allocation Problems with Minimax Regret Objectives

2021 ◽  
Author(s):  
Jungho Park ◽  
Hadi El-Amine ◽  
Nevin Mutlu
Keyword(s):  
Resource Allocation ◽  
Objective Function ◽  
Large Scale ◽  
Computational Study ◽  
Optimal Solution ◽  
Exact Algorithm ◽  
Minimax Regret ◽  
Optimal Solutions ◽  
Heuristic Approaches ◽  
Exact Approach

We study a large-scale resource allocation problem with a convex, separable, not necessarily differentiable objective function that includes uncertain parameters falling under an interval uncertainty set, considering a set of deterministic constraints. We devise an exact algorithm to solve the minimax regret formulation of this problem, which is NP-hard, and we show that the proposed Benders-type decomposition algorithm converges to an [Formula: see text]-optimal solution in finite time. We evaluate the performance of the proposed algorithm via an extensive computational study, and our results show that the proposed algorithm provides efficient solutions to large-scale problems, especially when the objective function is differentiable. Although the computation time takes longer for problems with nondifferentiable objective functions as expected, we show that good quality, near-optimal solutions can be achieved in shorter runtimes by using our exact approach. We also develop two heuristic approaches, which are partially based on our exact algorithm, and show that the merit of the proposed exact approach lies in both providing an [Formula: see text]-optimal solution and providing good quality near-optimal solutions by laying the foundation for efficient heuristic approaches.

Establishing simulation model for optimizing efficiency of CNC machine using reliability-centered maintenance approach

2019 ◽  
Vol 10 (06) ◽  
pp. 1950034 ◽  
Author(s):  
Zahid Hussain ◽  
Hamid Jan
Keyword(s):  
Preventive Maintenance ◽  
Simulation Software ◽  
Time Interval ◽  
Total System ◽  
Cnc Machine ◽  
Effect Analysis ◽  
System Cost ◽  
Reliability Centered Maintenance ◽  
Maintenance Time ◽  
Critical Components

The objective of this work was to enhance the product’s quality by concentrating on the machine’s optimized efficiency. In order to increase the machine’s reliability, the basis of reliability-centered maintenance approach was utilized. The purpose was to establish a planned preventive maintenance strategy to identify the machine’s critical components having a noteworthy effect on the product’s quality. The critical components were prioritized using failure mode and effect analysis (FMEA). The goal of the study was to decrease the ppm time interval for a CNC machine by simulating the projected preventive maintenance time interval. For this purpose, the simulation software ProModel 7.5 was implemented for the current preventive maintenance procedure to choose the best ppm time interval which contributed better norms. Five dissimilar optimization approaches were applied, however, the first approach yielded the prominent total system cost and the shorter ppm interval. The results of the study revealed that there was an increase of USD 1878 as a result of an increase in total system cost from USD 78,365 to USD 80,243. Preventive maintenance costs were reduced from USD 4196 to USD 2248 (46%). The costs associated with good parts increased from USD 8259 to USD 8294 (0.4%) and the costs associated with defective parts reduced from USD 171 to USD 3 (98.25%), respectively.

scholarly journals An Approximation Algorithm for the Facility Location Problem with Lexicographic Minimax Objective

2014 ◽  
Vol 2014 ◽  
pp. 1-12 ◽  
Author(s):  
Ľuboš Buzna ◽  
Michal Koháni ◽  
Jaroslav Janáček
Keyword(s):  
Approximation Algorithm ◽  
Facility Location ◽  
Location Problem ◽  
Optimal Solution ◽  
Facility Location Problem ◽  
Exact Algorithm ◽  
General Purpose ◽  
Median Problem ◽  
Discrete Facility Location ◽  
Number Of Customers

We present a new approximation algorithm to the discrete facility location problem providing solutions that are close to the lexicographic minimax optimum. The lexicographic minimax optimum is a concept that allows to find equitable location of facilities serving a large number of customers. The algorithm is independent of general purpose solvers and instead uses algorithms originally designed to solve thep-median problem. By numerical experiments, we demonstrate that our algorithm allows increasing the size of solvable problems and provides high-quality solutions. The algorithm found an optimal solution for all tested instances where we could compare the results with the exact algorithm.

Study on Model of Inventory and Distribution Joint Optimization Based on the VMI

2013 ◽  
Vol 361-363 ◽  
pp. 2053-2056
Author(s):  
Ji Jun Pang ◽  
Xi Fu Wang
Keyword(s):  
Iterative Algorithm ◽  
System Optimization ◽  
Joint Optimization ◽  
Total System ◽  
Logistics System ◽  
Matlab Software ◽  
System Cost ◽  
Multiple Clients

This paper studies the problem of inventory and distribution joint optimization for two level logistics system of a supplier and multiple clients by building the model of inventory and distribution joint optimization based on VMI to reach the goal of minimizing the total system cost. Moreover, this article not only designs the iterative algorithm to solve the model, and determine the optimal inventory and distribution program from the perspective of system optimization, but also verifies the validity of the model and algorithm through using MATLAB software.

A Novel Optimization Model for Location of Waste Transfer Stations

2011 ◽  
Vol 214 ◽  
pp. 578-582 ◽  
Author(s):  
Gao Chang Zhao
Keyword(s):  
Environmental Monitoring ◽  
Waste Disposal ◽  
Optimization Model ◽  
Total System ◽  
Evaluation Function ◽  
Numerical Examples ◽  
System Cost ◽  
Waste Transfer ◽  
Transfer Stations ◽  
Novel Model

Waste transfer stations play an important role in waste disposal. This paper proposed a novel model for optimization location of waste transfer stations in environmental monitoring. With the considering of requirements, total system cost and the effect to the environment, an optimization model is given for the positions of waste transfer stations. An algorithm is proposed to solve the optimization model and the evaluation function can obtain the minimal value. The efficiency and the accuracy of the proposed algorithm are shown in several numerical examples..

Sign in / Sign up

Export Citation Format

Share Document