135 research outputs found
Recommended from our members
Zero-one IP problems: Polyhedral descriptions & cutting plane procedures
A systematic way for tightening an IP formulation is by employing classes of linear inequalities that define facets of the convex hull of the feasible integer points of the respective problems. Describing as well as identifying these inequalities will help in the efficiency of the LP-based cutting plane methods. In this report, we review classes of inequalities that partially described zero-one poly topes such as the 0-1 knapsack polytope, the set packing polytope and the travelling salesman polytope. Facets or valid inequalities derived from the 0-1 knapsack and the set packing polytopes are algorithmically identifie
A new exact algorithm for the multi-depot vehicle routing problem under capacity and route length constraints
This article presents an exact algorithm for the multi-depot vehicle routing problem (MDVRP) under capacity and route length constraints. The MDVRP is formulated using a vehicle-flow and a set-partitioning formulation, both of which are exploited at different stages of the algorithm. The lower bound computed with the vehicle-flow formulation is used to eliminate non-promising edges, thus reducing the complexity of the pricing subproblem used to solve the set-partitioning formulation. Several classes of valid inequalities are added to strengthen both formulations, including a new family of valid inequalities used to forbid cycles of an arbitrary length. To validate our approach, we also consider the capacitated vehicle routing problem (CVRP) as a particular case of the MDVRP, and conduct extensive computational experiments on several instances from the literature to show its effectiveness. The computational results show that the proposed algorithm is competitive against stateof-the-art methods for these two classes of vehicle routing problems, and is able to solve to optimality some previously open instances. Moreover, for the instances that cannot be solved by the proposed algorithm, the final lower bounds prove stronger than those obtained by earlier methods
The Traveling Salesman Problem
This paper presents a self-contained introduction into algorithmic and computational aspects of the traveling salesman problem and of related problems, along with their theoretical prerequisites as seen from the point of view of an operations researcher who wants to solve practical problem instances. Extensive computational results are reported on most of the algorithms described. Optimal solutions are reported for instances with sizes up to several thousand nodes as well as heuristic solutions with provably very high quality for larger instances
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
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 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
Resource constrained shortest paths and extensions
In this thesis, we use integer programming techniques to solve the resource constrained shortest path problem (RCSPP) which seeks a minimum cost path between two nodes in a directed graph subject to a finite set of resource constraints. Although NP-hard, the RCSPP is extremely useful in practice and often appears as a subproblem in many decomposition schemes for difficult optimization problems.
We begin with a study of the RCSPP polytope for the single resource case and obtain several new valid inequality classes. Separation routines are provided, along with a polynomial time algorithm for constructing an auxiliary conflict graph which can be used to separate well known valid inequalities for the node packing polytope. We establish some facet defining conditions when the underlying graph is acyclic and develop a polynomial time sequential lifting algorithm which can be used to strengthen one of the inequality classes.
Next, we outline a branch-and-cut algorithm for the RCSPP. We present preprocessing techniques and branching schemes which lead to strengthened linear programming relaxations and balanced search trees, and the majority of the new inequality classes are generalized to consider multiple resources. We describe a primal heuristic scheme that uses fractional solutions, along with the current incumbent, to search for new feasible solutions throughout the branch-and-bound tree. A computational study is conducted to evaluate several implementation choices, and the results demonstrate that our algorithm outperforms the default branch-and-cut algorithm of a leading integer programming software package.
Finally, we consider the dial-a-flight problem (DAFP), a new vehicle routing problem that arises in the context of on-demand air transportation and is concerned with the scheduling of a set of travel requests for a single day of operations. The DAFP can be formulated as an integer multicommodity network flow model consisting of several RCSPPs linked together by set partitioning constraints which guarantee that all travel requests are satisfied. Therefore, we extend our branch-and-cut algorithm for the RCSPP to solve the DAFP. Computational experiments with practical instances provided by the DayJet Corporation verify that the extended algorithm also outperforms the default branch-and-cut algorithm of a leading integer programming software package.Ph.D.Committee Co-Chair: George L. Nemhauser; Committee Co-Chair: Shabbir Ahmed; Committee Member: Martin W. P. Savelsbergh; Committee Member: R. Gary Parker; Committee Member: Zonghao G
- …