Solution Representations and Local Search for the bi-objective Inventory Routing Problem

Details Solution Representations and Local Search for the bi-objective Inventory Routing Problem Solution Representations and Local Search for the bi-objective Inventory Routing Problem

2012-04-18

arxiv.org/abs/1204.4051v1

Computer Science

Artificial Intelligence

Proceedings of EU/ME 2012, Workshop on Metaheuristics for Global Challenges, May 10-11, 2012, Copenhagen, Denmark

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Solution Representations and Local Search for the bi-objective Inventory Routing Problem does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Solution Representations and Local Search for the bi-objective Inventory Routing Problem, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Solution Representations and Local Search for the bi-objective Inventory Routing Problem will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-411557