A memetic algorithm for the hub location-routing problemReport as inadecuate

A memetic algorithm for the hub location-routing problem - Download this document for free, or read online. Document in PDF available to download.

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

Abstract : 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.

Keywords : Hub location-routing problem integer programming genetic algorithm

Author: Nathalie Bostel - Mi Zhang - Pierre Dejax -

Source: https://hal.archives-ouvertes.fr/


Related documents