A heuristic algorithm for optimal fleet composition with vehicle routing considerations. (3rd March 2016)

• Record Type: Journal Article
• Authors: Mardaneh, E.; Lin, Q.; Loxton, R.
• Is Part Of: Optimization methods and software. Volume 31:Number 2(2016)
• Page Start: 272
• Page End: 289
• Publication Date: 2016-03-03
• Subjects: fleet composition -- vehicle routing -- cross entropy -- dynamic programming -- golden section method; 90B06 -- 90B10 -- 90C11 -- 90C39; Mathematical optimization -- Periodicals; Algorithms -- Periodicals; 519.7
• DOI: 10.1080/10556788.2015.1062890
• Languages: English
• ISSNs: 1055-6788

Abstract

Abstract : This paper proposes a fast heuristic algorithm for solving a combined optimal fleet composition and multi-period vehicle routing problem. The aim of the problem is to determine an optimal fleet mix, together with the corresponding vehicle routes, to minimize total cost subject to various customer delivery requirements and vehicle capacity constraints. The total cost includes not only the fixed, variable, and transportation costs associated with operating the fleet, but also the hiring costs incurred whenever vehicle requirements exceed fleet capacity. Although the problem under consideration can be formulated as a mixed-integer linear program (MILP), the MILP formulation for realistic problem instances is too large to solve using standard commercial solvers such as the IBM ILOG CPLEX optimization tool. Our proposed heuristic decomposes the problem into two tractable stages: in the first (outer) stage, the vehicle routes are optimized using cross entropy; in the second (inner) stage, the optimal fleet mix corresponding to a fixed set of routes is determined using dynamic programming and golden section search. Numerical results show that this heuristic approach generates high-quality solutions and significantly outperforms CPLEX in terms of computational speed.