In this paper authors will present analysis and implementation of possible solutions of vehicle routing problem that is based on simulated annealing method, which belongs to the category of meta-heuristic problem solving approaches. The described problem is rather complex linear programming problem from the field of operation research. Testing of developed applications in software package MATHEMATICA will be described. This application provides great possibilities when it comes to working with numerical algorithms, as well as in the field of symbolic and algebraic calculations. Keywords: Transportation Problem, Linear Optimization, Vehicle Routing Problem, Met Heuristics Solving Approach, Simulated Annealing
This paper aims to give a presentation of the PhD defended by Eneko Osaba on November 16th, 2015, at...
This paper addresses the Vehicle Routing Problem with Time Windows (VRPTW) and shows that implementi...
International audienceMetaheuristics exhibit desirable properties like simplicity, easy parallelizab...
Ovaj rad obrađuje problem usmjeravanja vozila, te je fokusiran na njegovo rješavanje pomoću metaheur...
This Thesis Work will concentrate on a very interesting problem, the Vehicle Routing Problem (VRP). ...
Goal: This paper aims to implement a periodic capacitated vehicle routing problem with simulated ann...
In the present PhD thesis, a collection of vehicle routing problems is examined and solved. These pr...
This chapter presents the best-known heuristics and metaheuristics that are applied to solve the cap...
In this paper, we survey the literature on matheuristics proposed to solve vehicle routing problems....
This article presents a new simulated annealing algorithm that provides very high quality solutions ...
The researcher has applied and develops the meta-heuristics method to solve Vehicle Routing Problems...
Researchers who investigate in any area related to computational algorithms (both dening new algorit...
International audienceThis chapter presents the main metaheuristics working on a sequence of solutio...
The vehicle routing problem (VRP) is a famous combinatorial optimization problem. Because of its wel...
The Vehicle Routing Problem is an NP-complete problem that has been studied extensively since it was...
This paper aims to give a presentation of the PhD defended by Eneko Osaba on November 16th, 2015, at...
This paper addresses the Vehicle Routing Problem with Time Windows (VRPTW) and shows that implementi...
International audienceMetaheuristics exhibit desirable properties like simplicity, easy parallelizab...
Ovaj rad obrađuje problem usmjeravanja vozila, te je fokusiran na njegovo rješavanje pomoću metaheur...
This Thesis Work will concentrate on a very interesting problem, the Vehicle Routing Problem (VRP). ...
Goal: This paper aims to implement a periodic capacitated vehicle routing problem with simulated ann...
In the present PhD thesis, a collection of vehicle routing problems is examined and solved. These pr...
This chapter presents the best-known heuristics and metaheuristics that are applied to solve the cap...
In this paper, we survey the literature on matheuristics proposed to solve vehicle routing problems....
This article presents a new simulated annealing algorithm that provides very high quality solutions ...
The researcher has applied and develops the meta-heuristics method to solve Vehicle Routing Problems...
Researchers who investigate in any area related to computational algorithms (both dening new algorit...
International audienceThis chapter presents the main metaheuristics working on a sequence of solutio...
The vehicle routing problem (VRP) is a famous combinatorial optimization problem. Because of its wel...
The Vehicle Routing Problem is an NP-complete problem that has been studied extensively since it was...
This paper aims to give a presentation of the PhD defended by Eneko Osaba on November 16th, 2015, at...
This paper addresses the Vehicle Routing Problem with Time Windows (VRPTW) and shows that implementi...
International audienceMetaheuristics exhibit desirable properties like simplicity, easy parallelizab...