Repository logo
 
Publication

Solving the Ring Loading Problem Using Genetic Algorithms with Intelligent Multiple Operators

2009Conference paper Restricted access
Simple item page
dc.contributor.authorBernardino, Anabela M.
dc.contributor.authorBernardino, Eugénia M.
dc.contributor.authorSánchez-Pérez, Juan M.
dc.contributor.authorGómez-Pulido, Juan A.
dc.contributor.authorVega-Rodríguez, Miguel A.
dc.contributor.authorMoreira Bernardino, Anabela
dc.contributor.authorBernardino, Eugénia
dc.date.accessioned2025-04-21T13:58:57Z
dc.date.available2025-04-21T13:58:57Z
dc.date.issued2009
dc.descriptionInternational Symposium on Distributed Computing and Artificial Intelligence 2008 (DCAI 2008)
dc.description.abstractPlanning optical communication networks suggests a number of new optimization problems, most of them in the field of combinatorial optimization. We address here the Ring Loading Problem. The objective of the problem is to find a routing scheme such that the maximum weighted load on the ring is minimized. In this paper we consider two variants: (i) demands can be split into two parts, and then each part is sent in a different direction; (ii) each demand must be entirely routed in either of the two directions, clockwise or counterclockwise. In this paper, we propose a genetic algorithm employing multiple crossover and mutation operators. Two sets of available crossover and mutation operators are established initially. In each generation a crossover method is selected for recombination and a mutation method is selected for mutation based on the amount fitness improvements achieve over a number of previous operations (recombinations/mutations). We use tournament selection for this purpose. Simulation results with the different methods implemented are compared.eng
dc.identifier.citationBernardino, A.M., Bernardino, E.M., Sánchez-Pérez, J.M., Gómez-Pulido, J.A., Vega-Rodríguez, M.A. (2009). Solving the Ring Loading Problem Using Genetic Algorithms with Intelligent Multiple Operators. In: Corchado, J.M., Rodríguez, S., Llinas, J., Molina, J.M. (eds) International Symposium on Distributed Computing and Artificial Intelligence 2008 (DCAI 2008). Advances in Soft Computing, vol 50. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-85863-8_28.
dc.identifier.doi10.1007/978-3-540-85863-8_28
dc.identifier.isbn978-3-540-85862-1
dc.identifier.isbn978-3-540-85863-8
dc.identifier.issn1615-3871
dc.identifier.issn1860-0794
dc.identifier.urihttp://hdl.handle.net/10400.8/12819
dc.language.isoeng
dc.peerreviewedyes
dc.publisherSpringer Berlin Heidelberg
dc.relation.hasversionhttps://link.springer.com/chapter/10.1007/978-3-540-85863-8_28?utm_source=getftr&utm_medium=getftr&utm_campaign=getftr_pilot&getft_integrator=scopus#citeas
dc.relation.ispartofAdvances in Soft Computing
dc.relation.ispartofInternational Symposium on Distributed Computing and Artificial Intelligence 2008 (DCAI 2008)
dc.rights.uriN/A
dc.subjectOptimization
dc.subjectGenetic Algorithms
dc.subjectRing Loading Problem
dc.titleSolving the Ring Loading Problem Using Genetic Algorithms with Intelligent Multiple Operatorseng
dc.typeconference paper
dspace.entity.typePublication
oaire.citation.conferenceDate2008
oaire.citation.endPage244
oaire.citation.startPage235
oaire.citation.titleAdvances in Soft Computing
oaire.citation.volume50
oaire.versionhttp://purl.org/coar/version/c_970fb48d4fbd8a85
person.familyNameMoreira Bernardino
person.familyNameBernardino
person.givenNameAnabela
person.givenNameEugénia
person.identifier.ciencia-id081E-F3B8-316A
person.identifier.ciencia-id9616-F1BC-D8BD
person.identifier.orcid0000-0002-6561-5730
person.identifier.orcid0000-0001-5301-5853
person.identifier.scopus-author-id24402754700
relation.isAuthorOfPublication375ebe15-f84c-46a4-a3d9-6e4935a92187
relation.isAuthorOfPublication893cf15c-eff8-4e43-949c-c1de6eb87599
relation.isAuthorOfPublication.latestForDiscovery375ebe15-f84c-46a4-a3d9-6e4935a92187

Files

Original bundle
Now showing 1 - 1 of 1
No Thumbnail Available
Name:
Solving the Ring Loading Problem Using Genetic Algorithms with Intelligent Multiple Operators.pdf
Size:
1.38 MB
Format:
Adobe Portable Document Format
Description:
Planning optical communication networks suggests a number of new optimization problems, most of them in the field of combinatorial optimization. We address here the Ring Loading Problem. The objective of the problem is to find a routing scheme such that the maximum weighted load on the ring is minimized. In this paper we consider two variants: (i) demands can be split into two parts, and then each part is sent in a different direction; (ii) each demand must be entirely routed in either of the two directions, clockwise or counterclockwise. In this paper, we propose a genetic algorithm employing multiple crossover and mutation operators. Two sets of available crossover and mutation operators are established initially. In each generation a crossover method is selected for recombination and a mutation method is selected for mutation based on the amount fitness improvements achieve over a number of previous operations (recombinations/mutations). We use tournament selection for this purpose. Simulation results with the different methods implemented are compared.
Download
License bundle
Now showing 1 - 1 of 1
No Thumbnail Available
Name:
license.txt
Size:
1.32 KB
Format:
Item-specific license agreed upon to submission
Description:
Download

Collections

ESTG - Comunicações em conferências e congressos internacionais