Genetic algorithm with iterated local search for solving a location-routing problem

Authors:
Houda Derbel;Bassem Jarboui;Saïd Hanafi;Habib Chabchoub
Affiliations:
FSEGS, Route de l'aéroport km 4, Sfax 3018, Tunisia;FSEGS, Route de l'aéroport km 4, Sfax 3018, Tunisia;LAMIH, Université de Valenciennes et du Hainaut-Cambrésis, France;FSEGS, Route de l'aéroport km 4, Sfax 3018, Tunisia
Venue:
Expert Systems with Applications: An International Journal
Year:
2012

Citing 11
Cited 2

A genetic algorithm for flowshop sequencing

Computers and Operations Research - Special issue on genetic algorithms
Heuristic solutions to multi-depot location-routing problems

Computers and Operations Research
A genetic algorithm for the vehicle routing problem

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

Computers and Operations Research
A hybrid genetic algorithm for the multi-depot vehicle routing problem

Engineering Applications of Artificial Intelligence
Applying hybrid meta-heuristics for capacitated vehicle routing problem

Expert Systems with Applications: An International Journal
Solving the Capacitated Location-Routing Problem by a Cooperative Lagrangean Relaxation-Granular Tabu Search Heuristic

Transportation Science
Iterated variable neighborhood descent algorithm for the capacitated vehicle routing problem

Expert Systems with Applications: An International Journal
Hybrid genetic algorithm for multi-time period production/distribution planning

Computers and Industrial Engineering - Special issue: Selected papers from the 30th international conference on computers; industrial engineering
A simulated annealing heuristic for the capacitated location routing problem

Computers and Industrial Engineering
A GRASP×ELS approach for the capacitated location-routing problem

Computers and Operations Research

On neighborhood tree search

Proceedings of the 14th annual conference on Genetic and evolutionary computation
Capacitated location-routing problem with time windows under uncertainty

Knowledge-Based Systems

Quantified Score

Hi-index	12.05

Visualization

Abstract

This paper deals with a location routing problem with multiple capacitated depots and one uncapacitated vehicle per depot. We seek for new methods to make location and routing decisions simultaneously and efficiently. For that purpose, we describe a genetic algorithm (GA) combined with an iterative local search (ILS). The main idea behind our hybridization is to improve the solutions generated by the GA using a ILS to intensify the search space. Numerical experiments show that our hybrid algorithm improves, for all instances, the best known solutions previously obtained by the tabu search heuristic.