789 research outputs found
Restricted Dynamic Programming Heuristic for Precedence Constrained Bottleneck Generalized TSP
We develop a restricted dynamical programming heuristic for a complicated traveling salesman problem: a) cities are grouped into clusters, resp. Generalized TSP; b) precedence constraints are imposed on the order of visiting the clusters, resp. Precedence Constrained TSP; c) the costs of moving to the next cluster and doing the required job inside one are aggregated in a minimax manner, resp. Bottleneck TSP; d) all the costs may depend on the sequence of previously visited clusters, resp. Sequence-Dependent TSP or Time Dependent TSP. Such multiplicity of constraints complicates the use of mixed integer-linear programming, while dynamic programming (DP) benefits from them; the latter may be supplemented with a branch-and-bound strategy, which necessitates a āDP-compliantā heuristic. The proposed heuristic always yields a feasible solution, which is not always the case with heuristics, and its precision may be tuned until it becomes the exact DP
Offline and online variants of the Traveling Salesman Problem
In this thesis, we study several well-motivated variants of the Traveling Salesman Problem (TSP). First, we consider makespan minimization for vehicle scheduling problems on trees with release and handling times. 2-approximation algorithms were known for several variants of the single vehicle problem on a path. A 3/2-approximation algorithm was known for the single vehicle problem on a path where there is a fixed starting point and the vehicle must return to the starting point upon completion. Karuno, Nagamochi and Ibaraki give a 2-approximation algorithm for the single vehicle problem on trees. We develop a Polynomial Time Approximation Scheme (PTAS) for the single vehicle scheduling problem on trees which have a constant number of leaves. This PTAS can be easily adapted to accommodate various starting/ending constraints. We then extended this to a PTAS for the multiple vehicle problem where vehicles operate in disjoint subtrees. We also present competitive online algorithms for some single vehicle scheduling problems. Secondly, we study a class of problems called the Online Packet TSP Class (OP-TSP-CLASS). It is based on the online TSP with a packet of requests known and available for scheduling at any given time. We provide a 5/3 lower bound on any online algorithm for problems in OP-TSP-CLASS. We extend this result to the related k-reordering problem for which a 3/2 lower bound was known. We develop a Īŗ+1-competitive algorithm for problems in OP-TSP-CLASS, where a Īŗ-approximation algorithm is known for the offline version of that problem. We use this result to develop an offline m(Īŗ+1)-approximation algorithm for the Precedence-Constrained TSP (PCTSP) by segmenting the n requests into m packets. Its running time is mf(n/m) given a Īŗ-approximation algorithm for the offline version whose running time is f(n)
Determine the Optimal Sequence-Dependent Completion Times for Multiple Demand with Multi-Products Using Genetic Algorithm
Sequencing is the most impact factor on the total completion time , the products sequences inside demands that consist from muti-product and for multiple demands . It is very important in assembly line and batch production . The most important drawback of existing methods used to solve the sequencing problems is the sequence must has a few products and dependent completion time for single demand . In this paper we used genetic algorithm ābased Travelling Salesman Problem with Precedence Constraints Approach ( TSPPCA)Ā to minimize completion time . The main advantage of this new method , it is used to solve the sequencing problems for multiple demand with multi-product In this paper , we compare between modify the assignment method ( MAM ) and genetic algorithmĀ depend on least completion time , the results discern thatĀ Ā GA Ā has minimum completion time Keywords: products sequences , completion time , travel salesman problem (TSP ) , TSPPCA , genetic algorithm.Ā
Recommended from our members
Centralized versus market-based approaches to mobile task allocation problem: State-of-the-art
Centralized approach has been adopted for finding solutions to resource allocation problems (RAPs) in many real-life applications. On the other hand, market-based approach has been proposed as an alternative to solve the problem due to recent advancement in ICT technologies. In spite of the existence of some efforts to review the pros and cons of each approach in RAPs, the studies cannot be directly applied to specific problem domains like mobile task allocation problem which is characterised with high level of uncertainty on the availability of resources (workers). This paper aims to review existing studies on task allocation problems(TAPs) focusing on those two approaches and their comparison and identify major issues that need to be resolved for comparing the two approaches in mobile task allocation problems. Mobile Task Allocation Problem (MTAP) is defined and its problematic structures are explained in relation with task allocation to mobile workers. Solutions produced by each approach to some applications and variations of MTAP are also discussed and compared. Finally, some future research directions are identified in order to compare both approaches in function of uncertainty emerging from the mobile nature of the MTAP
Exploring Graphs with Time Constraints by Unreliable Collections of Mobile Robots
A graph environment must be explored by a collection of mobile robots. Some
of the robots, a priori unknown, may turn out to be unreliable. The graph is
weighted and each node is assigned a deadline. The exploration is successful if
each node of the graph is visited before its deadline by a reliable robot. The
edge weight corresponds to the time needed by a robot to traverse the edge.
Given the number of robots which may crash, is it possible to design an
algorithm, which will always guarantee the exploration, independently of the
choice of the subset of unreliable robots by the adversary? We find the optimal
time, during which the graph may be explored. Our approach permits to find the
maximal number of robots, which may turn out to be unreliable, and the graph is
still guaranteed to be explored.
We concentrate on line graphs and rings, for which we give positive results.
We start with the case of the collections involving only reliable robots. We
give algorithms finding optimal times needed for exploration when the robots
are assigned to fixed initial positions as well as when such starting positions
may be determined by the algorithm. We extend our consideration to the case
when some number of robots may be unreliable. Our most surprising result is
that solving the line exploration problem with robots at given positions, which
may involve crash-faulty ones, is NP-hard. The same problem has polynomial
solutions for a ring and for the case when the initial robots' positions on the
line are arbitrary.
The exploration problem is shown to be NP-hard for star graphs, even when the
team consists of only two reliable robots
The bi-objective travelling salesman problem with profits and its connection to computer networks.
This is an interdisciplinary work in Computer Science and Operational Research. As it is
well known, these two very important research fields are strictly connected. Among other
aspects, one of the main areas where this interplay is strongly evident is Networking. As far
as most recent decades have seen a constant growing of every kind of network computer connections,
the need for advanced algorithms that help in optimizing the network performances
became extremely relevant. Classical Optimization-based approaches have been deeply studied
and applied since long time. However, the technology evolution asks for more flexible and
advanced algorithmic approaches to model increasingly complex network configurations. In
this thesis we study an extension of the well known Traveling Salesman Problem (TSP): the
Traveling Salesman Problem with Profits (TSPP). In this generalization, a profit is associated
with each vertex and it is not necessary to visit all vertices. The goal is to determine
a route through a subset of nodes that simultaneously minimizes the travel cost and maximizes
the collected profit. The TSPP models the problem of sending a piece of information
through a network where, in addition to the sending costs, it is also important to consider
what āprofitā this information can get during its routing. Because of its formulation, the
right way to tackled the TSPP is by Multiobjective Optimization algorithms. Within this
context, the aim of this work is to study new ways to solve the problem in both the exact
and the approximated settings, giving all feasible instruments that can help to solve it, and
to provide experimental insights into feasible networking instances
- ā¦