Neither Left nor Rightmost Derivations
The main reason is that context-free grammars, once introduced, were quickly adapted to provide a theoretical basis for program language compilation.  For this usage, the goal is to parse as quickly as possible using as little storage as possible.  For that the best approach is to scan the input source once from 'left-to-right' [we interpret the source as a sequence of characters all on a single line], and be done with the parse exactly when done scanning the source.  Two derivation patterns naturally fit into this protocol: leftmost-first derivations performed top-down in forward order, and rightmost-first derivations performed bottom-up in reverse order.