Lane Covering
Mostrando 1-2 de 2 artigos, teses e dissertações.
-
1. 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.
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
Publicado em: 2009
-
2. Grupo de tranças e espaços de configurações
In this work, we study the Artin braid group, B(n), and the confguration spaces (ordered and unordered) of a path connected manifold of dimension 2. The fundamental group of confguration space (unordered) of IR2 is identifed with the Artin braid group. This identifcation is used to conclude that the confguration space of IR2 is an Eilenberg-MacLane space of
Publicado em: 2007