Search

Your search keyword '"Andr Rossi"' showing total 3 results
Start Over Author "Andr Rossi"
3 results on '"Andr Rossi"'

1. Heuristics for lifetime maximization in camera sensor networks

Author

Alok Singh, Marc Sevaux, Andr Rossi, School of Computer and Information Sciences, University of Hyderabad, Laboratoire d'Etudes et de Recherche en Informatique d'Angers (LERIA), Université d'Angers (UA), Lab-STICC_UBS_CID_DECIDE, Laboratoire des sciences et techniques de l'information, de la communication et de la connaissance (UMR 3192) (Lab-STICC), Université européenne de Bretagne - European University of Brittany (UEB)-Université de Bretagne Sud (UBS)-Université de Brest (UBO)-Institut Brestois du Numérique et des Mathématiques (IBNM), Université de Brest (UBO)-Télécom Bretagne-Institut Mines-Télécom [Paris] (IMT)-Centre National de la Recherche Scientifique (CNRS)-Université européenne de Bretagne - European University of Brittany (UEB)-Université de Bretagne Sud (UBS)-Université de Brest (UBO)-Institut Brestois du Numérique et des Mathématiques (IBNM), Université de Brest (UBO)-Télécom Bretagne-Institut Mines-Télécom [Paris] (IMT)-Centre National de la Recherche Scientifique (CNRS)-Laboratoire des sciences et techniques de l'information, de la communication et de la connaissance (Lab-STICC), École Nationale d'Ingénieurs de Brest (ENIB)-Université de Bretagne Sud (UBS)-Université de Brest (UBO)-Télécom Bretagne-Institut Brestois du Numérique et des Mathématiques (IBNM), and Université de Brest (UBO)-Université européenne de Bretagne - European University of Brittany (UEB)-École Nationale Supérieure de Techniques Avancées Bretagne (ENSTA Bretagne)-Institut Mines-Télécom [Paris] (IMT)-Centre National de la Recherche Scientifique (CNRS)-École Nationale d'Ingénieurs de Brest (ENIB)-École Nationale Supérieure de Techniques Avancées Bretagne (ENSTA Bretagne)-Centre National de la Recherche Scientifique (CNRS)

Subjects
Mathematical optimization, Information Systems and Management, Linear programming, Computer science, 0211 other engineering and technologies, Heuristic, 02 engineering and technology, Theoretical Computer Science, Artificial Intelligence, Genetic algorithm, 0202 electrical engineering, electronic engineering, information engineering, Fraction (mathematics), 021103 operations research, Maximization, [INFO.INFO-RO]Computer Science [cs]/Operations Research [cs.RO], Solver, Computer Science Applications, Network lifetime maximization problem, Control and Systems Engineering, Camera sensor network, 020201 artificial intelligence & image processing, Heuristics, Wireless sensor network, Software
Abstract

International audience; Due to increasing threat perception and cheap availability of multimedia technologies, camera sensor networks are becoming more and more popular these days. Camera sensor networks pose some unique challenges in addition to the usual difficulties associated with any directional sensor network. This paper addresses the problem of maximizing the network lifetime in camera sensor networks under the full and the partial target coverage models. In the full target coverage model, all the targets are assumed to be covered during the entire lifetime, whereas in the partial target coverage model, targets are supposed to have weights according to their importance, and only a fraction of targets with sum of weights above a certain threshold need to be covered during the entire lifetime. Three heuristics are presented for this problem. The first heuristic is an improved version of an already existing heuristic. Other two heuristics are based on column generation and utilize a linear programming solver to solve the master problem, whereas a genetic algorithm is used to solve the NP-hard subproblem. Computational results show the effectiveness of our proposed heuristics.

Published
2017
Full Text
View/download PDF

2. Multiple neighborhood search, tabu search and ejection chains for the multi-depot open vehicle routing problem

Author

