Solving unit commitment problem using modified subgradient method combined with simulated annealing algorithm.
Displaying 201 – 220 of 224
Stability criteria for large-scale time-delay systems: the LMI approach and the Genetic Algorithms
Jenq-Der Chen (2006)
Control and Cybernetics
Stability of scheduling with random processing times on one machine
Paweł Rajba, Mieczysław Wodecki (2012)
Applicationes Mathematicae
We consider a strong NP-hard single-machine scheduling problem with deadlines and minimizing the total weight of late jobs on a single machine (). Processing times are deterministic values or random variables having Erlang distributions. For this problem we study the tolerance to random parameter changes for solutions constructed according to tabu search metaheuristics. We also present a measure (called stability) that allows an evaluation of the algorithm based on its resistance to random parameter...
Stochastic algorithms for buffer allocation in reliable production lines.
Spinellis, Diomidis D., Papadopoulos, Chrissoleon T. (2000)
Mathematical Problems in Engineering
The Capacitated Arc Routing Problem. A heuristic algorithm.
Enrique. Benavent, V. Campos, Angel Corberán, Enrique Mota (1990)
Qüestiió
In this paper we consider the Capacitated Arc Routing Problem, in which a fleet of K vehicles, all of them based on a specific vertex (the depot) and with a known capacity Q, must service a subset of the edges of the graph, with minimum total cost and such that the load assigned to each vehicle does not exceed its capacity.A heuristic algorithm for this problem is proposed consisting of: the selection of K centers, the construction of K connected graphs with associated loads not exceeding the vehicle...
The effect of spatial scale on predicting time series: a study on epidemiological system identification.
Monteiro, L.H.A., Oliveira, D.N., Chaui-Berlinck, J.G. (2009)
Mathematical Problems in Engineering
The grouping differential evolution algorithm for multi-dimensional optimization problems
Adam Piotrowski, Jarosław Napiórkowski (2010)
Control and Cybernetics
The island model as a Markov dynamic system
Robert Schaefer, Aleksander Byrski, Maciej Smołka (2012)
International Journal of Applied Mathematics and Computer Science
Parallel multi-deme genetic algorithms are especially advantageous because they allow reducing the time of computations and can perform a much broader search than single-population ones. However, their formal analysis does not seem to have been studied exhaustively enough. In this paper we propose a mathematical framework describing a wide class of island-like strategies as a stationary Markov chain. Our approach uses extensively the modeling principles introduced by Vose, Rudolph and their collaborators....
The logistic decision making in management accounting with genetic algorithms and fuzzy sets.
Enrique López González, M. Angel Rodríguez-Fernández, Cristina Mendaña-Cuervo (2000)
Mathware and Soft Computing
The logistics problems in business environments deal with assignation from a number of sources to a number of destinations. Each source offers amounts of goods, while each destination demands quantities of these goods. The object is to find the cheapest transporting schedule that satisfies the demand without violating supply restraints. In this paper we propose to use Fuzzy Sets to represent the previsional information related to costs, demands and other variables. Moreover, we suggest including...
The optimization of feed forward neural networks structure using genetic algorithms.
Ileană, Ioan, Rotar, Corina, Incze, Arpad (2004)
Acta Universitatis Apulensis. Mathematics - Informatics
The periodic Vehicle routing problem: classification and heuristic
M. Mourgaya, F. Vanderbeck (2006)
RAIRO - Operations Research
Periodic Vehicle Routing Problem: classification and heuristic for tactical planning. The Periodic Vehicle Routing Problem (PVRP) consists in assigning customer visits to vehicle routes in some periods of a time horizon so as to satisfy some service level requirements that can take the form of frequency of visit, constraint on time lag between visits, or pre-defined visit patterns. We present different variants of this problem and propose a classification. Then, we consider a model for tactical...
The single (and multi) item profit maximizing capacitated lot–size (PCLSP) problem with fixed prices and no set–up
Kjetil K. Haugen, Asmund Olstad, Krystsina Bakhrankova, Erik Van Eikenhorst (2010)
Kybernetika
This paper proposes a specialized LP-algorithm for a sub problem arising in simple Profit maximising Lot-sizing. The setting involves a single (and multi) item production system with negligible set-up costs/times and limited production capacity. The producer faces a monopolistic market with given time-varying linear demand curves.
Theoretical analysis of steady state genetic algorithms
Alexandru Agapie, Alden H. Wright (2014)
Applications of Mathematics
Evolutionary Algorithms, also known as Genetic Algorithms in a former terminology, are probabilistic algorithms for optimization, which mimic operators from natural selection and genetics. The paper analyses the convergence of the heuristic associated to a special type of Genetic Algorithm, namely the Steady State Genetic Algorithm (SSGA), considered as a discrete-time dynamical system non-generational model. Inspired by the Markov chain results in finite Evolutionary Algorithms, conditions are...
Transport Modeling: an Artificial Immune System Approach
Dušan Teodorović, Jovan Popović, Panta Lučić (2006)
The Yugoslav Journal of Operations Research
Tree based models and algorithms for the preemptive asymmetric Stacker Crane problem
Hervé Kerivin, Mathieu Lacroix, Alain Quilliot, Hélène Toussaint (2011)
RAIRO - Operations Research
In this paper we deal with the preemptive asymmetric stacker crane problem in a heuristic way. We first present some theoretical results which allow us to turn this problem into a specific tree design problem. We next derive from this new representation an integer linear programming model together with simple and efficient greedy and local search heuristics. We conclude by presenting experimental results which aim at both testing the efficiency of our heuristic and evaluating the impact of the...
Tree based models and algorithms for the preemptive asymmetric Stacker Crane problem
Hervé Kerivin, Mathieu Lacroix, Alain Quilliot, Hélène Toussaint (2011)
RAIRO - Operations Research
In this paper we deal with the preemptive asymmetric stacker crane problem in a heuristic way. We first present some theoretical results which allow us to turn this problem into a specific tree design problem. We next derive from this new representation an integer linear programming model together with simple and efficient greedy and local search heuristics. We conclude by presenting experimental results which aim at both testing the efficiency of our heuristic and evaluating the impact of the...
Un algorithme GRASP pour le problème de planification de techniciens et d'interventions pour les télécommunications
Sylvain Boussier, Hideki Hashimoto, Michel Vasquez, Christophe Wilbaut (2009)
RAIRO - Operations Research
Le problème de planification de techniciens et d'interventions pour les télécommunications (TIST pour Technicians and Interventions Scheduling Problem for Telecommunications) comprend la planification d'interventions et l'affectation d'équipes de techniciens à ces interventions. Chaque intervention est caractérisée, entre autres, par une priorité. L'objectif de ce problème est de séquencer les interventions en tenant compte de leur priorité tout en satisfaisant un ensemble de contraintes comme...
Un couplage entre un algorithme génétique et un modèle de simulation pour l'ordonnancement à court terme d'un atelier discontinu de chimie fine
Philippe Baudet, Catherine Azzaro-Pantel, Luc Pibouleau, Serge Domenech (1999)
RAIRO - Operations Research - Recherche Opérationnelle
Un couplage entre un algorithme génétique et un modèle de simulation pour l'ordonnancement à court terme d'un atelier discontinu de chimie fine
Philippe Baudet, Catherine Azzaro-Pantel, Luc Pibouleau, Serge Domenech (2010)
RAIRO - Operations Research
In this paper, a discrete-event simulation model is coupled with a genetic algorithm to treat highly combinatorial scheduling problems encountered in a production campaign of a fine chemistry plant. The main constraints and features of fine chemistry have been taken into account in the development of the model, thus allowing a realistic evaluation of the objective function used in the stochastic optimization procedure. After a presentation of problem combinatorics, the coupling strategy is then...
Une heuristique d’optimisation globale basée sur la -transformation
Alexandre Dolgui, Valery Sysoev (2003)
RAIRO - Operations Research - Recherche Opérationnelle
Dans cet article nous étudions une heuristique d’optimisation globale basée sur la -transformation. Nous illustrons son comportement sur deux types d’exemples. D’abord, nous utilisons un ensemble de fonctions objectif continues non convexes. Nous recherchons l’optimum global de chaque fonction. Ensuite, nous donnons un exemple d’optimisation combinatoire. Cet exemple est lié à l’optimisation paramétrique des règles d’ordonnancement dans un atelier de production manufacturière. Les résultats des...