6,376 research outputs found
Partial resampling to approximate covering integer programs
We consider column-sparse covering integer programs, a generalization of set
cover, which have a long line of research of (randomized) approximation
algorithms. We develop a new rounding scheme based on the Partial Resampling
variant of the Lov\'{a}sz Local Lemma developed by Harris & Srinivasan (2019).
This achieves an approximation ratio of , where is the minimum covering
constraint and is the maximum -norm of any column of the
covering matrix (whose entries are scaled to lie in ). When there are
additional constraints on the variable sizes, we show an approximation ratio of
(where is the maximum number
of non-zero entries in any column of the covering matrix). These results
improve asymptotically, in several different ways, over results of Srinivasan
(2006) and Kolliopoulos & Young (2005).
We show nearly-matching inapproximability and integrality-gap lower bounds.
We also show that the rounding process leads to negative correlation among the
variables, which allows us to handle multi-criteria programs
On The Use of Genetic Algorithms to Solve Location Problems
This paper seeks to evaluate the performance of genetic algorithms (GA) as an alternative procedure for generating optimal or near-optimal solutions for location problems. The specific problems considered are the uncapacitated and capacitated fixed charge problems, the maximum covering problem, and competitive location models. We compare the performance of the GA-based heuristics developed against well-known heuristics from the literature, using a test base of publicly available data sets.
Scope and purpose
Genetic algorithms are a potentially powerful tool for solving large-scale combinatorial optimization problems. This paper explores the use of this category of algorithms for solving a wide class of location problems. The purpose is not to prove that these algorithms are superior to procedures currently utilized to solve location problems, but rather to identify circumstances where such methods can be useful and viable as an alternative/superior heuristic solution method
AI and OR in management of operations: history and trends
The last decade has seen a considerable growth in the use of Artificial Intelligence (AI) for operations management with the aim of finding solutions to problems that are increasing in complexity and scale. This paper begins by setting the context for the survey through a historical perspective of OR and AI. An extensive survey of applications of AI techniques for operations management, covering a total of over 1200 papers published from 1995 to 2004 is then presented. The survey utilizes Elsevier's ScienceDirect database as a source. Hence, the survey may not cover all the relevant journals but includes a sufficiently wide range of publications to make it representative of the research in the field. The papers are categorized into four areas of operations management: (a) design, (b) scheduling, (c) process planning and control and (d) quality, maintenance and fault diagnosis. Each of the four areas is categorized in terms of the AI techniques used: genetic algorithms, case-based reasoning, knowledge-based systems, fuzzy logic and hybrid techniques. The trends over the last decade are identified, discussed with respect to expected trends and directions for future work suggested
Integrating network design and frequency setting in public transportation networks: a survey
This work reviews the literature on models which integrate the network design and the frequency setting phases in public transportation networks. These two phases determine to a large extent the service for the passengers and the operational costs for the operator of the system. The survey puts emphasis on modelling features, i.e., objective cost components and constraints, as well as on algorithmic aspects. Finally, it provides directions for further research.Peer Reviewe
The multi-vehicle covering tour problem: building routes for urban patrolling
In this paper we study a particular aspect of the urban community policing:
routine patrol route planning. We seek routes that guarantee visibility, as
this has a sizable impact on the community perceived safety, allowing quick
emergency responses and providing surveillance of selected sites (e.g.,
hospitals, schools). The planning is restricted to the availability of vehicles
and strives to achieve balanced routes. We study an adaptation of the model for
the multi-vehicle covering tour problem, in which a set of locations must be
visited, whereas another subset must be close enough to the planned routes. It
constitutes an NP-complete integer programming problem. Suboptimal solutions
are obtained with several heuristics, some adapted from the literature and
others developed by us. We solve some adapted instances from TSPLIB and an
instance with real data, the former being compared with results from
literature, and latter being compared with empirical data.Comment: 28 pages, 8 figures, 7 tables, Brazilian Operations Research Society;
Printed version ISSN 0101-7438 / Online version ISSN 1678-514
Timely Data Delivery in a Realistic Bus Network
Abstract—WiFi-enabled buses and stops may form the backbone of a metropolitan delay tolerant network, that exploits nearby communications, temporary storage at stops, and predictable bus mobility to deliver non-real time information. This paper studies the problem of how to route data from its source to its destination in order to maximize the delivery probability by a given deadline. We assume to know the bus schedule, but we take into account that randomness, due to road traffic conditions or passengers boarding and alighting, affects bus mobility. We propose a simple stochastic model for bus arrivals at stops, supported by a study of real-life traces collected in a large urban network. A succinct graph representation of this model allows us to devise an optimal (under our model) single-copy routing algorithm and then extend it to cases where several copies of the same data are permitted. Through an extensive simulation study, we compare the optimal routing algorithm with three other approaches: minimizing the expected traversal time over our graph, minimizing the number of hops a packet can travel, and a recently-proposed heuristic based on bus frequencies. Our optimal algorithm outperforms all of them, but most of the times it essentially reduces to minimizing the expected traversal time. For values of deadlines close to the expected delivery time, the multi-copy extension requires only 10 copies to reach almost the performance of the costly flooding approach. I
- …