Elsevier

IFAC-PapersOnLine

Volume 50, Issue 1, July 2017, Pages 14668-14673
IFAC-PapersOnLine

Particle Swarm Optimization for Capacitated Location-Routing Problem

https://doi.org/10.1016/j.ifacol.2017.08.2495Get rights and content

Abstract

This paper proposes a particle swarm optimization algorithm to solve the capacitated location-routing problem(CLRP). A new encoding scheme is proposed to represent the solution of the CLRP. During the improvement procedure, several local search methods allow to improve the quality of each solution. Experiment tests are carried on some benchmark instances. Results show that our method is effective and simple.

Keywords

Location Routing Problem
Particle Swarm Optimization
Heuristic

Cited by (0)

View Abstract