NP-completeness of some problems concerning voting games
International Journal of Game Theory
A competitive local search heuristic for the subset sum problem
Computers and Operations Research
Computing Partitions with Applications to the Knapsack Problem
Journal of the ACM (JACM)
Approximate Algorithms for the 0/1 Knapsack Problem
Journal of the ACM (JACM)
Cryptography, a Primer
CIMMACS'09 Proceedings of the 8th WSEAS International Conference on Computational intelligence, man-machine systems and cybernetics
WSEAS Transactions on Information Science and Applications
Hi-index | 0.00 |
With the pressure to remain competitive, organizations are increasingly depending on third parties for support for logistical services like transportation, particularly for MRO items that involve a large number of items, each with small individual weights and a large number of suppliers. In order to cut costs, it is important to maximize vehicle utilization. In this paper we have addressed a case of an integrated steel plant that engages a third-party transporter for transportation of its MRO supplies. The problem here is to find a subset of suppliers so as to maximize the utilization of vehicle capacity which is used for carrying items with known weight. The mathematical formulation of the problem is similar to the traditional subset sum problem. We propose an exchange algorithm for finding a solution of the problem. The proposed exchange algorithm has a lower time complexity. Further, its quality of solutions is found to be superior to many currently available algorithms, when tested on a number of test problems given in the literature. The algorithm is also applied to maximize the utilization of the truck capacity for the aforementioned case of an integrated steel plant. When used for the data available from the case, the algorithm resulted in a very high level of utilization of the vehicle and thus huge savings in terms of costs.