A combination of genetic algorithm and particle swarm optimization (PSO) for vehicle routing problems with time windows (VRPTW) is proposed in this paper. The improvements of the proposed algorithm include: using the particle real number encoding method to decode the route to alleviate the computation burden, applying a linear decreasing function based on the number of the iterations to provide balance between global and local exploration abilities, and integrating with the crossover operator of genetic algorithm to avoid the premature convergence and the local minimum. The experimental results show that the proposed algorithm is not only more efficient and competitive with other published results but can also obtain more optimal solutions ...
Distribution is an important aspect of industrial activity to serve customers on time with minimal o...
Vehicle routing problem with time windows (VRPTW) is one of NP-hard problem. Multi-trip is approach ...
Vehicle routing problem with time windows (VRPTW) is a well-known NP-hard combinatorial optimization...
A combination of genetic algorithm and particle swarm optimization (PSO) for vehicle routing problem...
A new hybridized algorithm based on Particle Swarm Optimization is proposed for the solution of the ...
The topic of this paper is a Genetic Algorithm solution to the Vehicle Routing Problem with Time Win...
A heuristic based on Particle Swarm Optimisation (PSO) algorithm for solving VRPTW, which is an exte...
The Vehicle Routing Problem (VRP) is a NP complete problem and is also a hot topic in the operationa...
Summarization: In this paper, a new variant of the Particle Swarm Optimization (PSO) algorithm is pr...
This paper surveys the research on evolutionary algorithms for the Vehicle Routing Problem with Time...
The Vehicle Routing Problem with Time Windows (VRPTW) is an important problem in logistics, which is...
This work presents the Vehicle Routing with Time Windows and Loading Problem (VRTWLP) as a multi-obj...
Summarization: In the last few years, a number of books and survey papers devoted to the vehicle rou...
The Vehicle Routing Problem with Time Windows (VRPTW) is a well-known and complex combinatorial prob...
AbstractThe vehicle routing problem with time windows (VRPTW) is a complex transportation issue. In ...
Distribution is an important aspect of industrial activity to serve customers on time with minimal o...
Vehicle routing problem with time windows (VRPTW) is one of NP-hard problem. Multi-trip is approach ...
Vehicle routing problem with time windows (VRPTW) is a well-known NP-hard combinatorial optimization...
A combination of genetic algorithm and particle swarm optimization (PSO) for vehicle routing problem...
A new hybridized algorithm based on Particle Swarm Optimization is proposed for the solution of the ...
The topic of this paper is a Genetic Algorithm solution to the Vehicle Routing Problem with Time Win...
A heuristic based on Particle Swarm Optimisation (PSO) algorithm for solving VRPTW, which is an exte...
The Vehicle Routing Problem (VRP) is a NP complete problem and is also a hot topic in the operationa...
Summarization: In this paper, a new variant of the Particle Swarm Optimization (PSO) algorithm is pr...
This paper surveys the research on evolutionary algorithms for the Vehicle Routing Problem with Time...
The Vehicle Routing Problem with Time Windows (VRPTW) is an important problem in logistics, which is...
This work presents the Vehicle Routing with Time Windows and Loading Problem (VRTWLP) as a multi-obj...
Summarization: In the last few years, a number of books and survey papers devoted to the vehicle rou...
The Vehicle Routing Problem with Time Windows (VRPTW) is a well-known and complex combinatorial prob...
AbstractThe vehicle routing problem with time windows (VRPTW) is a complex transportation issue. In ...
Distribution is an important aspect of industrial activity to serve customers on time with minimal o...
Vehicle routing problem with time windows (VRPTW) is one of NP-hard problem. Multi-trip is approach ...
Vehicle routing problem with time windows (VRPTW) is a well-known NP-hard combinatorial optimization...