A genetic algorithm for the routing and carrier selection problem | Zendy

Jozef Kratica | Zendy; Tijana Kostić | Zendy; D.V. Tošić | Zendy; Djordje Dugošija | Zendy; Vladimir Filipović | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

A genetic algorithm for the routing and carrier selection problem

Author(s) -

Jozef Kratica,

Tijana Kostić,

D.V. Tošić,

Djordje Dugošija,

Vladimir Filipović

Publication year - 2011

Publication title -

computer science and information systems

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.244

H-Index - 24

eISSN - 2406-1018

pISSN - 1820-0214

DOI - 10.2298/csis100425067k

Subject(s) - computer science , selection (genetic algorithm) , heuristic , encoding (memory) , genetic algorithm , routing (electronic design automation) , representation (politics) , mathematical optimization , evolutionary algorithm , scheme (mathematics) , algorithm , function (biology) , artificial intelligence , machine learning , mathematics , computer network , mathematical analysis , evolutionary biology , politics , political science , law , biology

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 specific 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.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research