A hybrid simulated annealing and perturb and observe method for maximum power point tracking in PV systems under partial shading conditions

This paper presents a hybrid method for Maximum Power Point Tracking (MPPT) of a Photovoltaic (PV) system which experiences non-uniform environmental conditions or partial shading conditions. The hybrid method combines two simple techniques with complementary strengths in achieving Global MPPT. Simulated Annealing (SA) has only recently been applied to PV MPPT and is very effective at locating global maxima with limited implementation complexity. Perturb and Observe (P&O) is a very common technique which provides continuous tracking of the MPP in a simple and easy to implement manner. The P&O method is generally incapable of locating global maxima, and the SA based method is unable to perform continuous searching. By merging these techniques in a hybrid MPPT method consisting of a global searching stage and a local searching stage, the tracking performance is improved compared to what each technique could achieve independently. Simulation results are presented to demonstrate the effectiveness of the proposed hybrid technique.

A simulated annealing global maximum power point tracking approach for PV modules under partial shading conditions

This paper proposes a simulated annealing (SA)-based global maximum power point tracking (GMPPT) technique designed for photovoltaic (PV) systems which experience partial shading conditions (PSC). The proposed technique is compared with the common perturb and observe MPPT technique and the particle swarm optimization method for GMPPT. The performance is assessed by considering the time taken to converge and the number of sample cases where the technique converges to the GMPP. Simulation results indicate the improved performance of the SA-based GMPPT algorithm, with arbitrarily selected parameters, in tracking to the global maxima in a multiple module PV system which experiences PSC. Experimental validation of the technique is presented based on PV modules that experience nonuniform environmental conditions. Additionally, studies regarding the influence of the key parameters of the SA-based algorithm are described. Simulation and experimental results verify the effectiveness of the proposed GMPPT method.

Otimização multimodal através de novas técnicas baseadas em clusterização nebulosa

Neste trabalho, é proposta uma nova família de métodos a ser aplicada à otimização de problemas multimodais. Nestas técnicas, primeiramente são geradas soluções iniciais com o intuito de explorar o espaço de busca. Em seguida, com a finalidade de encontrar mais de um ótimo, estas soluções são agrupadas em subespaços utilizando um algoritmo de clusterização nebulosa. Finalmente, são feitas buscas locais através de métodos determinísticos de otimização dentro de cada subespaço gerado na fase anterior com a finalidade de encontrar-se o ótimo local. A família de métodos é formada por seis variantes, combinando três esquemas de inicialização das soluções na primeira fase e dois algoritmos de busca local na terceira. A fim de que esta nova família de métodos possa ser avaliada, seus constituintes são comparados com outras metodologias utilizando problemas da literatura e os resultados alcançados são promissores.

Desenvolvimento de extensões para um sistema de carregamento e descarregamento de navios

One of the reasons that influences the efficience of a port terminal that is especialized in movement of containers is in the process of their loading and unloading. The fundamental idea is to determine a plan, to each port in order to decrease the number of total movement of loading and unloading that are necessary during the ship route to every port so that they save time and consequently reduce costs. The goal of this research was to present improvement in the program, written in language C, used to solve to problem of loading and unloading of ships, a NP-complete problem, through the meta-heuristics Simulated Annealing. With the improvement made, an average of 50% reduction of necessary time was gotten to solve the problem in 45 analised instances and in a specific group of these instances the average reduction reached 77 and in 10 instances there was even an improvement in the solution

Quantum annealing of an ising spin-glass by Green's function Monte Carlo

We present an implementation of quantum annealing (QA) via lattice Green's function Monte Carlo (GFMC), focusing on its application to the Ising spin glass in transverse field. In particular, we study whether or not such a method is more effective than the path-integral Monte Carlo- (PIMC) based QA, as well as classical simulated annealing (CA), previously tested on the same optimization problem. We identify the issue of importance sampling, i.e., the necessity of possessing reasonably good (variational) trial wave functions, as the key point of the algorithm. We performed GFMC-QA runs using such a Boltzmann-type trial wave function, finding results for the residual energies that are qualitatively similar to those of CA (but at a much larger computational cost), and definitely worse than PIMC-QA. We conclude that, at present, without a serious effort in constructing reliable importance sampling variational wave functions for a quantum glass, GFMC-QA is not a true competitor of PIMC-QA.

Optimization through quantum annealing: theory and some applications

