1. SOLVING PRACTICAL PROBLEMS IN SHIPPING BY USING MATHEMATICAL MODELSIrina Cristea, Camelia Ciobanu, Claudia Pantelie, 2015, izvirni znanstveni članek Opis: The purpose of this paper is to highlight how using mathematical algorithms, some practical problems on board can be more easily solved.
Najdeno v: ključnih besedah
Povzetek najdenega: ...mathematical model, Yu Chen algorithm, Bellman algorithm....
Ključne besede: mathematical model, Yu Chen algorithm, Bellman algorithm.
Objavljeno: 09.02.2016; Ogledov: 3250; Prenosov: 1
 Polno besedilo (258,81 KB) |
2. A map-matching algorithm dealing with sparse cellular fingerprint observationsAndrea Viel, Federico Pittino, Angelo Montanari, Chris Marshall, Donatella Gubiani, Paolo Gallo, Andrea Dalla Torre, 2019, izvirni znanstveni članek Opis: The widespread availability of mobile communication makes mobile devices a resource for the collection of data about mobile infrastructures and user mobility. In these contexts, the problem of reconstructing the most likely trajectory of a device on the road network on the basis of the sequence of observed locations (map-matching problem) turns out to be particularly relevant. Different contributions have demonstrated that the reconstruction of the trajectory of a device with good accuracy is technically feasible even when only a sparse set of GNSS positions is available. In this paper, we face the problem of coping with sparse sequences of cellular fingerprints. Compared to GNSS positions, cellular fingerprints provide coarser spatial information, but they work even when a device is missing GNSS positions or is operating in an energy saving mode. We devise a new map-matching algorithm, that exploits the well-known Hidden Markov Model and Random Forests to successfully deal with noisy and sparse cellular observations. The performance of the proposed solution has been tested over a medium-sized Italian city urban environment by varying both the sampling of the observations and the density of the fingerprint map as well as by including some GPS positions into the sequence of fingerprint observations.
Najdeno v: ključnih besedah
Ključne besede: Map-matching algorithm, trajectory, cellular fingerprint, Hidden Markov Model
Objavljeno: 11.06.2019; Ogledov: 2676; Prenosov: 94
Polno besedilo (3,93 MB) |
3. Algorithms matter and one should better understand them2020, radijska ali televizijska oddaja Najdeno v: ključnih besedah
Povzetek najdenega: ... algorithm, programming, technology, languages, sonic arts, sound, contemporary...
Ključne besede: algorithm, programming, technology, languages, sonic arts, sound, contemporary art
Objavljeno: 23.02.2021; Ogledov: 1393; Prenosov: 7
 Polno besedilo (0,00 KB) |
