A heuristic to solve the cardinality constrained lane covering problem. / Uma proposta de heurística para solução do problema de cobertura de rotas com cardinalidade restrita.

AUTOR(ES)
DATA DE PUBLICAÇÃO

2009

RESUMO

Cost and sustainability imperatives are compelling reasons to make companies to collaborate with each other in order to operate more efficiently. The shipper collaboration problem can be defined as how to identify tours (i.e. a closed path) in a set of lanes from various shippers that minimize truck repositioning (deadheads), as the sub-set of routes from a single shipper may have lanes that complement the routes of another shipper. Thus, combined shippers may offer to carriers a set of tours with regularly executed truckload movements (where the truck loads at a point and go directly to the disposal location) with minimum asset repositioning. This problem can be modeled as a particular case of the set covering formulation with constrained cycles, the cardinality constrained lane covering problem (CCLCP), which is NP-hard. This work resents an alternative heuristic that obtains results about 1.74% better than the existing literature, and solves larger instances. Besides, the heuristics execution time presents polynomial growth, unlike other methods that have exponential behavior.

ASSUNTO(S)

collaborative logistics logística (administração de materiais) pesquisa operacional heuristic lane covering heurística

ACESSO AO ARTIGO

Documentos Relacionados