Publicação

A branch-and-price algorithm for the vehicle routing problem with 2-dimensional loading constraints

Ver documento

Detalhes bibliográficos
Resumo:In this paper, we describe a branch-and-price algorithm for the capacitated vehicle routing problem with 2-dimensional loading constraints and a virtually unlimited number of vehicles. The column generation subproblem is solved heuristically through variable neighborhood search. Branch-and-price is used when it is not possible to add more attractive columns to the current restricted master problem, and the solution remains fractional. In order to accelerate the convergence of the algorithm, a family of valid dual inequalities is presented. Computational results are provided to evaluate the performance of the algorithm and to compare the different branching strategies proposed.
Autores principais:Pinto, Telmo
Outros Autores:Alves, Cláudio; Valério de Carvalho, José Manuel
Assunto:Branch-and-price Computational study Loading constraints Vehicle routing
Ano:2016
País:Portugal
Tipo de documento:comunicação em conferência
Tipo de acesso:acesso restrito
Instituição associada:Universidade do Minho
Idioma:inglês
Origem:RepositóriUM - Universidade do Minho

Registos relacionados

Registos relacionados