A genetic algorithm for the routing and carrier selection problem

12Citations
Citations of this article
16Readers
Mendeley users who have this article in their library.

Abstract

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.

Cite

CITATION STYLE

APA

Kratica, J., Kostić, T., Tǒsić, D., Dugǒsija, D., & Filipović, V. (2012). A genetic algorithm for the routing and carrier selection problem. Computer Science and Information Systems, 9(1), 49–62. https://doi.org/10.2298/CSIS100425067K

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free