5,086 research outputs found
Automatic allocation of safety requirements to components of a software product line
Safety critical systems developed as part of a product line must still comply with safety standards. Standards use the concept of Safety Integrity Levels (SILs) to drive the assignment of system safety requirements to components of a system under design. However, for a Software Product Line (SPL), the safety requirements that need to be allocated to a component may vary in different products. Variation in design can indeed change the possible hazards incurred in each product, their causes, and can alter the safety requirements placed on individual components in different SPL products. Establishing common SILs for components of a large scale SPL by considering all possible usage scenarios, is desirable for economies of scale, but it also poses challenges to the safety engineering process. In this paper, we propose a method for automatic allocation of SILs to components of a product line. The approach is applied to a Hybrid Braking System SPL design
The crew-scheduling module in the GIST system
The public transportation is gaining importance every year basically due the population growth, environmental policies and, route and street congestion. Too able an efficient management of all the resources related to public transportation, several techniques from different areas are being applied and several projects in Transportation Planning Systems, in different countries, are being developed. In this work, we present the GIST Planning Transportation Systems, a Portuguese project involving two universities and six public transportation companies. We describe in detail one of the most relevant modules of this project, the crew-scheduling module. The crew-scheduling module is based on the application of meta-heuristics, in particular GRASP, tabu search and genetic algorithm to solve the bus-driver-scheduling problem. The metaheuristics have been successfully incorporated in the GIST Planning Transportation Systems and are actually used by several companies.Integrated transportation systems, crew scheduling, metaheuristics
A taxonomy for emergency service station location problem
The emergency service station (ESS) location problem has been widely
studied in the literature since 1970s. There has been a growing interest in the subject especially after 1990s. Various models with different objective functions and constraints have been proposed in the academic literature and efficient solution techniques have been developed to provide good solutions in reasonable times. However, there is not any study that systematically classifies different problem types and methodologies to address them. This paper presents a taxonomic framework for the ESS location problem using an operations research perspective. In this framework, we basically
consider the type of the emergency, the objective function, constraints, model
assumptions, modeling, and solution techniques. We also analyze a variety of papers related to the literature in order to demonstrate the effectiveness of the taxonomy and to get insights for possible research directions
Location models for airline hubs behaving as M/D/c queues
Models are presented for the optimal location of hubs in airline networks, that take into consideration the congestion effects. Hubs, which are the most congested airports, are modeled as M/D/c queuing systems, that is, Poisson arrivals, deterministic service time, and {\em c} servers. A formula is derived for the probability of a number of customers in the system, which is later used to propose a probabilistic constraint. This constraint limits the probability of {\em b} airplanes in queue, to be lesser than a value . Due to the computational complexity of the formulation. The model is solved using a meta-heuristic based on tabu search. Computational experience is presented.Hub location, congestion, tabu-search
Implementing Tabu Search to Exploit Sparsity in ATSP Instances
Real life traveling salesman problem (TSP) instances are often large,sparse, and asymmetric. Conventional tabu search implementations for the TSP that have been reported in the literature, almost always deals with small, dense and symmetric instances. In this paper, we outline data structures and a tabu search implementation that takes advantage of such data structures, which can exploit sparsity of a TSP instances, and hence can solve relatively large TSP instances (with up to 3000 nodes) much faster than conventional implementations. We also provide computational experiences with this implementation.
Recommended from our members
Combinatorial optimization and metaheuristics
Today, combinatorial optimization is one of the youngest and most active areas of discrete mathematics. It is a branch of optimization in applied mathematics and computer science, related to operational research, algorithm theory and computational complexity theory. It sits at the intersection of several fields, including artificial intelligence, mathematics and software engineering. Its increasing interest arises for the fact that a large number of scientific and industrial problems can be formulated as abstract combinatorial optimization problems, through graphs and/or (integer) linear programs. Some of these problems have polynomial-time (âefficientâ) algorithms, while most of them are NP-hard, i.e. it is not proved that they can be solved in polynomial-time. Mainly, it means that it is not possible to guarantee that an exact solution to the problem can be found and one has to settle for an approximate solution with known performance guarantees. Indeed, the goal of approximate methods is to find âquicklyâ (reasonable run-times), with âhighâ probability, provable âgoodâ solutions (low error from the real optimal solution). In the last 20 years, a new kind of algorithm commonly called metaheuristics have emerged in this class, which basically try to combine heuristics in high level frameworks aimed at efficiently and effectively exploring the search space. This report briefly outlines the components, concepts, advantages and disadvantages of different metaheuristic approaches from a conceptual point of view, in order to analyze their similarities and differences. The two very significant forces of intensification and diversification, that mainly determine the behavior of a metaheuristic, will be pointed out. The report concludes by exploring the importance of hybridization and integration methods
Optimal Alignments for Designing Urban Transport Systems: Application to Seville
The achievement of some of the Sustainable Development Goals (SDGs) from the recent
2030 Agenda for Sustainable Development has drawn the attention of many countries towards
urban transport networks. Mathematical modeling constitutes an analytical tool for the formal
description of a transportation system whereby it facilitates the introduction of variables and the
definition of objectives to be optimized. One of the stages of the methodology followed in the
design of urban transit systems starts with the determination of corridors to optimize the population
covered by the system whilst taking into account the mobility patterns of potential users and the
time saved when the public network is used instead of private means of transport. Since the capture
of users occurs at stations, it seems reasonable to consider an extensive and homogeneous set of
candidate sites evaluated according to the parameters considered (such as pedestrian population
captured and destination preferences) and to select subsets of stations so that alignments can take
place. The application of optimization procedures that decide the sequence of nodes composing the
alignment can produce zigzagging corridors, which are less appropriate for the design of a single line.
The main aim of this work is to include a new criterion to avoid the zigzag effect when the alignment
is about to be determined. For this purpose, a curvature concept for polygonal lines is introduced,
and its performance is analyzed when criteria of maximizing coverage and minimizing curvature are
combined in the same design algorithm. The results show the application of the mathematical model
presented for a real case in the city of Seville in Spain.Ministerio de EconomĂa y Competitividad MTM2015-67706-
- âŠ