A metaheuristic for a two echelon location-routing problem

Authors:
Maurizio Boccia;Teodor G. Crainic;Antonio Sforza;Claudio Sterle
Affiliations:
Dept. of Engineering, Universitá del Sannio;Dept. Management et Technologie, Université du Québec á Montréal, and Centre for Research on Transportation, Montreal;Dept. of Computer Science and Systems, Universitá di Napoli “Federico II”;Dept. of Computer Science and Systems, Universitá di Napoli “Federico II”
Venue:
SEA'10 Proceedings of the 9th international conference on Experimental Algorithms
Year:
2010

Citing 3
Cited 3

Heuristic solutions to multi-depot location-routing problems

Computers and Operations Research
A compact model and tight bounds for a combined location-routing problem

Computers and Operations Research
A Metaheuristic to Solve a Location-Routing Problem with Non-Linear Costs

Journal of Heuristics

A multi-start iterated local search with tabu list and path relinking for the two-echelon location-routing problem

Engineering Applications of Artificial Intelligence
A variable neighborhood search approach for the two-echelon location-routing problem

EvoCOP'12 Proceedings of the 12th European conference on Evolutionary Computation in Combinatorial Optimization
Synchronization in Vehicle Routing---A Survey of VRPs with Multiple Synchronization Constraints

Transportation Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we consider the design problem of a two-echelon freight distribution system. The aim is to define the structure of a system optimizing the location and the number of two different kinds of facilities, the size of two different vehicle fleets and the related routes on each echelon. The problem has been modeled as a two-echelon location-routing problem (2E-LRP). A tabu-search heuristic efficiently combining the composing subproblems is presented. Results on small, medium and large size instances are reported.