The solution of the biobjective IRP is rather challenging, even for metaheuristics. We are still lacking a profound understanding of appropriate solution representations and effective neighborhood structures. Clearly, both the delivery volumes and the routing aspects of the alternatives need to be reflected in an encoding, and must be modified when searching by means of local search. Our work contributes to the better understanding of such solution representations. On the basis of an experimental investigation, the advantages and drawbacks of two encodings are studied and compared.
Cite
@article{arxiv.1204.4051,
title = {Solution Representations and Local Search for the bi-objective Inventory Routing Problem},
author = {Thibaut Barthélemy and Martin Josef Geiger and Marc Sevaux},
journal= {arXiv preprint arXiv:1204.4051},
year = {2012}
}
Comments
Proceedings of EU/ME 2012, Workshop on Metaheuristics for Global Challenges, May 10-11, 2012, Copenhagen, Denmark