A simple and effective evolutionary algorithm for the capacitated location–routing problem

• Published in: Computers & operations research Vol. 70; pp. 155 - 162
• Main Authors: Lopes, Rui Borges, Ferreira, Carlos, Santos, Beatriz Sousa
• Format: Journal Article
• Language: English
• Published: New York Elsevier Ltd 01.06.2016; Pergamon Press Inc
• Subjects: Algorithms; Benchmarking; Benchmarks; Computational efficiency; Effectiveness studies; Genetic algorithm; Genetic algorithms; Location; Location analysis; Location–routing; Mathematical problems; Mutations; Operations research; Route optimization; Searching; Location–routing; Genetic algorithm; Location
• ISSN: 0305-0548; 1873-765X; 0305-0548
• DOI: 10.1016/j.cor.2016.01.006

This paper proposes a hybrid genetic algorithm (GA) to solve the capacitated location–routing problem. The proposed algorithm follows the standard GA framework using local search procedures in the mutation phase. Computational evaluation was carried out on three sets of benchmark instances from the literature. Results show that, although relatively simple, the proposed algorithm is effective, providing competitive results for benchmark instances within reasonable computing time. •New chromosome representation and crossover operator for location–routing problems.•New evolutionary algorithm for solving the capacitated location–routing problem.•The proposed algorithm is able to obtain high quality results in short run times.