Andreas Reinholz, Mara Soto, Marc Sevaux, Andr Rossi, Lab-STICC_UBS_CID_DECIDE, Laboratoire des sciences et techniques de l'information, de la communication et de la connaissance (UMR 3192) (Lab-STICC), Université européenne de Bretagne - European University of Brittany (UEB)-Université de Bretagne Sud (UBS)-Université de Brest (UBO)-Télécom Bretagne-Institut Brestois du Numérique et des Mathématiques (IBNM), Université de Brest (UBO)-Institut Mines-Télécom [Paris] (IMT)-Centre National de la Recherche Scientifique (CNRS)-Université européenne de Bretagne - European University of Brittany (UEB)-Université de Bretagne Sud (UBS)-Université de Brest (UBO)-Télécom Bretagne-Institut Brestois du Numérique et des Mathématiques (IBNM), Université de Brest (UBO)-Institut Mines-Télécom [Paris] (IMT)-Centre National de la Recherche Scientifique (CNRS)-Laboratoire des sciences et techniques de l'information, de la communication et de la connaissance (Lab-STICC), École Nationale d'Ingénieurs de Brest (ENIB)-Université de Bretagne Sud (UBS)-Université de Brest (UBO)-Télécom Bretagne-Institut Brestois du Numérique et des Mathématiques (IBNM), Université de Brest (UBO)-Université européenne de Bretagne - European University of Brittany (UEB)-École Nationale Supérieure de Techniques Avancées Bretagne (ENSTA Bretagne)-Institut Mines-Télécom [Paris] (IMT)-Centre National de la Recherche Scientifique (CNRS)-École Nationale d'Ingénieurs de Brest (ENIB)-École Nationale Supérieure de Techniques Avancées Bretagne (ENSTA Bretagne)-Centre National de la Recherche Scientifique (CNRS), DLR Institut für Solarforschung, Deutsches Zentrum für Luft- und Raumfahrt [Köln] (DLR), Laboratoire d'Etudes et de Recherche en Informatique d'Angers (LERIA), Université d'Angers (UA), Université européenne de Bretagne - European University of Brittany (UEB)-Université de Bretagne Sud (UBS)-Université de Brest (UBO)-Institut Brestois du Numérique et des Mathématiques (IBNM), Université de Brest (UBO)-Télécom Bretagne-Institut Mines-Télécom [Paris] (IMT)-Centre National de la Recherche Scientifique (CNRS)-Université européenne de Bretagne - European University of Brittany (UEB)-Université de Bretagne Sud (UBS)-Université de Brest (UBO)-Institut Brestois du Numérique et des Mathématiques (IBNM), and Université de Brest (UBO)-Télécom Bretagne-Institut Mines-Télécom [Paris] (IMT)-Centre National de la Recherche Scientifique (CNRS)-Laboratoire des sciences et techniques de l'information, de la communication et de la connaissance (Lab-STICC)

Subjects
Mathematical optimization, 021103 operations research, General Computer Science, Generalization, 0211 other engineering and technologies, General Engineering, Neighborhood search, Ejection chains, 02 engineering and technology, Path move, [INFO.INFO-RO]Computer Science [cs]/Operations Research [cs.RO], CVRP, MNS, TS, Tabu search, Path (graph theory), Vehicle routing problem, 0202 electrical engineering, electronic engineering, information engineering, 020201 artificial intelligence & image processing, OVRP, MDOVRP, Statistical hypothesis testing, Mathematics
Abstract

The proposed approach solves the Multi-Depot Open VRP.An uniform view of ejection chains is adopted for all neighborhoods.Multiple Neighborhood Search (MNS) and Tabu Search (TS) are combined.MNS-TS outperforms the state-of-the-art methods. In this paper, we address the Multi-Depot Open Vehicle Routing Problem (MDOVRP), which is a generalization of the Capacitated Vehicle Routing Problem (CVRP) where vehicles start from different depots, visit customers, deliver goods and are not required to return to the depot at the end of their routes. The goal of this paper is twofold. First, we have developed a general Multiple Neighborhood Search hybridized with a Tabu Search (MNS-TS) strategy which is proved to be efficient and second, we have settled an unified view of ejection chains to be able to handle several neighborhoods in a simple manner. The neighborhoods in the proposed MNS-TS are generated from path moves and ejection chains. The numerical and statistical tests carried out over OVRP and MDOVRP problem instances from the literature show that MNS-TS outperforms the state-of-the-art methods.

Published
2017
Full Text
View/download PDF

3. Improving the performance of embedded systems with variable neighborhood search

Author

