During the last decade, tremendous focus has been given to sustainable logistics practices to overcome environmental concerns of business practices. Since transportation is a prominent area of logistics, a new area of literature known as Green Transportation and Green Vehicle Routing has emerged. Vehicle Routing Problem (VRP) has been a very active area of the literature with contribution from many researchers over the last three decades. With the computational constraints of solving VRP which is NP-hard, metaheuristics have been applied successfully to solve VRPs in the recent past. This is a threefold study. First, it critically reviews the current literature on EMVRP and the use of metaheuristics as a solution approach. Second, the study...
The NP-hard Vehicle Routing Problem (VRP) is central in the optimisation of distribution networks. I...
Transport was one of the important issues that are owned by the logistics department, so that transp...
<p>Vehicle routing problems (VRP) are complicated problems, which can be encountered in a<br> variet...
The traveling salesman problem (TSP) consists of finding the shortest way between cities, which pass...
We propose a Genetic Algorithm (GA) to address a Green Vehicle Routing Problem (G-VRP). Unlike class...
We propose a Genetic Algorithm (GA) to address a Green Vehicle Routing Problem (G-VRP). Unlike class...
Solutions for NP-hard problems are often obtained using heuristics that yield results relatively qui...
Abstract — The main goal of this research is to find a solution of Vehicle Routing Problem using gen...
The Vehicle Routing Problem (VRP) is considered to be a complex and high-level set of various routin...
In logistics management, the use of vehicles to distribute products from suppliers to customers is a...
The research of vehicle routing problem (VRP) is significant for people traveling and logistics dist...
The purpose of this research was to develop a version of a genetic algorithm (GA ) which would provi...
Route optimization has become an increasing problem in the transportation and logistics sector withi...
Graduation date: 2008In the thesis, an application of a genetic algorithm (GA) is considered to solv...
National Research Foundation (NRF) Singapore under Corp Lab @ University scheme; Fujitsu Lt
The NP-hard Vehicle Routing Problem (VRP) is central in the optimisation of distribution networks. I...
Transport was one of the important issues that are owned by the logistics department, so that transp...
<p>Vehicle routing problems (VRP) are complicated problems, which can be encountered in a<br> variet...
The traveling salesman problem (TSP) consists of finding the shortest way between cities, which pass...
We propose a Genetic Algorithm (GA) to address a Green Vehicle Routing Problem (G-VRP). Unlike class...
We propose a Genetic Algorithm (GA) to address a Green Vehicle Routing Problem (G-VRP). Unlike class...
Solutions for NP-hard problems are often obtained using heuristics that yield results relatively qui...
Abstract — The main goal of this research is to find a solution of Vehicle Routing Problem using gen...
The Vehicle Routing Problem (VRP) is considered to be a complex and high-level set of various routin...
In logistics management, the use of vehicles to distribute products from suppliers to customers is a...
The research of vehicle routing problem (VRP) is significant for people traveling and logistics dist...
The purpose of this research was to develop a version of a genetic algorithm (GA ) which would provi...
Route optimization has become an increasing problem in the transportation and logistics sector withi...
Graduation date: 2008In the thesis, an application of a genetic algorithm (GA) is considered to solv...
National Research Foundation (NRF) Singapore under Corp Lab @ University scheme; Fujitsu Lt
The NP-hard Vehicle Routing Problem (VRP) is central in the optimisation of distribution networks. I...
Transport was one of the important issues that are owned by the logistics department, so that transp...
<p>Vehicle routing problems (VRP) are complicated problems, which can be encountered in a<br> variet...