Practical and Effective Heuristics for the Backhaul Profit Maximization Problem
The backhaul profit maximization problem (BPMP), which is known to be NP-hard, requires simultaneously solving two problems: (1) determining how to route an empty delivery vehicle back from its current location to its depot by a scheduled arrival time, and (2) selecting a profit-maximizing subset of spot-market deliver...
Lam Tran, Daniel Ryan, E. Olinick et al.
· IISE Annual Conference &... · 0 citations