Search results for "OPTIMIZATION"
showing 10 items of 2824 documents
Understanding the Key Factors of Shared Mobility Services: Palermo as a Case Study
2020
The potential success of shared mobility services in the urban area strongly depends on careful tariff planning, adequate sizing of the fleet and efficient integrated public transport system, as well as on the application of policies in favor of sustainable modes of transport. The balance between earnings and expenses is not always an easy target for the companies in those cities where these services are not well-rooted in the citizens’ mobility habits. Often only large operators in the sector can continue to offer a service generating profit. However, several factors can determine the success or the failure of shared mobility services. The objective of this study is to identify, thanks to …
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.
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…
Kata Containers: An Emerging Architecture for Enabling MEC Services in Fast and Secure Way
2019
New coming applications will be only possible through Mobile Edge Servers deployed in proximity of the mobile users. Due to the user's mobility and server's workload, service migration will be an integral part of the services. For this reason, a standardized architecture should be designed to accomplish a workload migration in a secure and timely manner. Most research done to date has focused on the use of either virtual machine (VM) or container or a mix of both recently. A final solution might be an architecture only having the advantages of both technologies as the security of the VM and the speed of the containers. Custom solutions, actually, by using both technologies, need continuous …
Dynamic composition of services : application to designing and developping information systems in a distributed environment
2010
The service oriented computing paradigm plays an increasingly important role in structuring complex systems. Application design and development approaches are witnessing a shift from traditional models towards a more dynamic service oriented model promoting reuse and adaptability. In this thesis, we study an approach for application design and development based on services’ composition. We propose DyCoSe, an environment for sharing services. It consists of an enterprise ecosystem wherein members, organized in communities, share a global agreement describing traditional business functionalities and common non-functional properties. DyCoSe relies on a three level architecture for service base…
The Rail Quality Index as an Indicator of the “Global Comfort” in Optimizing Safety, Quality and Efficiency in Railway Rails
2012
AbstractThe proposed model uses the stochastic dynamic programming and in particular Markov decision processes applied to the Rail Quality Index (RQI - Italian Indice di Qualità del Binario, IQB).By performing the integrated analysis of the classes of variables which characterize the overall service quality (in terms of comfort and safety), the proposed mathematical approach allows to find the solutions to the decision-making process in function of the probability of deterioration of the state variables of the infrastructure over time and of the flow of available resources.
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.
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…
Automating the Parameter Selection in VRP: An Off-line Parameter Tuning Tool Comparison
2014
Vehicle route optimization is an important application of combinatorial optimization. Therefore, a variety of methods has been proposed to solve different challenging vehicle routing problems. An important step in adopting these methods to solve real-life problems is to find appropriate parameters for the routing algorithms. In this chapter, we show how this task can be automated using parameter tuning by presenting a set of comparative experiments on seven state-of-the-art tuning methods. We analyze the suitability of these methods in configuring routing algorithms, and give the first critical comparison of automated parameter tuners in vehicle routing. Our experimental results show that t…