Quantum annealing is a promising tool for solving optimization problems, similar in some ways to the traditional ( classical) simulated annealing of Kirkpatrick et al. Simulated annealing takes advantage of thermal fluctuations in order to explore the optimization landscape of the problem at hand, whereas quantum annealing employs quantum fluctuations. Intriguingly, quantum annealing has been proved to be more effective than its classical counterpart in many applications. We illustrate the theory and the practical implementation of both classical and quantum annealing - highlighting the crucial differences between these two methods - by means of results recently obtained in experiments, in simple toy-models, and more challenging combinatorial optimization problems ( namely, Random Ising model and Travelling Salesman Problem). The techniques used to implement quantum and classical annealing are either deterministic evolutions, for the simplest models, or Monte Carlo approaches, for harder optimization tasks. We discuss the pro and cons of these approaches and their possible connections to the landscape of the problem addressed.

Metaheurísticas em um problema de rotação de culturas

Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES)

Robustness in facility location

Facility location concerns the placement of facilities, for various objectives, by use of mathematical models and solution procedures. Almost all facility location models that can be found in literature are based on minimizing costs or maximizing cover, to cover as much demand as possible. These models are quite efficient for finding an optimal location for a new facility for a particular data set, which is considered to be constant and known in advance. In a real world situation, input data like demand and travelling costs are not fixed, nor known in advance. This uncertainty and uncontrollability can lead to unacceptable losses or even bankruptcy. A way of dealing with these factors is robustness modelling. A robust facility location model aims to locate a facility that stays within predefined limits for all expectable circumstances as good as possible. The deviation robustness concept is used as basis to develop a new competitive deviation robustness model. The competition is modelled with a Huff based model, which calculates the market share of the new facility. Robustness in this model is defined as the ability of a facility location to capture a minimum market share, despite variations in demand. A test case is developed by which algorithms can be tested on their ability to solve robust facility location models. Four stochastic optimization algorithms are considered from which Simulated Annealing turned out to be the most appropriate. The test case is slightly modified for a competitive market situation. With the Simulated Annealing algorithm, the developed competitive deviation model is solved, for three considered norms of deviation. At the end, also a grid search is performed to illustrate the landscape of the objective function of the competitive deviation model. The model appears to be multimodal and seems to be challenging for further research.

A sequencing approach for creating new train timetables

Train scheduling is a complex and time consuming task of vital importance. To schedule trains more accurately and efficiently than permitted by current techniques a novel hybrid job shop approach has been proposed and implemented. Unique characteristics of train scheduling are first incorporated into a disjunctive graph model of train operations. A constructive algorithm that utilises this model is then developed. The constructive algorithm is a general procedure that constructs a schedule using insertion, backtracking and dynamic route selection mechanisms. It provides a significant search capability and is valid for any objective criteria. Simulated Annealing and Local Search meta-heuristic improvement algorithms are also adapted and extended. An important feature of these approaches is a new compound perturbation operator that consists of many unitary moves that allows trains to be shifted feasibly and more easily within the solution. A numerical investigation and case study is provided and demonstrates that high quality solutions are obtainable on real sized applications.

Metaheuristic approaches to the hybrid flow shop scheduling problem with a cost-related criterion

In the paper, the flow-shop scheduling problem with parallel machines at each stage (machine center) is studied. For each job its release and due date as well as a processing time for its each operation are given. The scheduling criterion consists of three parts: the total weighted earliness, the total weighted tardiness and the total weighted waiting time. The criterion takes into account the costs of storing semi-manufactured products in the course of production and ready-made products as well as penalties for not meeting the deadlines stated in the conditions of the contract with customer. To solve the problem, three constructive algorithms and three metaheuristics (based one Tabu Search and Simulated Annealing techniques) are developed and experimentally analyzed. All the proposed algorithms operate on the notion of so-called operation processing order, i.e. the order of operations on each machine. We show that the problem of schedule construction on the base of a given operation processing order can be reduced to the linear programming task. We also propose some approximation algorithm for schedule construction and show the conditions of its optimality.

Railway junction traffic control by heuristic methods

Traffic conflicts at railway junctions are very conmon, particularly on congested rail lines. While safe passage through the junction is well maintained by the signalling and interlocking systems, minimising the delays imposed on the trains by assigning the right-of-way sequence sensibly is a bonus to the quality of service. A deterministic method has been adopted to resolve the conflict, with the objective of minimising the total weighted delay. However, the computational demand remains significant. The applications of different heuristic methods to tackle this problem are reviewed and explored, elaborating their feasibility in various aspects and comparing their relative merits for further studies. As most heuristic methods do not guarantee a global optimum, this study focuses on the trade-off between computation time and optimality of the resolution.