2018
DOI: 10.1108/ijicc-03-2017-0023
|View full text |Cite
|
Sign up to set email alerts
|

A hybrid particle swarm optimization algorithm for the capacitated location routing problem

Abstract: Purpose The purpose of this paper is to solve the capacitated location routing problem (CLRP), which is an NP-hard problem that involves making strategic decisions as well as tactical and operational decisions, using a hybrid particle swarm optimization (PSO) algorithm. Design/methodology/approach PSO, which is a population-based metaheuristic, is combined with a variable neighborhood strategy variable neighborhood search to solve the CLRP. Findings The algorithm is tested on a set of instances available i… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
9
0

Year Published

2018
2018
2024
2024

Publication Types

Select...
8
1

Relationship

1
8

Authors

Journals

citations
Cited by 14 publications
(9 citation statements)
references
References 39 publications
0
9
0
Order By: Relevance
“…The historical optimal position of the particle is P r = P r1 , P r2 , …, P rd T , and the optimal location of the population is G = g 1 , g 2 , …, g d T . The velocity and position of the particles are updated as follows [28].…”
Section: Hybrid Optimisation Algorithmmentioning
confidence: 99%
“…The historical optimal position of the particle is P r = P r1 , P r2 , …, P rd T , and the optimal location of the population is G = g 1 , g 2 , …, g d T . The velocity and position of the particles are updated as follows [28].…”
Section: Hybrid Optimisation Algorithmmentioning
confidence: 99%
“…Some authors proposed PSO that was combined with a variable neighborhood strategy to solve the capacitated location-routing problem, the presented algorithm, improve local search and the time-consuming problem of hybrid PSO algorithms. A set of appropriate neighborhoods for the solution was used in the proposed PSO algorithm at the VNS stage (Kechmane et al , 2018).…”
Section: Literature Reviewmentioning
confidence: 99%
“…Constraints (13) and (14) guarantee that each customer is visited by one vehicle at most per period. Constraints (15) ensure that each vehicle performs one route per period at the most.…”
Section: Problem Description and Mathematical Formulationmentioning
confidence: 99%
“…The LRP consists in determining the optimal number of facilities, their location, allocation of customers to the open facilities, and the vehicle routing organization. This problem has been studied by many researchers such as Prins et al [8], Prins et al [9], Duhamel et al [10], Benlenger [11], Baldacci et al [12], Ting et al [13], Contardo et al [14], and Kechmane et al [15]. A recent survey on this problem is presented by Prodhon [16].…”
Section: Introductionmentioning
confidence: 99%