Time-dependent VRP (TDVRP) is one of the three VRP variants that have not been widely explored in research in the field of operational research, while Particle Swarm Optimization (PSO) is an optimization algorithm in the field of operational research that uses many variables in its application. There is much research conducted about TDVRP, but few of them discuss PSO's implementation. This article presented as a literature review which aimed to find a research gap about implementation of PSO to resolve TDVRP cases. The research was conducted in five stages. The first stage, a review protocol defined in the form of research questions and methods to perform the review. The second stage is references searching. The third stage is screening the...
Summarization: In this paper, a new variant of the Particle Swarm Optimization (PSO) algorithm is pr...
The Vehicle Routing Problem (VRP) is a NP complete problem and is also a hot topic in the operationa...
This paper presents a comparison of two approaches for solving the vehicle routing problem with time...
Time-dependent VRP (TDVRP) is one of the three VRP variants that have not been widely explored in re...
A heuristic based on Particle Swarm Optimisation (PSO) algorithm for solving VRPTW, which is an exte...
Vehicle Routing Problem (VRP) is one of the common problems that happen in human life. There are man...
Summarization: In the last few years, a number of books and survey papers devoted to the vehicle rou...
The Conventional Vehicle Routing Problem (VRP) has the objective function of minimizing the total ve...
Vehicle Routing Problem (VRP) is one of the most challenging problems in combinatorial optimization....
ABSTRAKSI: Permasalahan distribusi dan pergudangan dalam manajemen rantai pasok menjadi permasalahan...
This study uses bibliometric analysis to examine the scientific evolution of particle swarm optimiza...
Vehicle routing problem is one of the combinatorial optimisation problems that have gained attractio...
Context. The purpose of this research paper is to describe a new approach for solving the disruption...
This paper provides a framework for solving the Time Dependent Vehicle Routing Problem (TDVRP) by us...
A multiobjective dynamic vehicle routing problem (M-DVRP) has been identified and a time seed based ...
Summarization: In this paper, a new variant of the Particle Swarm Optimization (PSO) algorithm is pr...
The Vehicle Routing Problem (VRP) is a NP complete problem and is also a hot topic in the operationa...
This paper presents a comparison of two approaches for solving the vehicle routing problem with time...
Time-dependent VRP (TDVRP) is one of the three VRP variants that have not been widely explored in re...
A heuristic based on Particle Swarm Optimisation (PSO) algorithm for solving VRPTW, which is an exte...
Vehicle Routing Problem (VRP) is one of the common problems that happen in human life. There are man...
Summarization: In the last few years, a number of books and survey papers devoted to the vehicle rou...
The Conventional Vehicle Routing Problem (VRP) has the objective function of minimizing the total ve...
Vehicle Routing Problem (VRP) is one of the most challenging problems in combinatorial optimization....
ABSTRAKSI: Permasalahan distribusi dan pergudangan dalam manajemen rantai pasok menjadi permasalahan...
This study uses bibliometric analysis to examine the scientific evolution of particle swarm optimiza...
Vehicle routing problem is one of the combinatorial optimisation problems that have gained attractio...
Context. The purpose of this research paper is to describe a new approach for solving the disruption...
This paper provides a framework for solving the Time Dependent Vehicle Routing Problem (TDVRP) by us...
A multiobjective dynamic vehicle routing problem (M-DVRP) has been identified and a time seed based ...
Summarization: In this paper, a new variant of the Particle Swarm Optimization (PSO) algorithm is pr...
The Vehicle Routing Problem (VRP) is a NP complete problem and is also a hot topic in the operationa...
This paper presents a comparison of two approaches for solving the vehicle routing problem with time...