Premium
PLANNING FOR TRUCK FLEET SIZE IN THE PRESENCE OF A COMMON‐CARRIER OPTION
Author(s) -
Ball M. O.,
Golden B. L.,
Assad A. A.,
Bodin L. D.
Publication year - 1983
Publication title -
decision sciences
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.238
H-Index - 108
eISSN - 1540-5915
pISSN - 0011-7315
DOI - 10.1111/j.1540-5915.1983.tb00172.x
Subject(s) - truck , fleet management , computer science , class (philosophy) , set (abstract data type) , service (business) , operations research , mathematical optimization , optimization problem , arc (geometry) , business , mathematics , telecommunications , engineering , automotive engineering , algorithm , geometry , marketing , artificial intelligence , programming language
This paper considers a class of network optimization problems in which certain directed arcs must be covered by a set of cycles. Our study was motivated by a distribution planning problem of a commercial firm that had to make deliveries over several origin‐destination pairs (directed arcs) and that could service any demand arc by using a vehicle in its own fleet or by paying a common carrier. The problem is to determine an optimal fleet size and the resulting vehicle routes while satisfying maximum route‐time restrictions. We formulate the problem, describe some approximate solution strategies, and discuss important implementation issues.