Correct predictions are in blue. If we detect only a subset of a labelled sentence, we highlight the caught part as blue, the missing part light blue. False positives are in green and false negatives are in red.

Problem VRP — Constraint detection

Let G = -LRB- V , A -RRB- be a graph where V = -LCB- 1 , ... , n -RCB- is a set of vertices representing cities with the depot located at vertex 1 , and A is the set of arcs . With every arc $ -LRB- i , j -RRB- , i \ neq j $ is associated a non-negative distance matrix C = -LRB- cii -RRB- . In some contexts , $ c _ -LCB- ij -RCB- $ can be interpreted as a travel cost or as a travel time . When C is symmetrical , it is often convenient to replace A by a set E of undirected edges . In addition , assume there are m available vehicles based at the depot , where $ m_L < m < m_U $ . When $ m_L = m_U $ , m is said to be fixed . When $ m_L = 1 $ and $ m_U = n - 1 $ , m is said to be free . When m is not fixed , it often makes sense to associate a fixed cost f on the use of a vehicle . For the sake of simplicity , we will ignore these costs and unless otherwise specified , we assume that all vehicles are identical and have the same capacity D . The VRP consists of designing a set of least-cost vehicle routes in such a way that : -LRB- i -RRB- each city in V \ -LCB- 1 -RCB- is visited exactly once by exactly one vehicle ; -LRB- ii -RRB- all vehicle routes start and end at the depot .

Problem VRP — Detection of the decisions and objects to be modeled

Let G = -LRB- V , A -RRB- be a graph where V = -LCB- 1 , ... , n -RCB- is a set of vertices representing cities with the depot located at vertex 1 , and A is the set of arcs . With every arc $ -LRB- i , j -RRB- , i \ neq j $ is associated a non-negative distance matrix C = -LRB- cii -RRB- . In some contexts , $ c _ -LCB- ij -RCB- $ can be interpreted as a travel cost or as a travel time . When C is symmetrical , it is often convenient to replace A by a set E of undirected edges . In addition , assume there are m available vehicles based at the depot , where $ m_L < m < m_U $ . When $ m_L = m_U $ , m is said to be fixed . When $ m_L = 1 $ and $ m_U = n - 1 $ , m is said to be free . When m is not fixed , it often makes sense to associate a fixed cost f on the use of a vehicle . For the sake of simplicity , we will ignore these costs and unless otherwise specified , we assume that all vehicles are identical and have the same capacity D . The VRP consists of designing a set of least-cost vehicle routes in such a way that : -LRB- i -RRB- each city in V \ -LCB- 1 -RCB- is visited exactly once by exactly one vehicle ; -LRB- ii -RRB- all vehicle routes start and end at the depot .

Back to list