DocumentCode :
1335571
Title :
Selection of User´s Connection in Last-Mile Problem
Author :
Levin, Mark Sh
Author_Institution :
Inst. for Inf. Transm. Problems, Russian Acad. of Sci., Moscow, Russia
Volume :
41
Issue :
2
fYear :
2011
fDate :
3/1/2011 12:00:00 AM
Firstpage :
370
Lastpage :
374
Abstract :
This correspondence paper focuses on multicriterion combinatorial models in the “last-mile” problem for selection of user´s connections. The following models are considered: (1) multicriterion ranking; (2) knapsack-like problems (e.g., multicriterion multiple-choice problem); (3) clustering; and (4) hierarchical morphological synthesis based on morphological clique problem. The last-mile problem is examined from the following viewpoints: (1) user(s); (2) provider(s) (i.e., communication service provider); and (3) users and providers. The following problems are described: (1) selection of the best connection for user; (2) selection of the best connections from several providers; (3) multistage selection of the best connections for user; (4) clustering of users; and (5) design of hierarchical connection system from provider. Numerical examples illustrate some applications.
Keywords :
combinatorial mathematics; knapsack problems; optimisation; hierarchical morphological synthesis; knapsack problem; last-mile problem; morphological clique problem; multicriterion combinatorial model; multicriterion ranking; multistage selection; Analytical models; Clustering algorithms; Educational institutions; Hidden Markov models; Integrated circuits; Trajectory; Wireless communication; Combinatorial optimization; communications; decision making; last-mile problem; morphological design;
fLanguage :
English
Journal_Title :
Systems, Man and Cybernetics, Part A: Systems and Humans, IEEE Transactions on
Publisher :
ieee
ISSN :
1083-4427
Type :
jour
DOI :
10.1109/TSMCA.2010.2069091
Filename :
5585788
Link To Document :
بازگشت