Search results for "Mathematica"
showing 10 items of 7971 documents
Gradient Scheduling Algorithm for Fair Delay Guarantee in Logarithmic Pricing Scenario
2008
In this paper we propose a packet scheduling scheme for ensuring delay as a Quality of Service (QoS) requirement. For customers, fair service is given while optimizing revenue of the network service provider. Gradient type algorithm for updating the weights of a packet scheduler is derived from a revenue-based optimization problem in the logarithmic pricing scenario. Algorithm is simple to implement. We compared algorithm with optimal brute-force method. The weight updating procedure is independent on the assumption of the connection's statistical behavior, and therefore it is robust against erroneous estimates of statistics.
Predicting service request in support centers based on nonlinear dynamics, ARMA modeling and neural networks
2008
In this paper, we present the use of different mathematical models to forecast service requests in support centers (SCs). A successful prediction of service request can help in the efficient management of both human and technological resources that are used to solve these eventualities. A nonlinear analysis of the time series indicates the convenience of nonlinear modeling. Neural models based on the time delay neural network (TDNN) are benchmarked with classical models, such as auto-regressive moving average (ARMA) models. Models achieved high values for the correlation coefficient between the desired signal and that predicted by the models (values between 0.88 and 0.97 were obtained in th…
Multiobjective service restoration in distribution networks using an evolutionary approach and fuzzy sets
2000
Abstract In this article, the service restoration (SR) problem in electrical distribution networks is dealt with using an evolutionary strategy (ES) with a fuzzy definition of the conflicting objectives. The normal operation status allows the remote control of tie-switches, of capacitor banks and load connection. When a permanent fault occurs, the same remote control actions can be performed with the aim of restoring the service in the concerned areas. The status of these remotely controllable elements is the boolean optimisation variables for the SR problem. Besides this, here the SR problem is dealt with in a multiple objectives (MO) formulation. Indeed, the power losses’ term is consider…
The min-max close-enough arc routing problem
2022
Abstract Here we introduce the Min-Max Close-Enough Arc Routing Problem, where a fleet of vehicles must serve a set of customers while trying to balance the length of the routes. The vehicles do not need to visit the customers, since they can serve them from a distance by traversing arcs that are “close enough” to the customers. We present two formulations of the problem and propose a branch-and-cut and a branch-and-price algorithm based on the respective formulations. A heuristic algorithm used to provide good upper bounds to the exact procedures is also presented. Extensive computational experiments to compare the performance of the algorithms are carried out.
Degrees of characters in the principal block
2021
Abstract Let G be a finite group. We prove that if the set of degrees of characters in the principal p-block of G has size at most 2 then G is p-solvable, and G / O p ′ ( G ) has a metabelian normal Sylow p-subgroup. The general question of proving that if an arbitrary p-block has two degrees then their defect groups are metabelian remains open.
The OptQuest Callable Library
2005
In this chapter we discuss the development and application of a library of functions that is the optimization engine for the OptQuest system. OptQuest is commercial software designed for optimizing complex systems, such as those formulated as simulation models. OptQuest has been integrated with several simulation packages with the goal of adding optimization capabilities. The optimization technology within OptQuest is based on the metaheuristic framework known as scatter search. In addition to describing the functionality of the OptQuest Callable Library (OCL) with an illustrative example, we apply it to a set of unconstrained nonlinear optimization problems.
Adaptation based on interpolation errors for high order mesh refinement methods applied to conservation laws
2012
Adaptive mesh refinement is nowadays a widely used tool in the numerical solution of hyperbolic partial differential equations. The algorithm is based on the numerical approximation of the solution of the equations on a hierarchical set of meshes with different resolutions. Among the different parts that compose an adaptive mesh refinement algorithm, the decision of which level of resolution is adequate for each part of the domain, i.e., the design of a refinement criterion, is crucial for the performance of the algorithm. In this work we analyze a refinement strategy based on interpolation errors, as a building block of a high order adaptive mesh refinement algorithm. We show that this tec…
A computational study of several heuristics for the DRPP
1995
The problem of designing a route of minimum length for a postman that starts and finishes at his office and has to deliver the mail along a set of streets in a city is known as the Rural Postman Problem. When the postman has to obey the directions of the streets, we have the directed version of this problem. Finding an exact solution, in the general case, is intractably difficult. Hence, we have implemented three heuristic algorithms for approximately solving this problem and a procedure for obtaining a lower bound to the optimal length. Also, we present numerical experimentations based on a collection of random instances with up to 30 connected components, 240 vertices and 801 arcs. A lowe…
Bifurcations of Reachable Sets Near an Abnormal Direction and Consequences
2007
We describe precisely, under generic conditions, the contact and the bifurcations of the reachable set at time T along an abnormal direction, first for a single-input affine control system with constraint on the control, and then as an application for a sub-Riemannian system of rank 2. As a consequence we obtain in sub-Riemannian geometry a new splitting-up of the sphere near an abnormal minimizer γ into two sectors, bordered by the first Pontryagin’s cone along γ, called the L ∞-sector and the L 2-sector. Moreover we find again necessary and sufficient conditions of optimality of an abnormal trajectory for such systems, for any optimization problem.
Unions of identifiable families of languages
1996
This paper deals with the satisfiability of requirements put on the identifiability of unions of language families. We consider identification in the limit from a text with bounds on mindchanges and anomalies. We show that, though these identification types are not closed under the set union, some of them still have features that resemble closedness. To formalize this, we generalize the notion of closedness. Then by establishing “how closed” these identification types are we solve the satisfiability problem.