Zobrazeno 1 - 10
of 14
pro vyhledávání: '"Monia Bellalouna"'
Publikováno v:
ICCS
The Probabilistic Traveling Salesman Problem (PTSP) is an extension of the classical Traveling Salesman Problem (TSP). The main difference is the stochastic presence of the customers, that is, the number of them to be visited each time is a random va
Publikováno v:
SNPD
The traveling salesman problem(TSP) is considered among the most problem studying in the combinatorial optimization, due to its real-life applications. It consists in finding a minimal length tour across a given number $n$ of cities. From the literat
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783319937120
ICCS (3)
ICCS (3)
The Probabilistic Capacitated Vehicle Routing Problem (PCVRP) is a generalization of the classical Capacitated Vehicle Routing Problem (CVRP). The main difference is the stochastic presence of the customers, that is, the number of them to be visited
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::519b4a6ad5dd117c8581f2391aeb8837
https://doi.org/10.1007/978-3-319-93713-7_20
https://doi.org/10.1007/978-3-319-93713-7_20
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783319937007
ICCS (2)
ICCS (2)
CSS-Sprite is a technique of regrouping small images of a web page, called tiles, into images called sprites in order to reduce network transfer time. CSS-sprite packing problem is considered as an optimization problem. We approach it as a probabilis
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::7f90b9470653e580f9d71a22d7c6abc4
https://doi.org/10.1007/978-3-319-93701-4_44
https://doi.org/10.1007/978-3-319-93701-4_44
Publikováno v:
ICIS
This paper provides a new parallel hybrid-heuristic by using the Open MPI environment for solving the Probabilistic Traveling Salesman Problem (PTSP). It is a variation of the classic Traveling Salesman Problem (TSP) where each node is present with p
Publikováno v:
Computers & Industrial Engineering. 64:1-10
In a previous work (Bouyahia et al., 2010), we introduced and studied the probabilistic generalization of the classical total weighted completion time problem. We defined two a priori strategies devoted to the incorporated problem on parallel identic
Publikováno v:
ICIS
The wireless sensor network is enormously used in a random way in different environments to execute diverse applications and tasks. Because of its sensitivity, various research projects have been conducted with the aim of finding solutions in the pre
Publikováno v:
Computers & Industrial Engineering. 58:488-500
We address the probabilistic generalization of weighted flow time on parallel machines. We present some results for situations which ask for ''long-term robust'' schedules of n jobs (tasks) on m parallel machines (processors): on any given day, only
Publikováno v:
2015 IEEE/ACIS 16th International Conference on Software Engineering, Artificial Intelligence, Networking and Parallel/Distributed Computing (SNPD).
The Probabilistic Traveling Salesman Problem (PTSP) is a generalization of the well-known Traveling Salesman Problem (TSP), the main difference is the cities are present with a probability. PTSP is NP-Hard, researches are rather directed towards heur
Autor:
Monia Bellalouna, Afef Ghabri
Publikováno v:
SNPD
The wireless sensor networks are considered as a new technology that has appeared due to technological advances in the field of development of powerful processors, wireless communication protocols and smart sensors. Because of their sensitivity, seve