Open Access. Powered by Scholars. Published by Universities.®
Articles 1 - 3 of 3
Full-Text Articles in Engineering
Heuristics For Capacity Allocation And Queue Assignment In Congested Service Systems With Stochastic Customer Demand And Immobile Servers, Adam Colley
Operations Research and Engineering Management
We propose easy-to-implement heuristics for a problem referred to in the literature as the facility location problem with immobile servers, stochastic demand, and congestion, or the service system design problem. The problem is typically posed as one of allocating capacity to a set of M/M/1 queues to which customers with stochastic demand are assigned with the objective of minimizing a cost function composed of a fixed capacity-acquisition cost, a variable customer-assignment cost, and an expected-waiting-time cost. The expected-waiting-time cost results in a non-linear term in the objective function of the standard binary programming formulation of the problem. Thus, the solution …
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 …