This talk presents computational results that show the usefulness of the general-purpose valid inequalities disjunctive cuts when applied to the CVRP. Results indicate that the disjunctive cuts are able to reduce the gap between lower bound and upper bound more than state-of-the-art problem specific inequalities. Results also indicate that introducing the cuts leads to a smaller branch and bound tree and faster solution times overall.
|Publication status||Published - 2009|
|Event||Odysseus : International Workshop on Freight Transportation and Logistics - Cesme, Turkey|
Duration: 1 Jan 2009 → …
|Conference||Odysseus : International Workshop on Freight Transportation and Logistics|
|Period||01/01/2009 → …|