A Genetic Algorithm for the Routing and Carrier Selection Problem

Jozef Kratica1, Tijana Kostić2, Dušan Tošić3, Djordje Dugošija3 and Vladimir Filipović3

  1. Mathematical Institute, Serbian Academy of Sciences and Arts,
    Kneza Mihajla 36/III, 11 000 Belgrade, Serbia
  2. Faculty of Mathematics, University of Belgrade,
    Studentski trg 16/IV, 11 000 Belgrade, Serbia
    {dtosic, dugosija, vladaf}@matf.bg.ac.rs


In this paper we present new evolutionary approach for solving the Routing and Carrier Selection Problem (RCSP). New encoding scheme is implemented with appropriate objective function. This approach in most cases keeps the feasibility of individuals by using speci£c representation and modified genetic operators. The numerical experiments were carried out on the standard data sets known from the literature and results were successful comparing to two other recent heuristic for solving RCSP.

Key words

vehicle routing problems, genetic algorithm, evolutionary computation, combinatorial optimization

Digital Object Identifier (DOI)


Publication information

Volume 9, Issue 1 (January 2012)
Year of Publication: 2012
ISSN: 1820-0214 (Print) 2406-1018 (Online)
Publisher: ComSIS Consortium

Full text

DownloadAvailable in PDF
Portable Document Format

How to cite

Kratica, J., Kostić, T., Tošić, D., Dugošija, D., Filipović, V.: A Genetic Algorithm for the Routing and Carrier Selection Problem. Computer Science and Information Systems, Vol. 9, No. 1, 49-62. (2012), https://doi.org/10.2298/CSIS100425067K