Repository landing page

We are not able to resolve this OAI Identifier to the repository landing page. If you are the repository manager for this record, please head to the Dashboard and adjust the settings.
oaioai:ojs.cai.ui.sav.sk:article/76

A Genetic Algorithm Approach for the Capacitated Single Allocation P-Hub Median Problem

Authors
Publication date
26 January 2012
Publisher
Institute of Informatics, Slovak Academy of Sciences

Abstract

In this paper the Capacitated Single Allocation p-Hub Median Problem (CSApHMP) is considered. This problem has a wide range of applications within the design of telecommunication and transportation systems. A heuristic method, based on a genetic algorithm (GA) approach, is proposed for solving the CSApHMP. The described algorithm uses binary encoding and modified genetic operators. The caching technique is also implemented in the GA in order to improve its effectiveness. Computational experiments demonstrate that the GA method quickly reaches optimal solutions for hub instances with up to 50 nodes. The algorithm is also benchmarked on large scale hub instances with up to 200 nodes that are not solved to optimality so far

Similar works

Full text

thumbnail-image

Computing and Informatics (E-Journal - Institute of Informatics, SAS, Bratislava)

redirect
oaioai:ojs.cai.ui.sav.sk:article/...
Last time updated on 15/12/2019

This paper was published in Computing and Informatics (E-Journal - Institute of Informatics, SAS, Bratislava).

Having an issue?

Is data on this page outdated, violates copyrights or anything else? Report the problem now and we will take corresponding actions after reviewing your request.