hrcak mascot   Srce   HID

Izvorni znanstveni članak
https://doi.org/10.2498/cit.1002085

A GRASP Algorithm Based on New Randomized Heuristic for Vehicle Routing Problem

Abdesslem Layeb ; Computer science dept. university Of Constantine Algeria
Meryem Ammi   ORCID icon orcid.org/0000-0001-6264-3720 ; Computer Science Department, University of Constantine, Algeria
Salim Chikhi ; Computer Science Department, University of Constantine, Algeria

Puni tekst: engleski, pdf (1 MB) str. 35-46 preuzimanja: 1.140* citiraj
APA 6th Edition
Layeb, A., Ammi, M. i Chikhi, S. (2013). A GRASP Algorithm Based on New Randomized Heuristic for Vehicle Routing Problem. Journal of computing and information technology, 21 (1), 35-46. https://doi.org/10.2498/cit.1002085
MLA 8th Edition
Layeb, Abdesslem, et al. "A GRASP Algorithm Based on New Randomized Heuristic for Vehicle Routing Problem." Journal of computing and information technology, vol. 21, br. 1, 2013, str. 35-46. https://doi.org/10.2498/cit.1002085. Citirano 21.09.2019.
Chicago 17th Edition
Layeb, Abdesslem, Meryem Ammi i Salim Chikhi. "A GRASP Algorithm Based on New Randomized Heuristic for Vehicle Routing Problem." Journal of computing and information technology 21, br. 1 (2013): 35-46. https://doi.org/10.2498/cit.1002085
Harvard
Layeb, A., Ammi, M., i Chikhi, S. (2013). 'A GRASP Algorithm Based on New Randomized Heuristic for Vehicle Routing Problem', Journal of computing and information technology, 21(1), str. 35-46. https://doi.org/10.2498/cit.1002085
Vancouver
Layeb A, Ammi M, Chikhi S. A GRASP Algorithm Based on New Randomized Heuristic for Vehicle Routing Problem. Journal of computing and information technology [Internet]. 2013 [pristupljeno 21.09.2019.];21(1):35-46. https://doi.org/10.2498/cit.1002085
IEEE
A. Layeb, M. Ammi i S. Chikhi, "A GRASP Algorithm Based on New Randomized Heuristic for Vehicle Routing Problem", Journal of computing and information technology, vol.21, br. 1, str. 35-46, 2013. [Online]. https://doi.org/10.2498/cit.1002085

Sažetak
This paper presents a novel GRASP algorithm based on a new randomized heuristic for solving the capacitated vehicle routing problem, which characterized by using a fleet of homogenous vehicle capacity that will start from one depot, to serve a number of customers with demands that are less than the vehicle capacity. The proposed method is based on a new constructive heuristic and a simulated annealing procedure as an improvement phase. The new constructive heuristic uses four steps to generate feasible initial solutions, and the simulated annealing enhances these solutions found to reach the optimal one. We tested our algorithm on two sets of benchmark instances and the obtained results are very encouraging.

Ključne riječi
optimization problems; VRP; constructive heuristics; nearest neighbor heuristic

Hrčak ID: 103377

URI
https://hrcak.srce.hr/103377

Posjeta: 1.356 *