The Guarding Problem – Complexity and Approximation

Author(s):  
T. V. Thirumala Reddy ◽  
D. Sai Krishna ◽  
C. Pandu Rangan
Keyword(s):  
2020 ◽  
Author(s):  
Niranjan Raghunathan ◽  
Mikhail Bragin ◽  
Bing Yan ◽  
Peter Luh ◽  
Khosrow Moslehi ◽  
...  

Unit commitment (UC) is an important problem solved on a daily basis within a strict time limit. While hourly UC problems are currently considered, they may not be flexible enough with the fast-changing demand and the increased penetration of intermittent renewables. Sub-hourly UC is therefore recommended. This, however, will significantly increase problem complexity even under the deterministic setting, and current methods may not be able to obtain good solutions within the time limit. In this paper, deterministic sub-hourly UC is considered, with the innovative exploitation of soft constraints – constraints that do not need to be strictly satisfied, but with predetermined penalty coefficients for their violations. The key idea is the “surrogate optimization” concept that ensures multiplier convergence within “surrogate” Lagrangian relaxation as long as the “surrogate optimality condition” is satisfied without the need to optimally solve the “relaxed problem.” Consequently, subproblems can still be formed and optimized when soft constraints are not relaxed, leading to a drastically reduced number of multipliers and improved performance. To further enhance the method, a parallel version is developed. Testing results on the Polish system demonstrate the effectiveness and robustness of both the sequential and parallel versions at finding high-quality solutions within the time limit.


2016 ◽  
Vol 15 (7) ◽  
pp. 1797-1811 ◽  
Author(s):  
Gianlorenzo DAngelo ◽  
Daniele Diodati ◽  
Alfredo Navarra ◽  
Cristina M. Pinotti

Author(s):  
José Carlos Almeida ◽  
Felipe de C. Pereira ◽  
Marina V. A. Reis ◽  
Breno Piva

Author(s):  
Michael Mutingi

As problem complexity continues to increase in industry, developing efficient solution methods for solving hard problems, such as heterogeneous vehicle routing and integrated cell formation problems, is imperative. The focus of this chapter is to develop from the classical simulated evolution algorithm, a Fuzzy Simulated Evolution Algorithm (FSEA) that incorporates the concepts of fuzzy set theory, evolution, and constructive perturbation. The aim is to improve the search efficiency of the algorithm by enhancing the major phases of the algorithm through initialization, evaluation, selection, and reconstruction. Illustrative examples are provided to demonstrate the candidate application areas and to show the strength of the algorithm. Computational experiments are conducted based on benchmark problems in the literature. Results from the computational experiments demonstrate the strength of the algorithm. It is anticipated that the application of the FSEA metaheuristic can be extended to other hard large scale problems.


2006 ◽  
Vol 8 (2) ◽  
pp. 91-100 ◽  
Author(s):  
Olfa Khelifi ◽  
Andrea Lodolo ◽  
Sanja Vranes ◽  
Gabriele Centi ◽  
Stanislav Miertus

Groundwater remediation operation involves several considerations in terms of environmental, technological and socio-economic aspects. A decision support tool (DST) becomes therefore necessary in order to manage problem complexity and to define effective groundwater remediation interventions. CCR (Credence Clearwater Revival), a decision support tool for groundwater remediation technologies assessment and selection, has been developed to help decision-makers (site owners, investors, local community representatives, environmentalists, regulators, etc.) to assess the available technologies and select the preferred remedial options. The analysis is based on technical, economical, environmental and social criteria. These criteria are ranked by all involved parties to determine their relative importance for a particular groundwater remediation project. The Multi-Criteria Decision Making (MCDM) is the core of the CCR using the PROMETHEE II algorithm.


1982 ◽  
Vol 26 (11) ◽  
pp. 989-993
Author(s):  
Edward M. Connelly

An essential step in the development of a computer program is the specification of the solution logic to be implemented by the program. The importance of accurate problem solution specification is further stressed by researchers in programming language and artificial intelligence who suggest that in a relatively short time computer programs will be synthesized automatically and that the job of the user will be only to specify the problem solution. The research reported in this paper involved an investigation of the ability of computer users to specify problem solutions in the form of example solutions. This ability was evaluated as a function of the user's background and experience, the complexity of the available processor (i.e., degree of generalization of the inputs), and the available feedback aids. Further, the ability of experienced programmers to implement the problem solution in FORTRAN IV logic code was investigated. The research reported here is part of study in multi-level communications, both abstract and concrete (i.e., general statements and examples), that may provide a method for effective two-way communication between users and computers. Two participant groups (programmers and bookkeepers/accountants) working with three levels of problem complexity and three levels of processor complexity were used. The experimental task employed in this study required specification of a logic for solution of a Navy task force problem. This task involved choosing ships from a ship list which identified the ship type, the transiting time (the time required for the ship to get from its present position to the desired site), and stationing time (the number of days the ship can remain on station with available provisions). In addition to this specification of ship combinations, the participants had to specify by the example solution the range of transiting and stationing times required. It was found that both programmers' and bookkeepers/accountants' scores decreased with increasing levels of problem and processor complexity, but the scores for the bookkeepers/accountants were significantly less than those of the programmers. In a regression analysis it was found that the degree of computer generalization of the user input (processor complexity) explained more variance than did problem complexity. Further for those experiment conditions where little computer generalization of user input was provided, performance was significantly lower than for other experiment conditions. This result suggests that computer generalization of user inputs is an important factor to accurate specification of problem solutions. Finally, the results show that participant strategy in generating solutions was the most significant factor affecting performance. The strategy measures, which indicated the degree of systematization of the participants, explained 58 percent of the score variance.


Sign in / Sign up

Export Citation Format

Share Document