106 research outputs found
Search in the Universe of Big Networks and Data
Searching in the Internet for some object characterised by its attributes in
the form of data, such as a hotel in a certain city whose price is less than
something, is one of our most common activities when we access the Web. We
discuss this problem in a general setting, and compute the average amount of
time and the energy it takes to find an object in an infinitely large search
space. We consider the use of N search agents which act concurrently. Both the
case where the search agent knows which way it needs to go to find the object,
and the case where the search agent is perfectly ignorant and may even head
away from the object being sought. We show that under mild conditions regarding
the randomness of the search and the use of a time-out, the search agent will
always find the object despite the fact that the search space is infinite. We
obtain a formula for the average search time and the average energy expended by
N search agents acting concurrently and independently of each other. We see
that the time-out itself can be used to minimise the search time and the amount
of energy that is consumed to find an object. An approximate formula is derived
for the number of search agents that can help us guarantee that an object is
found in a given time, and we discuss how the competition between search agents
and other agents that try to hide the data object, can be used by opposing
parties to guarantee their own success.Comment: IEEE Network Magazine - Special Issue on Networking for Big Data,
July-August 201
Very Large-Scale Neighborhoods with Performance Guarantees for Minimizing Makespan on Parallel Machines
We study the problem of minimizing the makespan on m parallel machines. We introduce a very large-scale neighborhood of exponential size (in the number of machines) that is based on a matching in a complete graph. The idea is to partition the jobs assigned to the same machine into two sets. This partitioning is done for every machine with some chosen rule to receive 2m parts. A new assignment is received by putting to every machine exactly two parts. The neighborhood Nsplit consists of all possible rearrangements of the parts to the machines. The best assignment of Nsplit can be calculated in time O(mlogm) by determining the perfect matching having minimum maximal edge weight in an improvement graph, where the vertices correspond to parts and the weights on the edges correspond to the sum of the processing times of the jobs belonging to the parts. Additionally, we examine local optima in this neighborhood and in combinations with other neighborhoods. We derive performance guarantees for these local optima
Very large-scale neighborhoods with performance guarantees for minimizing makespan on parallel machines
We study the problem of minimizing the makespan on m parallel machines. We introduce a very large-scale neighborhood of exponential size (in the number of machines) that is based on a matching in a complete graph. The idea is to partition the jobs assigned to the same machine into two sets. This partitioning is done for every machine with some chosen rule to receive 2m parts. A new assignment is received by putting to every machine exactly two parts. The neighborhood Nsplit consists of all possible rearrangements of the parts to the machines. The best assignment of Nsplit can be calculated in time O(mlogm) by determining the perfect matching having minimum maximal edge weight in an improvement graph, where the vertices correspond to parts and the weights on the edges correspond to the sum of the processing times of the jobs belonging to the parts. Additionally, we examine local optima in this neighborhood and in combinations with other neighborhoods. We derive performance guarantees for these local optima.operations research and management science;
A General Large Neighborhood Search Framework for Solving Integer Programs
This paper studies how to design abstractions of large-scale combinatorial optimization problems that can leverage existing state-of-the-art solvers in general purpose ways, and that are amenable to data-driven design. The goal is to arrive at new approaches that can reliably outperform existing solvers in wall-clock time. We focus on solving integer programs, and ground our approach in the large neighborhood search (LNS) paradigm, which iteratively chooses a subset of variables to optimize while leaving the remainder fixed. The appeal of LNS is that it can easily use any existing solver as a subroutine, and thus can inherit the benefits of carefully engineered heuristic approaches and their software implementations. We also show that one can learn a good neighborhood selector from training data. Through an extensive empirical validation, we demonstrate that our LNS framework can significantly outperform, in wall-clock time, compared to state-of-the-art commercial solvers such as Gurobi
Two exponential neighborhoods for single machine scheduling
We study the problem of minimizing total completion time on a single machine with the presence of release dates. We present two different approaches leading to exponential neighborhoods in which the best improving neighbor can be determined in polynomial time. Furthermore, computational results are presented to get insight in the performance of the developed neighborhoods
- …