Open Access. Powered by Scholars. Published by Universities.®
Articles 1 - 2 of 2
Full-Text Articles in Engineering
Backhaul Profit Maximization Problem Instances, Yuanyuan Dong, Yulan Bai, Eli V. Olinick, Andrew Junfang Yu
Backhaul Profit Maximization Problem Instances, Yuanyuan Dong, Yulan Bai, Eli V. Olinick, Andrew Junfang Yu
Operations Research and Engineering Management
This archive contains data for the problem instances described in the technical report "An Empirical Study of Mixed Integer Programming Formulations of the Backhaul Profit Maximization Problem" by Yulan Bai and Eli V. Olinick.
An Empirical Study Of Mixed Integer Programming Formulations Of The Backhaul Profit Maximization Problem, Yulan Bai, Eli V. Olinick
An Empirical Study Of Mixed Integer Programming Formulations Of The Backhaul Profit Maximization Problem, Yulan Bai, Eli V. Olinick
Operations Research and Engineering Management
Solving an instance of the Backhaul Profit Maximization Problem (BPMP) 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 delivery requests between various locations on the route subject to the vehicle's capacity. We propose and test a series of enhancements to the node-arc and triples mixed integer programming formulations of BPMP found in the literature and develop a multi-criteria Composite Index Method (CIM) to evaluate the results. We find that CPLEX takes 5 to 34 …