In this paper a single facility location problem with multiple relocation opportunities is investigated. The weight associated with each demand point is a known function of time. We consider either rectilinear, or squared Euclidean, or Euclidean distances. Relocations can take place at pre-determined times. The objective function is to minimize the total location and relocation costs. An algori...

We present an approach for automated generation of proactive aggregation protocols using Genetic Programming. First a short introduction into aggregation and proactive protocols is given. We then show how proactive aggregation protocols can be specified abstractly. To be able to use Genetic Programming to derive such protocol specifications, we describe a simulation based fitness assignment met...

A neutral gas background pressure map of the Large Vacuum Test Facility (LVTF) at the University of Michigan is presented. The LVTF was mapped at a series of cold anode flow rates corresponding to P5 Hall thruster operating conditions of 1.5, 3.0, and 9.0 kW. The chamber pressure was mapped at nominal xenon pumping speeds of 140,000 and 240,000 l/s with a rake consisting of five calibrated Baya...

We present an application of ABS algorithms for multiple sequence alignment (MSA). The Markov decision process (MDP) based model leads to a linear programming problem (LPP), whose solution is linked to a suggested alignment. The important features of our work include the facility of alignment of multiple sequences simultaneously and no limit for the length of the sequences. Our goal here is to ...

in this paper, we study the network location problem for two congestible facilities, considering impatient customers. we suppose that when a customer arrives his/her corresponding facility and faces a queue with the size more than a predetermined threshold, the customer decides not to join the queue but to go to the closest facility to current facility. in the second facility, if the queue size...

In this thesis, we survey approximate dynamic programming (ADP) methods and test the methods with the game of Tetris. We focus on ADP methods where the costto-go function J is approximated with 5r, where 4 is some matrix and r is a vector with relatively low dimension. There are two major categories of methods: projected equation methods and aggregation methods. In projected equation methods, t...

generally, an engineering design problem has multiple objective functions. some of these problems can be formulated as multiobjective geometric programming models. on the other hand,often in the real world, coefficients of the objective functions are not known precisely. coefficients may be interpreted as fuzzy numbers, which lead to a multiobjective geometric programming with fuzzy parameters....