A memetic algorithm for the hub location-routing problem

Nathalie Bostel (1) , Mi Zhang (1) , Pierre Dejax (1)

1 IRCCyN - Institut de Recherche en Communications et en Cybernétique de Nantes

In many logistic systems for less than truckload (LTL) shipments, transportation of goods is made through collection/delivery tours to/from a hub. The design of such a logistic network corresponds to the Hub Location Routing Problem (HLRP). HLRP consists in locating hub facilities concentrating flows in order to take advantage of economies of scale and through which flows are to be routed from origins to destinations, and considers also both collection and distribution routes. We present a generic MIP formulation of this problem and a solution method based on a genetic algorithm improved by some local searches. Computational experiments are presented.

Mots clés: genetic algorithm; integer programming; Hub location-routing problem

Domaines: Recherche opérationnelle [math.OC]

Nathalie Bostel, Mi Zhang, Pierre Dejax. A memetic algorithm for the hub location-routing problem. EURO 2013 (European Conference on Operational Research), Jul 2013, Rome, Italy. ⟨hal-01085210⟩