A branch-and-cut approach for the vehicle routing problem with loading constraints
Pedro Hokama, Flávio K. Miyazawa, Eduardo C. Xavier
ARTIGO
Inglês
In this paper we describe a branch-and-cut algorithm for the vehicle routing problem with unloading constraints. The problem is to determine a set of routes with minimum total cost, each route leaving a depot, such that all clients are visited exactly onc
CONSELHO NACIONAL DE DESENVOLVIMENTO CIENTÍFICO E TECNOLÓGICO - CNPQ
306358/2014-0; 311499/2014-7; 477692/2012-5
COORDENAÇÃO DE APERFEIÇOAMENTO DE PESSOAL DE NÍVEL SUPERIOR - CAPES
FUNDAÇÃO DE AMPARO À PESQUISA DO ESTADO DE SÃO PAULO - FAPESP
2011/13382-3
Fechado
A branch-and-cut approach for the vehicle routing problem with loading constraints
Pedro Hokama, Flávio K. Miyazawa, Eduardo C. Xavier
A branch-and-cut approach for the vehicle routing problem with loading constraints
Pedro Hokama, Flávio K. Miyazawa, Eduardo C. Xavier
Fontes
|
Expert systems with applications (Fonte avulsa) |