2013
DOI: 10.1016/j.cie.2012.01.005
|View full text |Cite
|
Sign up to set email alerts
|

A hybrid discrete particle swarm optimization for vehicle routing problem with simultaneous pickup and delivery

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

1
108
0
6

Year Published

2014
2014
2024
2024

Publication Types

Select...
6
3

Relationship

0
9

Authors

Journals

citations
Cited by 233 publications
(115 citation statements)
references
References 44 publications
1
108
0
6
Order By: Relevance
“…Baños et al [16] introduced a hybrid meta-heuristic for multi-objective vehicle routing problems with time windows. To solve vehicle routing problem with simultaneous pickup and delivery, Goksal et al [17] described a hybrid discrete particle swarm optimization.…”
Section: Introductionmentioning
confidence: 99%
“…Baños et al [16] introduced a hybrid meta-heuristic for multi-objective vehicle routing problems with time windows. To solve vehicle routing problem with simultaneous pickup and delivery, Goksal et al [17] described a hybrid discrete particle swarm optimization.…”
Section: Introductionmentioning
confidence: 99%
“…At the same time, an annealing strategy was used to maintain the diversity of population. The effectiveness of the algorithm was verified by experiments, and the optimal solution was obtained by using the improved ant colony algorithm [27]. Combined with a real-life application, Goel and Gruhn [28] studied the rich VRP.…”
Section: Literature Reviewmentioning
confidence: 99%
“…To minimise the total cost, corresponding constraints were set and this model algorithm was used to solve various problem instances, which further verified the effectiveness of the algorithm [26]. In order to generate an effective solution way to fix the VRPSPD, which was known as an NP-hard problem, Goksal et al [27] proposed an approach which was a solution based on particle swarm optimisation algorithm. At the same time, an annealing strategy was used to maintain the diversity of population.…”
Section: Literature Reviewmentioning
confidence: 99%
“…In the literature, vehicle routing problems can be structured differently according to various constraints, such as capacitated VRP [120][121][122][123][124][125][126], the VRP with heterogeneous fleet of vehicles [127], open VRP [128][129][130][131], VRP with time windows [132][133][134][135][136][137][138], VPR with both pick-up and delivery [139][140][141][142][143][144], location routing problem [145][146][147], period VRP [148][149][150][151], multidepot VRP [152][153][154][155][156], VRP with backhaul [157][158][159], inventory routing problem [160][161][162][163], dynamic VRP [164], or the mixture [165][166]…”
Section: Vrpmentioning
confidence: 99%