2019 International Conference on Sustainable Information Engineering and Technology (SIET) 2019
DOI: 10.1109/siet48054.2019.8986006
|View full text |Cite
|
Sign up to set email alerts
|

Hybrid Particle Swarm Optimization and Simulated Annealing for Capacitated Vehicle Routing Problem

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
6
0

Year Published

2020
2020
2024
2024

Publication Types

Select...
3
3

Relationship

1
5

Authors

Journals

citations
Cited by 6 publications
(6 citation statements)
references
References 15 publications
0
6
0
Order By: Relevance
“…Optimization techniques aim to produce optimal solutions that require a balance between exploration and exploitation capabilities. Exploration is the ability of an algorithm to explore areas that have not been visited, while exploitation is the ability of an algorithm to use areas that have been explored and find possible better solutions [6]. Traditional heuristic approaches may produce suboptimal solutions because the search process is stuck at a local optimum.…”
Section: Advantages Of Meta-heuristic Methods In Combinatorial Problemsmentioning
confidence: 99%
See 2 more Smart Citations
“…Optimization techniques aim to produce optimal solutions that require a balance between exploration and exploitation capabilities. Exploration is the ability of an algorithm to explore areas that have not been visited, while exploitation is the ability of an algorithm to use areas that have been explored and find possible better solutions [6]. Traditional heuristic approaches may produce suboptimal solutions because the search process is stuck at a local optimum.…”
Section: Advantages Of Meta-heuristic Methods In Combinatorial Problemsmentioning
confidence: 99%
“…In addition, meta-heuristics also have flexibility in combining various types of search strategies. They can combine the best elements of various heuristic approaches to form more robust and adaptive algorithms [6]. For VRPs, where variations and constraints require multiple approaches, this capability provides additional benefits in achieving better and more appropriate solutions to the situation at hand.…”
Section: Advantages Of Meta-heuristic Methods In Combinatorial Problemsmentioning
confidence: 99%
See 1 more Smart Citation
“…The CVRP is an NP-hard problem, and there are no efficient algorithms for solving large-sized problems with an acceptable computation time for a quality solution. Most research has focused on designing heuristic and meta-heuristic algorithms to obtain an optimal solution for the CVRP problem, such as adapted ant colony optimization (ACO) algorithms [15], customized genetic algorithms (GAs) [16], ant system (AS) [17], tailored particle swarm optimization (PSO) [18], adapted artificial bee colony (ABC) [19] or firefly algorithms (FAs) [20], and Tabu Search (TS) [21].…”
Section: Introductionmentioning
confidence: 99%
“…SA has the adaptability to deal with both discrete data and continuous data. SA has the characteristics of universal, easy to achieve, and high quality, and is widely used in engineering fields, such as fault diagnosis, circuit design, vehicle routing, and image processing [23][24][25][26][27]. It is of high practical value.…”
Section: Introductionmentioning
confidence: 99%