Wyszukiwanie zaawansowane ?

Obiekt

Pobierz

Tytuł: Computational Methodsfor Two-Level 0-1 Programming Problemsthrough Distributed Genetic Algorithms, Journal of Telecommunications and Information Technology, 2010, nr 2

Autor:

Hayashida, Tomohiro ; Sakawa, Masatoshi ; Niwa, Keiichi

Data wydania:

2010, nr 2

Typ zasobu:

artykuł

Opis:

In this paper, we consider a two-level 0-1 programming problem in which there is not coordination between the decision maker (DM) at the upper level and the decision maker at the lower level. We propose a revised computational method that solves problems related to computational methods for obtaining the Stackelberg solution. Specifically, in order to improve the computational accuracy of approximate Stakelberg solutions and shorten the computational time of a computational method implementing a genetic algorithm (GA) proposed by the authors, a distributed genetic algorithm is introduced with respect to the upper level GA, which handles decision variables for the upper level DM. Parallelization of the lower level GA is also performed along with parallelization of the upper level GA. The proposed algorithm is also improved in order to eliminate unnecessary computation during operation of the lower level GA, which handles decision variables for the lower level DM. In order to verify the effectiveness of the proposed method, we propose comparisons with existing methods by performing numerical experiments to verify both the accuracy of the solution and the time required for the computation.

Wydawca:

Instytut Łączności - Państwowy Instytut Badawczy, Warszawa

Format:

application/pdf

Identyfikator zasobu:

oai:bc.itl.waw.pl:1047 ; ISSN 1509-4553, on-line: ISSN 1899-8852

DOI:

10.26636/jtit.2010.2.1076

ISSN:

1509-4553

eISSN:

1899-8852

Źródło:

Journal of Telecommunications and Information Technology

Język:

ang

Prawa:

Biblioteka Naukowa Instytutu Łączności

Temat i słowa kluczowe:

Stackelberg solution distributed genetic algorithm two-level 0-1 programming problem

Kolekcje, do których przypisany jest obiekt:

Data ostatniej modyfikacji:

28 sie 2024

Data dodania obiektu:

9 mar 2012

Liczba wyświetleń treści obiektu:

107

Wszystkie dostępne wersje tego obiektu:

https://bc.itl.waw.pl/publication/1163

Wyświetl opis w formacie RDF:

RDF

Wyświetl opis w formacie OAI-PMH:

OAI-PMH

Nazwa wydania Data
Niwa, Keiichi; Sakawa, Masatoshi; Hayashida, Tomohiro, Computational Methodsfor Two-Level 0-1 Programming Problemsthrough Distributed Genetic Algorithms, Journal of Telecommunications and Information Technology, 2010, nr 2 28 sie 2024

Obiekty Podobne
Artificial adaptive agent model characterized by learning and fairness in the ultimatum games, Journal of Telecommunications and Information Technology, 2007, nr 4

Nishizaki, Ichiro Katagiri, Hideki Hayashida, Tomohiro

2007, nr 4
artykuł
Coordination Gameswith Communication Costs in NetworkEnvironments, Journal of Telecommunications and Information Technology, 2010, nr 2

Nishizaki, Ichiro Hayashida, Tomohiro Hara, Noriyuki

2010, nr 2
artykuł
Więcej
×

Cytowanie

Styl cytowania:

Dane kontaktowe

Adres

Instytut Łączności – Państwowy Instytut Badawczy ul. Szachowa 1 04-894 Warszawa

Telefon

(+48) 5128 696

E-Mail

biblioteka@il-pib.pl

Odwiedź nas!

Ta strona wykorzystuje pliki 'cookies'. Więcej informacji