Marc Sevaux, Rafael Mart, Abraham Duarte, Andr Rossi, Jess Snchez-Oro, Dept. Ciencias de la Computación, Universidad Rey Juan Carlos [Madrid] (URJC), Lab-STICC_UBS_CID_DECIDE, Laboratoire des sciences et techniques de l'information, de la communication et de la connaissance (UMR 3192) (Lab-STICC), Université européenne de Bretagne - European University of Brittany (UEB)-Université de Bretagne Sud (UBS)-Université de Brest (UBO)-Télécom Bretagne-Institut Brestois du Numérique et des Mathématiques (IBNM), Université de Brest (UBO)-Institut Mines-Télécom [Paris] (IMT)-Centre National de la Recherche Scientifique (CNRS)-Université européenne de Bretagne - European University of Brittany (UEB)-Université de Bretagne Sud (UBS)-Université de Brest (UBO)-Télécom Bretagne-Institut Brestois du Numérique et des Mathématiques (IBNM), Université de Brest (UBO)-Institut Mines-Télécom [Paris] (IMT)-Centre National de la Recherche Scientifique (CNRS)-Laboratoire des sciences et techniques de l'information, de la communication et de la connaissance (Lab-STICC), École Nationale d'Ingénieurs de Brest (ENIB)-Université de Bretagne Sud (UBS)-Université de Brest (UBO)-Télécom Bretagne-Institut Brestois du Numérique et des Mathématiques (IBNM), Université de Brest (UBO)-Université européenne de Bretagne - European University of Brittany (UEB)-École Nationale Supérieure de Techniques Avancées Bretagne (ENSTA Bretagne)-Institut Mines-Télécom [Paris] (IMT)-Centre National de la Recherche Scientifique (CNRS)-École Nationale d'Ingénieurs de Brest (ENIB)-École Nationale Supérieure de Techniques Avancées Bretagne (ENSTA Bretagne)-Centre National de la Recherche Scientifique (CNRS), Laboratoire d'Etudes et de Recherche en Informatique d'Angers (LERIA), Université d'Angers (UA), Departamento de Estadística e Investigación Operativa, Universitat de València (UV), Université européenne de Bretagne - European University of Brittany (UEB)-Université de Bretagne Sud (UBS)-Université de Brest (UBO)-Institut Brestois du Numérique et des Mathématiques (IBNM), Université de Brest (UBO)-Télécom Bretagne-Institut Mines-Télécom [Paris] (IMT)-Centre National de la Recherche Scientifique (CNRS)-Université européenne de Bretagne - European University of Brittany (UEB)-Université de Bretagne Sud (UBS)-Université de Brest (UBO)-Institut Brestois du Numérique et des Mathématiques (IBNM), and Université de Brest (UBO)-Télécom Bretagne-Institut Mines-Télécom [Paris] (IMT)-Centre National de la Recherche Scientifique (CNRS)-Laboratoire des sciences et techniques de l'information, de la communication et de la connaissance (Lab-STICC)

Subjects
021103 operations research, business.industry, Computer science, C dynamic memory allocation, Embedded systems, Work (physics), 0211 other engineering and technologies, 02 engineering and technology, Metaheuristics, [INFO.INFO-RO]Computer Science [cs]/Operations Research [cs.RO], Static memory allocation, Memory, Embedded system, 0202 electrical engineering, electronic engineering, information engineering, 020201 artificial intelligence & image processing, Dynamic memory allocation, business, Metaheuristic, Software, Variable neighborhood search
Abstract

Graphical abstractDisplay Omitted Embedded systems have become an essential part of our lives, mainly due to the evolution of technology in the last years. However, the power consumption of these devices is one of their most important drawbacks. It has been proven that an efficient use of the memory of the device also improves its energy performance. This work efficiently solves the dynamic memory allocation problem, which can be formally defined as follows: given a program that has to be executed by a circuit, the objective is to fit that program in memory in such a way that the computing time required to execute it is minimized. In this work, we propose a parallel variable neighborhood search strategy to address this problem. We additionally compare this parallel procedure with the sequential version of the algorithm and with the best previous approach. Computational results show the superiority of our proposal, backed up with statistical tests.

Published
2017
Full Text
View/download PDF

Catalog

Books, media, physical & digital resources
See catalog results