Add to ORKGAbstract. In this paper we consider the Split Delivery Vehicle Routing Problem, which has a wide practical ap-plication. The SDVRP is NP-hard problem. We propose a population based ant colony optimization algorithm for solving the SDVRP. Computational experiments for developed algorithm are reported
Along with the progress in computer hardware architecture and computational power, in order to overc...
This dissertation presents metaheuristic approaches in the areas of genetic algorithms and ant colon...
The Vehicle Routing Problem (VRP) is of considerable economic significance in logistic systems as it...
Ant Colony Optimisation is a metaheuristic for combinatorial optimisation problems. In this paper we...
We propose a matheuristic approach to solve several types of vehicle routing problems (VRP). In the ...
Ant colony optimization (ACO) is a metaheuristic for combinatorial optimization problems. In this pa...
Dynamic Vehicle Routing Problem is a more complex version of Vehicle Routing Problem, closer to the ...
Abstract—Vehicle routing problem (VRP) is real-world combinatorial optimization problem which determ...
(MDVRP) is a generalization of SDVRP, in which multiple vehicles start from multiple depots and retu...
In this paper a combination of the two most important problems in distribution logistics is consider...
The multi-compartment vehicle routing problem (MCVRP) has been applied in fuel or food delivery, was...
Reverse logistics is an area that has come under increased scrutiny in recent years as legislators a...
We propose an Ant Colony Optimization (ACO) algorithm to the NPhard Vehicle Routing Problem with Sim...
In a typical supply chain, an aggregation hub is a strategically located facility that collects, pro...
Engineering field usually requires having the best design for an optimum performance, thus optimizat...
Along with the progress in computer hardware architecture and computational power, in order to overc...
This dissertation presents metaheuristic approaches in the areas of genetic algorithms and ant colon...
The Vehicle Routing Problem (VRP) is of considerable economic significance in logistic systems as it...
Ant Colony Optimisation is a metaheuristic for combinatorial optimisation problems. In this paper we...
We propose a matheuristic approach to solve several types of vehicle routing problems (VRP). In the ...
Ant colony optimization (ACO) is a metaheuristic for combinatorial optimization problems. In this pa...
Dynamic Vehicle Routing Problem is a more complex version of Vehicle Routing Problem, closer to the ...
Abstract—Vehicle routing problem (VRP) is real-world combinatorial optimization problem which determ...
(MDVRP) is a generalization of SDVRP, in which multiple vehicles start from multiple depots and retu...
In this paper a combination of the two most important problems in distribution logistics is consider...
The multi-compartment vehicle routing problem (MCVRP) has been applied in fuel or food delivery, was...
Reverse logistics is an area that has come under increased scrutiny in recent years as legislators a...
We propose an Ant Colony Optimization (ACO) algorithm to the NPhard Vehicle Routing Problem with Sim...
In a typical supply chain, an aggregation hub is a strategically located facility that collects, pro...
Engineering field usually requires having the best design for an optimum performance, thus optimizat...
Along with the progress in computer hardware architecture and computational power, in order to overc...
This dissertation presents metaheuristic approaches in the areas of genetic algorithms and ant colon...
The Vehicle Routing Problem (VRP) is of considerable economic significance in logistic systems as it...