4. Meta-heuristic algorithms to improve fuzzy C-means and K-means clustering for location allocation of telecenters under e-governance in developing nationsSaibal K. Pal, Rajan Gupta, Sunil K. Muttoo, 2019, izvirni znanstveni članek Opis: The telecenter, popularly known as the rural kiosk or common service center, is an important building block for the improvement of e-governance in developing nations as they help in better citizen engagement. Setting up of these centers at appropriate locations is a challenging task; inappropriate locations can lead to a huge loss to the government and allied stakeholders. This study proposes the use of various meta-heuristic algorithms (particle swarm optimization, bat algorithm, and ant colony optimization) for the improvement of traditional clustering approaches (K-means and fuzzy C-means) used in the facility location allocation problem and maps them for the betterment of telecenter location allocation. A dataset from the Indian region was considered for the purpose of this experiment. The performance of the algorithms when applied to traditional facility location allocation problems such as set-cover, P-median, and the P-center problem was investigated, and it was found that their efficiency improved by 20%–25% over that of existing algorithms.
Najdeno v: ključnih besedah
Povzetek najdenega: ...study proposes the use of various meta-heuristic algorithms (particle swarm optimization, bat algorithm, and ant...
Ključne besede: ant colony optimization, bat algorithm, common service center, e-governance, fuzzy clustering, meta-heuristic algorithm, particle swarm optimization
Objavljeno: 01.04.2021; Ogledov: 1233; Prenosov: 7
Polno besedilo (0,00 KB)
Gradivo ima več datotek! Več...
|
5. BAT algorithm for improving fuzzy C-means clustering for location allocation of rural kiosks in developing countries under e-governanceSaibal K. Pal, Rajan Gupta, Sunil K. Muttoo, 2016, izvirni znanstveni članek Opis: Rural Kiosks are important infrastructural pillar in rural regions for internet and basic technology facility all around the world. They are also known as Tele-centers or Common Service Centers and are majorly used by government to promote Electronic Governance. The major characteristic of setting up of Rural Kiosk is their appropriate location so that people from rural region can avail the services at minimum travel cost and time. There are lot of traditional schemes used by researchers in past for location allocation but this paper proposes the usage of Fuzzy C-Means clustering and BAT algorithm to optimize the location of Rural Kiosk. The meta-heuristic approach has produced better results as compared to normal graph theories in past. The experiment has been conducted on a random data set of 72 village
locations from India and their clusters are formed. It is found that using only Fuzzy C-Means clustering to allocate the center and by using it in combination with BAT algorithm produced
up to 25% of efficient results. This can drastically help the key stakeholders in allocation of these Rural Kiosks at right places so as to maximize their utility.
Najdeno v: ključnih besedah
Ključne besede: BAT algorithm, location allocation, rural kiosks, fuzzy C-means, e-governance, tele-centers, common service centers
Objavljeno: 01.04.2021; Ogledov: 1256; Prenosov: 0
Polno besedilo (517,82 KB) |
6. Community-wide experimental evaluation of the PROSS stability-design methodKim Remans, Qian Guo, Natalya Leneva, Ario De Marco, Saroja Weeratunga, Emma K. Livingstone, Kai-En Chen, Brett M. Collins, Yoav Peleg, Renaud Vincentelli, 2021, izvirni znanstveni članek Najdeno v: ključnih besedah
Povzetek najdenega: ...protein stability, recombinant production, optimization algorithm, PROSS...
Ključne besede: protein stability, recombinant production, optimization algorithm, PROSS
Objavljeno: 23.04.2021; Ogledov: 1467; Prenosov: 0
Polno besedilo (980,70 KB) |
7. |
8. |
9. |
10. Solving a new variant of the capacitated maximal covering location problem with fuzzy coverage area using metaheuristic approachesAnirban Mukhopadhyay, Priya Ranjan Sinha Mahapatra, Soumen Atta, 2022, izvirni znanstveni članek Opis: The Maximal Covering Location Problem (MCLP) is concerned with the optimal placement of a fixed number of facilities to cover the maximum number of customers. This article considers a new variant of MCLP where both the coverage radii of facilities and the distance between customer and facility are fuzzy. Moreover, the finite capacity of each facility is considered. We call this problem the capacitated MCLP with fuzzy coverage area (FCMCLP), and it is formulated as a 0–1 linear programming problem. In this article, two classical metaheuristics: particle swarm optimization, differential evolution, and two new-generation metaheuristics: artificial bee colony algorithm, firefly algorithm, are proposed for solving FCMCLP. Each of the customized metaheuristics utilizes a greedy deterministic heuristic to generate their initial populations. They also incorporate a local neighborhood search to improve their convergence rates. New instances of FCMCLP are generated from the traditional MCLP instances available in the literature, and IBM’s CPLEX solver is used to generate benchmark solutions. An experimental comparative study among the four customized metaheuristics is described in this article. The performances of the proposed metaheuristics are also compared with the benchmark solutions obtained from CPLEX.
Najdeno v: ključnih besedah
Povzetek najdenega: ...and two new-generation metaheuristics: artificial bee colony algorithm, firefly algorithm, are proposed for solving FCMCLP....
Ključne besede: Facility Location Problem (FLP), Fuzzy Capacitated Maximal Covering Location Problem (FCMCLP), Particle Swarm Optimization (PSO), Differential Evolution (DE), Artificial Bee Colony (ABC), Firefly Algorithm (FA)
Objavljeno: 08.03.2023; Ogledov: 287; Prenosov: 0
Polno besedilo (2,21 MB) |
