A Genetic Algorithm for the Routing and Carrier Selection Problem

Computer Science and Information Systems

Tijana Kostić¹  Jozef Kratica² 

[1] Faculty of Mathematics, University of Belgrade,;Mathematical Institute, Serbian Academy of Sciences and Arts,

关键词: vehicle routing problems;    genetic algorithm;    evolutionary computation;    combinatorial optimization;   

DOI  :  10.2298/CSIS100425067K

学科分类：社会科学、人文和艺术（综合）

来源: Computer Science and Information Systems

【 摘 要 】

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.

【 授权许可】

CC BY-NC-ND