An Integrated Model and Solution Approach for Fleet Sizing with Heterogeneous Assets

Authors:
Peiling Wu;Joseph C. Hartman;George R. Wilson
Affiliations:
Industrial and Systems Engineering Department, Lehigh University, Mohler Lab, 200 W. Packer Avenue, Bethlehem, Pennsylvania 18015;Industrial and Systems Engineering Department, Lehigh University, Mohler Lab, 200 W. Packer Avenue, Bethlehem, Pennsylvania 18015;Industrial and Systems Engineering Department, Lehigh University, Mohler Lab, 200 W. Packer Avenue, Bethlehem, Pennsylvania 18015
Venue:
Transportation Science
Year:
2005

Citing 3
Cited 4

Static and dynamic time-space strategic models and algorithms for multilevel rail-car fleet management

Management Science
Dynamic Control of Logistics Queueing Networks for Large-Scale Fleet Management

Transportation Science
Solving the Uncapacitated Network Design Problem by a Lagrangean Heuristic and Branch-And-Bound

Operations Research

On determining optimal fleet size and vehicle transfer policy for a car rental company

Computers and Operations Research
The Uncapacitated Time-Space Fixed-Charge Network Flow Problem: An Empirical Investigation of Procedures for Arc Capacity Assignment

INFORMS Journal on Computing
Review: Industrial aspects and literature survey: Fleet composition and routing

Computers and Operations Research
Using simulated annealing for determination of the capacity of yard stations in a railway industry

Applied Soft Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper addresses a fleet-sizing problem in the context of the truck-rental industry. Specifically, trucks that vary in capacity and age are utilized over space and time to meet customer demand. Operational decisions (including demand allocation and empty truck repositioning) and tactical decisions (including asset procurements and sales) are explicitly examined in a linear programming model to determine the optimal fleet size and mix. The method uses a time-space network, common to fleet-management problems, but also includes capital cost decisions, wherein assets of different ages carry different costs, as is common to replacement analysis problems. A two-phase solution approach is developed to solve large-scale instances of the problem. Phase I allocates customer demand among assets through Benders decomposition with a demand-shifting algorithm assuring feasibility in each subproblem. Phase II uses the initial bounds and dual variables from Phase I and further improves the solution convergence without increasing computer memory requirements through the use of Lagrangian relaxation. Computational studies are presented to show the effectiveness of the approach for solving large problems within reasonable solution gaps.