Unconventional heuristics for vehicle routing problems

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F61988987%3A17310%2F16%3AA1701HAL" target="_blank" >RIV/61988987:17310/16:A1701HAL - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—

Result language
angličtina
Original language name
Unconventional heuristics for vehicle routing problems
Original language description
The Vehicle Routing Problem (VRP) is one of the most challenging combinatorial optimization tasks. This problem consists in designing an optimal set of routes for a fleet of vehicles in order to serve a given set of customers. Vehicle routing problem forms an integral part of the supply chain management, which plays a significant role in productivity improvement in organizations through an efficient and effective delivery of goods/services to customers. This problem is known to be NP-hard; hence many heuristic procedures for its solution have been suggested. For such problems, it is often desirable to obtain approximate solutions, so they can be found fast enough and are sufficiently accurate for the purpose. In this paper, we have performed an experimental study that indicates a suitable use of genetic algorithms for the vehicle routing problem. We tested instances from Capacitated Vehicle Routing Problem Library (CVRPLIB) series A, B, E, M and X. The obtained experimental outputs were compared with the following heuristics: the Clarke and Wright heuristic, sweep algorithm, and Taillard?s algorithm. © European Society of Computational Methods in Sciences and Engineering.
Czech name
—
Czech description
—

Type
J<sub>x</sub> - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)
CEP classification
IN - Informatics
OECD FORD branch
—

Publication year
2016
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Name of the periodical
Journal of Numerical Analysis, Industrial and Applied Mathematics
ISSN
1790-8140
e-ISSN
—
Volume of the periodical
9-10
Issue of the periodical within the volume
3-4
Country of publishing house
GR - GREECE
Number of pages
11
Pages from-to
57-67
UT code for WoS article
—
EID of the result in the Scopus database
2-s2.0-84975263152

Similar results(10)