algorithm - Vehicle Routing with container compatibility -


i working on algorithm special type of routing problem. problem looks follows. given is:
-a set of containers n different types
-a set of trucks k different types
-a graph each node represents customer needs visited, nodes connected cost function represents time distances

further, have following constraints:
-matrix represents compatibility between truck , container types (for example, truck type t1 can carry containers of types c1, c3, c5... t2 can carry c4, c5, c7 , on)
-matrix represents compatibility between customers , orders (customer s1 has equipment work containers of type c2, c5, c6...)
-trucks can come terminal , change containers if needed

the goal visit customers in minimum amount of time.

do know similar problem in literature? think best approach solve this?

any appreciated.


Comments

Popular posts from this blog

authentication - Mongodb revoke acccess to connect test database -

r - Update two sets of radiobuttons reactively - shiny -

ios - Realm over CoreData should I use NSFetchedResultController or a Dictionary? -