354 research outputs found
Heuristics for the traveling repairman problem with profits
In the traveling repairman problem with profits, a repairman (also known as the server) visits a subset of nodes in order to collect time-dependent profits. The objective consists of maximizing the total collected revenue. We restrict our study to the case of a single server with nodes located in the Euclidean plane. We investigate properties of this problem, and we derive a mathematical model assuming that the number of visited nodes is known in advance. We describe a tabu search algorithm with multiple neighborhoods, and we test its performance by running it on instances based on TSPLIB. We conclude that the tabu search algorithm finds good-quality solutions fast, even for large instances
The Vehicle Routing Problem with Service Level Constraints
We consider a vehicle routing problem which seeks to minimize cost subject to
service level constraints on several groups of deliveries. This problem
captures some essential challenges faced by a logistics provider which operates
transportation services for a limited number of partners and should respect
contractual obligations on service levels. The problem also generalizes several
important classes of vehicle routing problems with profits. To solve it, we
propose a compact mathematical formulation, a branch-and-price algorithm, and a
hybrid genetic algorithm with population management, which relies on
problem-tailored solution representation, crossover and local search operators,
as well as an adaptive penalization mechanism establishing a good balance
between service levels and costs. Our computational experiments show that the
proposed heuristic returns very high-quality solutions for this difficult
problem, matches all optimal solutions found for small and medium-scale
benchmark instances, and improves upon existing algorithms for two important
special cases: the vehicle routing problem with private fleet and common
carrier, and the capacitated profitable tour problem. The branch-and-price
algorithm also produces new optimal solutions for all three problems
FIXED RATIO POLYNOMIAL TIME APPROXIMATION ALGORITHM FOR THE PRIZE-COLLECTING ASYMMETRIC TRAVELING SALESMAN PROBLEM
We develop the first fixed-ratio approximation algorithm for the well-known Prize-Collecting Asymmetric Traveling Salesman Problem, which has numerous valuable applications in operations research. An instance of this problem is given by a complete node- and edge-weighted digraph . Each node of the graph can either be visited by the resulting route or skipped, for some penalty, while the arcs of are weighted by non-negative transportation costs that fulfill the triangle inequality constraint. The goal is to find a closed walk that minimizes the total transportation costs augmented by the accumulated penalties. We show that an arbitrary -approximation algorithm for the Asymmetric Traveling Salesman Problem induces an -approximation for the problem in question. In particular, using the recent -approximation algorithm of V. Traub and J. Vygen that improves the seminal result of O. Svensson, J. Tarnavski, and L. Végh, we obtain -approximate solutions for the problem
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
The Position-Aware-Market: Optimizing Freight Delivery for Less-Than-Truckload Transportation
The increasing competition faced by logistics carriers requires them to ship at lower cost and higher efficiency. In reality, however, many trucks are running empty or with a partial load. Bridging such residual capacity with real time transportation demand enhances the efficiency of the carriers. We therefore introduce the Position-Aware-Market (PAM), where transportation requests are traded in real time to utilize transportation capacities optimally. In this paper we mainly focus on the decision support system for the truck driver, which solves a profit- maximizing Pickup and Delivery Problem with Time Windows (PM-PDPTW). We propose a novel Recursive Branch-and-Bound algorithm that solves the problem optimally, and apply it to a Tabu-Search heuristic for larger problem instances. Simulations show that problems with up to 50 requests can be solved optimally within seconds. Larger problems with 200 requests can be solved approximately by Tabu-Search in seconds, retaining 60% of the optimal profit
A Swarm of Salesmen: Algorithmic Approaches to Multiagent Modeling
This honors thesis describes the algorithmic abstraction of a problem modeling a swarm of Mars rovers, where many agents must together achieve a goal. The algorithmic formulation of this problem is based on the traveling salesman problem (TSP), and so in this thesis I offer a review of the mathematical technique of linear programming in the context of its application to the TSP, an overview of some variations of the TSP and algorithms for approximating and solving them, and formulations without solutions of two novel TSP variations which are useful for modeling the original problem
The Time-Dependent Multiple-Vehicle Prize-Collecting Arc Routing Problem
In this paper, we introduce a multi vehicle version of the Time-Dependent Prize-Collecting Arc Routing Problem (TD-MPARP). It is inspired by a situation where a transport manager has to choose between a number of full truck load pick-ups and deliveries to be performed by a fleet of vehicles. Real-life traffic situations where the travel times change with the time of day are taken into account. Two metaheuristic algorithms, one based on Variable Neighborhood Search and one based on Tabu Search, are proposed and tested for a set of benchmark problems, generated from real road networks and travel time information. Both algorithms are capable of finding good solutions, though the Tabu Search approach generally shows better performance for large instances whereas the VNS is superior for small instances. We discuss the structural differences of the implementation of the algorithms which explain these results
A Swarm of Salesmen: Algorithmic Approaches to Multiagent Modeling
This honors thesis describes the algorithmic abstraction of a problem modeling a swarm of Mars rovers, where many agents must together achieve a goal. The algorithmic formulation of this problem is based on the traveling salesman problem (TSP), and so in this thesis I offer a review of the mathematical technique of linear programming in the context of its application to the TSP, an overview of some variations of the TSP and algorithms for approximating and solving them, and formulations without solutions of two novel TSP variations which are useful for modeling the original problem
- …