Documents
-
- Download
- YEB+16
- Not Applicable (or Unknown)
- open access
- Full text at publishers site
In Collections
This item can be found in the following collections:
Multi-objective inventory routing with uncertain demand using population-based metaheuristics
This article studies a tri-objective formulation of the inventory routing problem, extending the recently studied bi-objective formulation. As compared to distance cost and inventory cost, which were discussed in previous work, it also considers stockout cost as a third objective. Demand is modeled as a Poisson random variable. State-of-the-art evolutionary multi-objective optimization algorithms and a new method based on swarm intelligence are used to compute approximation of the 3-D Pareto front. A benchmark previously used in bi-objective inventory routing is extended by...
Show moreThis article studies a tri-objective formulation of the inventory routing problem, extending the recently studied bi-objective formulation. As compared to distance cost and inventory cost, which were discussed in previous work, it also considers stockout cost as a third objective. Demand is modeled as a Poisson random variable. State-of-the-art evolutionary multi-objective optimization algorithms and a new method based on swarm intelligence are used to compute approximation of the 3-D Pareto front. A benchmark previously used in bi-objective inventory routing is extended by incorporating a stochastic demand model with an expected value that equals the average demand of the original benchmark. The results provide insights into the shape of the optimal trade-off surface. Based on this the dependences between different objectives are clarified and discussed. Moreover, the performances of the four different algorithmic methods are compared and due to the consistency in the results, it can be concluded that a near optimal approximation to the Pareto front can be found for problems of practically relevant size.
Show less- All authors
- Yang, Z.; Emmerich, Michael T.M.; Bäck, T.H.W.; Kok, J.N.
- Date
- 2016-06-21
- Volume
- 23
- Issue
- 3
- Pages
- 205 - 220