Abstract
The Inventory Routing Problem is an important problem in logistics and known to belong to the class of NP hard problems. In the bicriteria inventory routing problem the goal is to simultaneously minimize distance cost and inventory costs. This paper is about the application of indicator-based evolutionary algorithms and swarm algorithms for finding an approximation to the Pareto front of this problem. We consider also robust vehicle routing as a tricriteria version of the problem.
Cite
CITATION STYLE
Yang, Z., Emmerich, M., Bäck, T., & Kok, J. (2015). Multicriteria inventory routing by cooperative swarms and evolutionary algorithms. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 9108, pp. 127–137). Springer Verlag. https://doi.org/10.1007/978-3-319-18833-1_14
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
