Contributions to the k-color shortest path problem

• Autor(a) principal: Castelo, Emanuel Elias Silva
• Data de Publicação: 2023
• Tipo de documento: Dissertação
• Idioma: eng
• Título da fonte: Repositório Institucional da Universidade Federal do Ceará (UFC)
• dARK ID: ark:/83112/001300002pxfc
• Texto Completo: http://www.repositorio.ufc.br/handle/riufc/73496
• topic: Combinatorial optimization; k-color shortest path; Valid inequalities

Given a digraph D = (V,A), where all arcs (i, j) ∈ A have an associated cost d(i, j) ∈ R+ and a color c(i, j), a positive integer k, a source s, and a destination t, the k-Color Shortest Path Problem is an NP-Hard problem that consists in finding the shortest (s,t)-path in D while using at most k distinct colors. We propose valid inequalities for the problem that proved to strengthen the linear relaxation of an existing Integer Linear Programming formulation. An exponential set of valid inequalities defines a new formulation for the problem and is solved by using a branch-and-cut algorithm. We introduce more challenging instances of the problem and present numerical experiments for both benchmark and the new instances. Finally, we evaluate the individual and the collective use of the valid inequalities. Computational results for the proposed ideas and for existing solution approaches for the problem showed the effectiveness of the new inequalities in handling the new instances both in terms of execution times and improving their linear relaxed solutions.