Article Per Year (5 Year)
p-Index From 2019 - 2024
0
P-Index
This Author published in this journals
All Journal Bulletin of Electrical Engineering and Informatics Bulletin of Electrical Engineering and Informatics Bulletin of Electrical Engineering and Informatics
Ashkan Sami
Shiraz University
Computer Science & IT Electrical & Electronics Engineering Engineering

Published : 3 Documents Claim Missing Document
Claim Missing Document
Check
Articles

Found 3 Documents
Search

 1 
Particle Swarm Optimization in Solving Capacitated Vehicle Routing Problem M. M. Tavakoli; Ashkan Sami
Bulletin of Electrical Engineering and Informatics Vol 2, No 4: December 2013
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.11591/eei.v2i4.190

Abstract

The Capacitated Vehicle Routing Problem (CVRP) is an NP-Hard problem, which means it is impossible to find a polynomial time solution for it. So researchers try to reach a near optimum solution by using meta-heuristic algorithms. The aim of CVRP is to find optimum route for every vehicle and a sequence of customers, that vehicle serve. This paper proposes a method on how PSO is adjusted for a discrete space problem like CVRP. The process of tweaking solutions is described in detail. At last for evaluation of proposed approach and show the effectiveness of it, the result of running proposed approach over benchmarking data set of capacitated vehicle routing problem is illustrated.
Particle Swarm Optimization in Solving Capacitated Vehicle Routing Problem M. M. Tavakoli; Ashkan Sami
Bulletin of Electrical Engineering and Informatics Vol 2, No 4: December 2013
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (157.565 KB) | DOI: 10.11591/eei.v2i4.190

Abstract

The Capacitated Vehicle Routing Problem (CVRP) is an NP-Hard problem, which means it is impossible to find a polynomial time solution for it. So researchers try to reach a near optimum solution by using meta-heuristic algorithms. The aim of CVRP is to find optimum route for every vehicle and a sequence of customers, that vehicle serve. This paper proposes a method on how PSO is adjusted for a discrete space problem like CVRP. The process of tweaking solutions is described in detail. At last for evaluation of proposed approach and show the effectiveness of it, the result of running proposed approach over benchmarking data set of capacitated vehicle routing problem is illustrated.
Particle Swarm Optimization in Solving Capacitated Vehicle Routing Problem M. M. Tavakoli; Ashkan Sami
Bulletin of Electrical Engineering and Informatics Vol 2, No 4: December 2013
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (157.565 KB) | DOI: 10.11591/eei.v2i4.190

Abstract

The Capacitated Vehicle Routing Problem (CVRP) is an NP-Hard problem, which means it is impossible to find a polynomial time solution for it. So researchers try to reach a near optimum solution by using meta-heuristic algorithms. The aim of CVRP is to find optimum route for every vehicle and a sequence of customers, that vehicle serve. This paper proposes a method on how PSO is adjusted for a discrete space problem like CVRP. The process of tweaking solutions is described in detail. At last for evaluation of proposed approach and show the effectiveness of it, the result of running proposed approach over benchmarking data set of capacitated vehicle routing problem is illustrated.
Co-Authors M. M. Tavakoli