.png){kind=icon}
.png){kind=icon}
Return
Fleet optimization for cyclic inventory routing problems
.png){kind=icon}
PRE
AI
DOI：10.1016/j.ijpe.2014.10.006.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
This paper considers the optimization of a vehicle fleet to periodically repeat a given set of routes, whose frequencies can be adjusted if necessary. The objective is to minimize the overall cost rate, consisting of fixed vehicle costs, route-specific costs and holding costs at the customers being periodically replenished, where these latter two cost components depend on the selected frequency of the routes. First, this fleet design problem is formally described in a non-linear mathematical model, and a linear model is presented for the situation where frequencies are limited to a given set of values. Then, a multi-start two-phase heuristic solution method is proposed consisting of an insertion-based construction phase and a local search-based improvement phase. The performance of the solution approach and its capability in finding the appropriate cost trade-offs are shown in a design of experiments. (C) 2014 Elsevier B.V. All rights reserved.
Keywords:
Distribution
Fleet sizing
Inventory routing
Cyclic planning
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
10
Papers:
7.9K
Citations:
3.6W