achieve an optimal solution with traditional optimization methods by reason of the high computational complexity for large … constructed a new heuristic algorithm based on the tabu search and adaptive large neighborhood search (ALNS) with several … proposed algorithm was illustrated on the benchmark problems. The algorithm provides a better performance on large …

cumulative volume of the blocks assembled at each terminal. RBP is an NP-hard combinatorial optimization problem with billions of … decision variables. To solve the real-life RBP, developing a metaheuristic algorithm is necessary. In this paper, for the first … time, a new genetic algorithm-based solution method, which is a population-based algorithm, is proposed to solve the RBP …

The vehicle routing problem (VRP) is one of the most important combinational optimization problems that has nowadays … objective is to minimize the total distance traveled by all the vehicles. This paper presents a hybrid two-phase algorithm … called sweep algorithm (SW) + ant colony system (ACS) for the classical VRP. At the first stage, the VRP is solved by the SW …

solution to the problem. An exact algorithm is proposed to obtain a partition (subset-vehicle combination) corresponding to the … knapsack solution. It requires testing and matching too many alternatives to obtain a partition. The sweep algorithm is …

the category of NP-hard problems are not practical in a large scale, a hybrid algorithm based on simulated annealing with … small cases, the related results of the proposed algorithm were compared with results obtained by the Lingo 8 software. The … obtained results indicate the efficiency of the proposed hybrid simulated annealing algorithm. -- vehicle routing problem …