Simultaneous Multi-Start Simulated Annealing for Capacitated Vehicle Routing Problem
WSEAS TRANSACTIONS ON COMPUTER RESEARCH · 2020
DOI: 10.37394/232018.2020.8.4 ↗Kurz gefasst
Fachartikel in der Zeitschrift WSEAS TRANSACTIONS ON COMPUTER RESEARCH, 2020. Verfasst von Arman Davtyan und 1 weiteren Autor:innen. Die Arbeit nennt 7 Literaturangaben.
Abstract (Originalsprache)
A new metaheuristic algorithm is proposed for Capacitated Vehicle Routing Problem. CVRP is one of the fundamental problems in combinatorial optimization that deals with transport route minimization. The algorithm combines Simulated Annealing, multi-start and simultaneous computing techniques. A series of computational tests are conducted on several CVRP benchmarks and near-optimal solutions are obtained. The results indicate superior performance compared with Simulated Annealing
Zitieren
APA
Davtyan, A., & Khachatryan, S. (2020). Simultaneous Multi-Start Simulated Annealing for Capacitated Vehicle Routing Problem. WSEAS TRANSACTIONS ON COMPUTER RESEARCH. https://doi.org/10.37394/232018.2020.8.4
Vancouver
Davtyan A, Khachatryan S. Simultaneous Multi-Start Simulated Annealing for Capacitated Vehicle Routing Problem. WSEAS TRANSACTIONS ON COMPUTER RESEARCH. 2020. doi:10.37394/232018.2020.8.4
BibTeX
@article{Davtyan2020,
author = {Davtyan, Arman and Khachatryan, Suren},
title = {Simultaneous Multi-Start Simulated Annealing for Capacitated Vehicle Routing Problem},
journal = {WSEAS TRANSACTIONS ON COMPUTER RESEARCH},
year = {2020},
doi = {10.37394/232018.2020.8.4}
}
EUVIMED