211 research outputs found
Plastic number and possible optimal solutions for an Euclidean 2-matching in one dimension
In this work we consider the problem of finding the minimum-weight loop cover
of an undirected graph. This combinatorial optimization problem is called
2-matching and can be seen as a relaxation of the traveling salesman problem
since one does not have the unique loop condition. We consider this problem
both on the complete bipartite and complete graph embedded in a one dimensional
interval, the weights being chosen as a convex function of the Euclidean
distance between each couple of points. Randomness is introduced throwing
independently and uniformly the points in space. We derive the average optimal
cost in the limit of large number of points. We prove that the possible
solutions are characterized by the presence of "shoelace" loops containing 2 or
3 points of each type in the complete bipartite case, and 3, 4 or 5 points in
the complete one. This gives rise to an exponential number of possible
solutions scaling as p^N , where p is the plastic constant. This is at variance
to what happens in the previously studied one-dimensional models such as the
matching and the traveling salesman problem, where for every instance of the
disorder there is only one possible solution.Comment: 19 pages, 5 figure
The family traveling salesman problem
Consider a depot, a partition of the set of nodes into subsets, called families, and a cost matrix. The objective of the family traveling salesman problem (FTSP) is to find the minimum cost circuit that starts and ends at the depot and visits a given number of nodes per family. The FTSP was motivated by the order picking problem in warehouses where products of the same type are stored in different places and it is a recent problem. Nevertheless, the FTSP is an extension of well-known problems, such as the traveling salesman problem.
Since the benchmark instances available are in small number we developed a generator, which given a cost matrix creates an FTSP instance with the same cost matrix. We generated several test instances that are available in a site dedicated to the FTSP.
We propose several mixed integer linear programming models for the FTSP. Additionally, we establish a theoretical and a practical comparison between them. Some of the proposed models have exponentially many constraints, therefore we developed a branch-and-cut (B&C) algorithm to solve them. With the B&C algorithm we were able to obtain the optimal value of open benchmark instances and of the majority of the generated instances.
As the FTSP is an NP-hard problem we develop three distinct heuristic methods: a genetic algorithm, an iterated local search algorithm and a hybrid algorithm. With all of them we were able to improve the best upper bounds available in the literature for the benchmark instances that still have an unknown optimal value.
We created a new variant of the FTSP, called the restricted family traveling salesman problem (RFTSP), in which nodes from the same family must be visited consecutively. We apply to the RFTSP the methods proposed for the FTSP and develop a new formulation based on the interfamily and the intrafamily relationship
A Branch-and-Cut based Pricer for the Capacitated Vehicle Routing Problem
openIl Capacitated Vehicle Routing Problem, abbreviato come CVRP, è un problema di ottimizzazione combinatoria d'instradamento nel quale, un insieme geograficamente sparso di clienti con richieste note deve essere servito da una flotta di veicoli stazionati in una struttura centrale.
Negli ultimi due decenni, tecniche di Column generation incorporate all'interno di frameworks branch-price-and-cut sono state infatti l'approccio stato dell'arte dominante per la costruzione di algoritmi esatti per il CVRP.
Il pricer, un componente critico nella column generation, deve risolvere il Pricing Problem (PP) che richiede la risoluzione di un Elementary Shortest Path Problem with Resource Constraints (ESPPRC) in una rete di costo ridotto.
Pochi sforzi scientifici sono stati dedicati allo studio di approcci branch-and-cut per affrontare il PP.
L'ESPPRC è stato tradizionalmente rilassato e risolto attraverso algoritmi di programmazione dinamica.
Questo approccio, tuttavia, ha due principali svantaggi.
Per cominciare, peggiora i dual bounds ottenuti.
Inoltre, il tempo di esecuzione diminuisce all'aumentare della lunghezza dei percorsi generati.
Per valutare la performance dei loro contributi, la comunità di ricerca operativa ha tradizionalmente utilizzato una serie d'istanze di test storiche e artificiali.
Tuttavia, queste istanze di benchmark non catturano le caratteristiche chiave dei moderni problemi di distribuzione del mondo reale, che sono tipicamente caratterizzati da lunghi percorsi.
In questa tesi sviluppiamo uno schema basato su un approccio branch-and-cut per risolvere il pricing problem.
Studiamo il comportamento e l'efficacia della nostra implementazione nel produrre percorsi più lunghi comparandola con soluzioni all'avanguardia basate su programmazione dinamica.
I nostri risultati suggeriscono che gli approcci branch-and-cut possono supplementare il tradizionale algoritmo di etichettatura, indicando che ulteriore ricerca in quest'area possa portare benefici ai risolutori CVRP.The Capacitated Vehicle Routing Problem, CVRP for short, is a combinatorial optimization routing problem in which, a geographically dispersed set of customers with known demands must be served by a fleet of vehicles stationed at a central facility.
Column generation techniques embedded within branch-price-and-cut frameworks have been the de facto state-of-the-art dominant approach for building exact algorithms for the CVRP over the last two decades.
The pricer, a critical component in column generation, must solve the Pricing Problem (PP), which asks for an Elementary Shortest Path Problem with Resource Constraints (ESPPRC) in a reduced-cost network.
Little scientific efforts have been dedicated to studying branch-and-cut based approaches for tackling the PP.
The ESPPRC has been traditionally relaxed and solved through dynamic programming algorithms.
This approach, however, has two major drawbacks.
For starters, it worsens the obtained dual bounds.
Furthermore, the running time degrades as the length of the generated routes increases.
To evaluate the performance of their contributions, the operations research community has traditionally used a set of historical and artificial test instances.
However, these benchmark instances do not capture the key characteristics of modern real-world distribution problems, which are usually characterized by longer routes.
In this thesis, we develop a scheme based on a branch-and-cut approach for solving the pricing problem.
We study the behavior and effectiveness of our implementation in producing longer routes by comparing it with state-of-the-art solutions based on dynamic programming.
Our results suggest that branch-and-cut approaches may supplement the traditional labeling algorithm, indicating that further research in this area may bring benefits to CVRP solvers
Combinatorial Path Planning for a System of Multiple Unmanned Vehicles
In this dissertation, the problem of planning the motion of m Unmanned Vehicles (UVs) (or simply vehicles) through n points in a plane is considered. A motion plan for a vehicle is given by the sequence of points and the corresponding angles at which each point must be visited by the vehicle. We require that each vehicle return to the same initial location(depot) at the same heading after visiting the points. The objective of the motion planning problem is to choose at most q(≤ m) UVs and find their motion plans so that all the points are visited and the total cost of the tours of the chosen vehicles is a minimum amongst all the possible choices of vehicles and their tours. This problem is a generalization of the wellknown Traveling Salesman Problem (TSP) in many ways: (1) each UV takes the role of salesman (2) motion constraints of the UVs play an important role in determining the cost of travel between any two locations; in fact, the cost of the travel between any two locations depends on direction of travel along with the heading at the origin and destination, and (3) there is an additional combinatorial complexity stemming from the need to partition the points to be visited by each UV and the set of UVs that must be employed by the mission.
In this dissertation, a sub-optimal, two-step approach to motion planning is presented to solve this problem:(1) the combinatorial problem of choosing the vehicles and their associated tours is based on Euclidean distances between points and (2) once the sequence of points to be visited is specified, the heading at each point is determined based on a Dynamic Programming scheme. The solution to the first step is based on a generalization of Held-Karp’s method. We modify the Lagrangian heuristics for finding a close sub-optimal solution.
In the later chapters of the dissertation, we relax the assumption that all vehicles are homogenous. The motivation of heterogenous variant of Multi-depot, Multiple Traveling Salesmen Problem (MDMTSP) derives form applications involving Unmanned Aerial Vehicles (UAVs) or ground robots requiring multiple vehicles with different capabilities to visit a set of locations
A New Multicommodity Flow Model for the Job Sequencing and Tool Switching Problem
Artigo cientÃfico.In this paper a new multicommodity flow mathematical model for the Job Sequencing and Tool Switching Problem (SSP) is presented. The proposed model has a LP relaxation lower bound equal to the number of tools minus the tool machine’s capacity. Computational tests were performed comparing the new model with the models of the literature. The proposed model performed better, both in execution time and in the number of instances solved to optimality.Coordenação de Aperfeiçoamento de Pessoal de NÃvel Superior (CAPES
Traveling Salesman Problem
This book is a collection of current research in the application of evolutionary algorithms and other optimal algorithms to solving the TSP problem. It brings together researchers with applications in Artificial Immune Systems, Genetic Algorithms, Neural Networks and Differential Evolution Algorithm. Hybrid systems, like Fuzzy Maps, Chaotic Maps and Parallelized TSP are also presented. Most importantly, this book presents both theoretical as well as practical applications of TSP, which will be a vital tool for researchers and graduate entry students in the field of applied Mathematics, Computing Science and Engineering
Formulation and a two-phase matheuristic for the roaming salesman problem: Application to election logistics
In this paper we investigate a novel logistical problem. The goal is to determine daily tours for a traveling salesperson who collects rewards from activities in cities during a fixed campaign period. We refer to this problem as the Roaming Salesman Problem (RSP) motivated by real-world applications including election logistics, touristic trip planning and marketing campaigns. RSP can be characterized as a combination of the traditional Periodic TSP and the Prize-Collecting TSP with static arc costs and time-dependent node rewards. Commercial solvers are capable of solving small-size instances of the RSP to near optimality in a reasonable time. To tackle large-size instances we propose a two-phase matheuristic where the first phase deals with city selection while the second phase focuses on route generation. The latter capitalizes on an integer program to construct an optimal route among selected cities on a given day. The proposed matheuristic decomposes the RSP into as many subproblems as the number of campaign days. Computational results show that our approach provides near-optimal solutions in significantly shorter times compared to commercial solvers
Routing Optimization Under Uncertainty
We consider a class of routing optimization problems under uncertainty in which all decisions are made before the uncertainty is realized. The objective is to obtain optimal routing solutions that would, as much as possible, adhere to a set of specified requirements after the uncertainty is realized. These problems include finding an optimal routing solution to meet the soft time window requirements at a subset of nodes when the travel time is uncertain, and sending multiple capacitated vehicles to different nodes to meet the customers’ uncertain demands. We introduce a precise mathematical framework for defining and solving such routing problems. In particular, we propose a new decision criterion, called the Requirements Violation (RV) Index, which quantifies the risk associated with the violation of requirements taking into account both the frequency of violations and their magnitudes whenever they occur. The criterion can handle instances when probability distributions are known, and ambiguity when distributions are partially characterized through descriptive statistics such as moments. We develop practically efficient algorithms involving Benders decomposition to find the exact optimal routing solution in which the RV Index criterion is minimized, and we give numerical results from several computational studies that show the attractive performance of the solutions
Quadratic set covering problem
Issued as Annual report, and Final report, Project no. E-24-61
- …