Search results for " Computer Science"
showing 10 items of 3983 documents
A tabu search algorithm for the bipartite drawing problem
1998
Graphs are used to represent reality in several areas of knowledge. This has generated considerable interest in graph drawing algorithms. Arc crossing minimization is a fundamental aesthetic criterion to obtain a readable map of a graph. The problem of minimizing the number of arc crossings in a bipartite graph (BDP) is NP-complete. In this paper we present a Tabu Search (TS) scheme for the BDP. Several algorithms can be obtained with this scheme by implementing different evaluators in the move definitions. In this paper we propose two variants. Computational results are reported on a set of 300 randomly generated test problems. The two algorithms have been compared with the best heuristics…
A note on symmetry reduction for circular traveling tournament problems
2011
Abstract The traveling tournament problem (TTP) consists of finding a distance-minimal double round-robin tournament where the number of consecutive breaks is bounded. Easton et al. (2001) introduced the so-called circular TTP instances, where venues of teams are located on a circle. The distance between neighboring venues is one, so that the distance between any pair of teams is the distance on the circle. It is empirically proved that these instances are very hard to solve due to the inherent symmetry. This note presents new ideas to cut off essentially identical parts of the solution space. Enumerative solution approaches, e.g. relying on branch-and-bound, benefit from this reduction. We…
Analysis and design of sequencing rules for car sequencing
2009
Abstract This paper presents novel approaches for generating sequencing rules for the car sequencing (CS) problem in cases of two and multiple processing times per station. The CS problem decides on the succession of different car models launched down a mixed-model assembly line. It aims to avoid work overloads at the stations of the line by applying so-called sequencing rules, which restrict the maximum occurrence of labor-intensive options in a subsequence of a certain length. Thus to successfully avoid work overloads, suitable sequencing rules are essential. The paper shows that the only existing rule generation approach leads to sequencing rules which misclassify feasible sequences. We …
DEA-like models for efficiency evaluation of specialized and interdependent units
2001
Abstract The problem of evaluating the efficiency of a set of specialized and interdependent decision making subunits (DMSUs) that make up a larger decision making unit (DMU) is considered. The DMSUs are interdependent, in the sense that part of the output produced by each of them may be used as an input by the other ones. They are also specialized, hence non-homogeneous, as they may have not the same inputs and outputs. For this problem, some efficiency indexes are introduced, and they are shown to satisfy some basic properties.
Efficiency analysis in banking firms: An international comparison
1997
The intensive process of financial European integration, together with the profound transformation and deregulation that has taken place in the Spanish Banking System, justifies the evaluation of its efficiency in comparison with that of other banking systems. In this context, the aim of this study is to analyze the productivity, efficiency and differences in technology of several banking systems. Using a non-parametric approach together with the Malmquist index, we compare the efficiency, productivity and differences in technology of different European and US banking systems for the year 1992. Finally, for a subsample of banks belonging to the same group of countries, using real as opposed…
The expected value of the traceability information
2015
Abstract Recent regulations on agri-food traceability prescribe traceability throughout the entire supply chain, in order to ensure consumers’ safety and product quality. This has led producers and retailers to consider the opportunity to improve the firm's reputation and consumer confidence through the implementation of traceability systems designed not only to satisfy the legal requirements, but also to track the quality of the products through the supply chain for optimization purposes. However the actual implementation of such systems depends on the possibility of gathering specific information related to the product quality. Nowadays, innovative and non invasive technologies such as th…
A survey of variants and extensions of the location-routing problem
2015
This is a review of the literature on variants and extensions of the standard location-routing problem published since the last survey, by Nagy and Salhi, appeared in 2006. We propose a classification of problem variants, provide concise paper excerpts that convey the central ideas of each work, discuss recent developments in the field, and list promising topics for further research.
A real options game of alliance timing decisions in biopharmaceutical research and development
2017
Abstract In this article we examine the alliance timing trade-off facing both pharmaceutical and biotech firms in a stochastic and competitive environment. Specifically, we introduce a real options game (ROG), where a pharmaceutical company can choose between two competing biotech firms by sequentially offering a licensing deal early or late in the new drug development process. We find that, when the alliance raises the drug market value significantly, the agreement is signed late in the drug development process. This suggests that the postponement effect implied by the use of real options prevails over the biotech firms’ competition effect, which would instead play in favor of an early agr…
The Hierarchical Mixed Rural Postman Problem: Polyhedral analysis and a branch-and-cut algorithm
2017
[EN] The Hierarchical Mixed Rural Postman Problem is defined on a mixed graph where arcs and edges that require a service are divided into clusters' that have to be serviced in a hierarchical order. The problem generalizes the Mixed Rural Postman Problem and thus is NP-hard. In this paper, we provide a polyhedral analysis of the problem and propose a branch-and-cut algorithm for its solution based on the introduced classes of valid inequalities. Extensive computational experiments are reported on benchmark instances. The exact approach allows to find the optimal solutions in less than 1 hour for instances with up to 999 vertices, 2678 links, and five clusters.
Modelling and forecasting mortality in Spain
2008
[EN] Experience shows that static life tables overestimate death probabilities. As a consequence of this overestimation the premiums for annuities, pensions and life insurance are not what they actually should be, with negative effects for insurance companies or policy-holders. The reason for this overestimation is that static life tables, through being computed for a specific period of time, cannot take into account the decreasing mortality trend over time. Dynamic life tables overcome this problem by incorporating the influence of the calendar when graduating mortality. Recent papers on the topic look for the development of new methods to deal with this dynamism. Most methods used in dyna…