<div>Bike sharing system (BSS) is growing worldwide. Although bike sharing is viewed as a sustainable transportation mode, it still has environmental footprints from its operation (e.g., bike rebalancing using automobiles) and upstream impacts (e.g., bike and docking station manufacturing). Thus, evaluating the environmental impacts of a BSS from the life cycle perspective is vital to inform decision making for the system design and operation. In this study, we conducted a comparative life cycle assessment (LCA) of station-based and dock-less BSS in the U.S. The results show that dock-less BSS has a greenhouse gas (GHG) emissions factor of 118 g CO2-eq/bike-km in the base scenario, which is 82% higher than the station-based system. Bike rebalancing is the main source of GHG emissions, accounting for 36% and 73% of the station-based and dock-less systems, respectively. However, station-based BSS has 54% higher total normalized environmental impacts (TNEI), compared to dock-less BSS. The dock manufacturing dominants the TNEI (61%) of station-based BSS and the bike manufacturing contributes 52% of TNEI in dock-less BSS. BSS can also bring environmental benefits through substituting different transportation modes. Car trip replacement rate is the most important factor. The results suggest four key approaches to improve BSS environmental performance: 1) optimizing the bike distribution and rebalancing route or repositioning bikes using more sustainable approaches, 2) incentivizing more private car users to switch to using BSSs, 3) prolonging lifespans of docking infrastructure to significantly reduce the TNEI of station-based systems, and 4) increasing the bike utilization efficiency to improve the environmental performance of dock-less systems.</div><div>To improve the design of current BSS from the life cycle perspective, we first proposed a simulation framework to find the minimal fleet size and their layout of the system. Then we did a tradeoff analysis between bike fleet size and the rebalancing frequency to investigate the GHG emission if we rebalance once, twice and three times a day. The optimal BSS design and operation strategies that can minimize system GHG emission are identified for a dock-less system in Xiamen, China. The results show that at most 15% and 13% of the existing fleet size is required to serve all the trip demand on weekday and weekend, if we have a well-designed bike layout. The tradeoff analysis shows that the GHG emission may increase if we continue to reduce the fleet size through more frequent rebalancing work. Rebalancing once a day during the night is the optimal strategy in the base scenario. We also tested the impacts of other key factors (e.g., rebalancing vehicle fleet size, vehicle capacity and multiple depots) on results. The analysis results showed that using fewer vehicles with larger capacity could help to further reduce the GHG emission of rebalancing work. Besides, setting 3 depots in the system can help to reduce 30% of the GHG emission compared with 1-depot case, which benefits from the decrease of the commuting trip distance between depot and the serve region.</div>

L’agriculture de précision est un mode de culture qui consiste à prendre en compte la variabilité intra-parcellaire afin d'appliquer le bon traitement au bon endroit. Depuis les années 80, l’agriculture de précision s’est développée grâce à l’arrivée d’outils de géolocalisation (GPS), de matériels permettant une gestion modulée des cultures et surtout d'une multitude de données issues de prélèvements sur le terrain, d'images et de capteurs. Dans ce contexte, l’agriculture de précision a fait émerger de nouveaux problèmes à la fois combinatoires et complexes afin de répondre à des enjeux de performance économique, technique et environnementale.Cette thèse porte sur l'utilisation de la programmation par contraintes pour résoudre des problèmes de tournées dans le contexte de l’agriculture de précision et, plus précisément, en viticulture de précision.Un problème de tournées de véhicule consiste à déterminer une flotte de véhicules afin de visiter une liste de clients ou de réaliser des tournées d’interventions. Le but est de minimiser le coût total des tournées tout en respectant différentes contraintes. Ce problème est une extension classique du problème du voyageur de commerce et fait partie des problèmes NP-difficiles.La programmation par contraintes est un outil très puissant capable de résoudre des problèmes combinatoires comme les problèmes de tournées. Elle fournit des algorithmes de filtrage dédiés à des contraintes de circuits qui permettent de résoudre de façon efficace des problèmes associant ces contraintes de circuit à d'autres contraintes plus spécifiques.La première contribution de cette thèse est la formalisation du problème de la vendange sélective et sa modélisation sous la forme d’un problème d’optimisation sous contraintes. Le problème de la vendange sélective consiste à trouver la trajectoire optimale d’une machine à vendanger qui récolte et sépare deux qualités de raisins. En plus d’être un problème de tournées peu commun, la gestion du remplissage simultané des deux bacs augmente la combinatoire du problème. Plusieurs modèles sont présentés et testés sur des données réelles provenant de vignobles situés dans le sud de la France.La deuxième contribution est l’établissement d’une nouvelle contrainte globale de tournées nommée WeightedSubCircuits. Elle permet d'aborder le problème plus général de tournées multiples dans lequel on cherche à couvrir une partie du graphe par un ensemble de circuits disjoints de coût minimal. Un algorithme de filtrage partiel de cette contrainte est également présenté. Des expérimentations ont été réalisées, notamment sur un problème de planning de techniciens intervenant sur des vignobles en Californie qui a été modélisé dans le cadre de cette thèse. Ces résultats préliminaires ont montré l'intérêt du filtrage apporté par cette nouvelle contrainte. / L’agriculture de précision est un mode de culture qui consiste à prendre en compte la variabilité intra-parcellaire afin d'appliquer le bon traitement au bon endroit. Depuis les années 80, l’agriculture de précision s’est développée grâce à l’arrivée d’outils de géolocalisation (GPS), de matériels permettant une gestion modulée des cultures et surtout d'une multitude de données issues de prélèvements sur le terrain, d'images et de capteurs. Dans ce contexte, l’agriculture de précision a fait émerger de nouveaux problèmes à la fois combinatoires et complexes afin de répondre à des enjeux de performance économique, technique et environnementale.Cette thèse porte sur l'utilisation de la programmation par contraintes pour résoudre des problèmes de tournées dans le contexte de l’agriculture de précision et, plus précisément, en viticulture de précision.Un problème de tournées de véhicule consiste à déterminer une flotte de véhicules afin de visiter une liste de clients ou de réaliser des tournées d’interventions. Le but est de minimiser le coût total des tournées tout en respectant différentes contraintes. Ce problème est une extension classique du problème du voyageur de commerce et fait partie des problèmes NP-difficiles.La programmation par contraintes est un outil très puissant capable de résoudre des problèmes combinatoires comme les problèmes de tournées. Elle fournit des algorithmes de filtrage dédiés à des contraintes de circuits qui permettent de résoudre de façon efficace des problèmes associant ces contraintes de circuit à d'autres contraintes plus spécifiques.La première contribution de cette thèse est la formalisation du problème de la vendange sélective et sa modélisation sous la forme d’un problème d’optimisation sous contraintes. Le problème de la vendange sélective consiste à trouver la trajectoire optimale d’une machine à vendanger qui récolte et sépare deux qualités de raisins. En plus d’être un problème de tournées peu commun, la gestion du remplissage simultané des deux bacs augmente la combinatoire du problème. Plusieurs modèles sont présentés et testés sur des données réelles provenant de vignobles situés dans le sud de la France.La deuxième contribution est l’établissement d’une nouvelle contrainte globale de tournées nommée WeightedSubCircuits. Elle permet d'aborder le problème plus général de tournées multiples dans lequel on cherche à couvrir une partie du graphe par un ensemble de circuits disjoints de coût minimal. Un algorithme de filtrage partiel de cette contrainte est également présenté. Des expérimentations ont été réalisées, notamment sur un problème de planning de techniciens intervenant sur des vignobles en Californie qui a été modélisé dans le cadre de cette thèse. Ces résultats préliminaires ont montré l'intérêt du filtrage apporté par cette nouvelle contrainte.

Vehicular Ad hoc Networks (VANETs) have the potential to enable various kinds of applications aiming at improving road safety and transportation efficiency. These applications require uni-cast routing, which remains a significant challenge due to VANETs characteristics. Given VANET dynamic topology, geographic routing protocols are considered the most suitable for such network due to their scalability and low overhead. However, the optimal selection of next-hop nodes in geographic routing is a challenging problem where the routing performance is highly affected by the variable link quality and bandwidth availability. In this dissertation, a number of enhancements to improve geographic routing reliability in VANETs are proposed. To minimize packet losses, the direction and link quality of next-hop nodes using the Expected Transmission Count (ETX) are considered to select links with low loss ratios. To consider the available bandwidth, a cross-layer enchantment of geographic routing, which can select more reliable links and quickly react to varying nodes load and channel conditions, is proposed. We present a novel model of the dynamic behavior of a wireless link. It considers the loss ratio on a link, in addition to transmission and queuing delays, and it takes into account the physical interference e ect on the link. Then, a novel geographic routing protocol based on fuzzy logic systems, which help in coordinating di erent contradicting metrics, is proposed. Multiple metrics related to vehicles' position, direction, link quality and achievable throughput are combined using fuzzy rules in order to select the more reliable next-hop nodes for packet forwarding. Finally, we propose a novel link utility aware geographic routing protocol, which extends the local view of the network topology using two-hop neighbor information. We present our model of link utility, which measures the usefulness of a two-hop neighbor link by considering its minimum residual bandwidth and packet loss rate. The proposed protocol can react appropriately to increased network tra c and to frequent topology dis-connectivity in VANETs. To evaluate the performance of the proposed protocols, extensive simulation experiments are performed using network and urban mobility simulation tools. Results confirm the advantages of the proposed schemes in increased traffic loads and network density. / Includes bibliography. / Dissertation (Ph.D.)--Florida Atlantic University, 2018. / FAU Electronic Theses and Dissertations Collection

Este trabalho trata do problema de roteirização de veículos para o abastecimento de linhas de produção, o qual pode ser entendido como uma particularização do problema clássico de roteirização de veículos (VRP Vehicle Routing Problem). Neste problema, peças estão armazenadas em um estoque central, chamado de supermercado, de onde são transferidas para pontos de uso localizados ao longo da linha de produção. O ritmo de fabricação na linha de produção é suposto constante, o que torna periódica a necessidade de reposição das embalagens com peças. Uma frota de rebocadores transporta as embalagens, dispostas sobre plataformas com rodas puxadas pelo mesmo e configurando um comboio. O objetivo do problema é roteirizar a frota de rebocadores, maximizando sua utilização e garantindo o atendimento da demanda gerada pela linha de produção. O problema é comum a muitas empresas de manufatura de bens de consumo e possui impacto direto nos custos operacionais. A literatura sobre o tema é escassa e as soluções empregadas na indústria habitualmente se baseiam na experiência prática de operadores ou responsáveis pela movimentação de materiais. Este trabalho propõe uma heurística para obtenção de uma solução para o problema, baseada em métodos de inserção. A heurística proposta foi aplicada a um caso na indústria automobilística e a comparação entre a solução obtida e aquela formulada por operadores demonstrou ganho no número de rotas. / This work studies the routing of vehicles for material delivery to assembly lines, which consists of a generalization of the classic Vehicle Routing Problem (VRP). In this problem, parts are stored in central depot called supermarket and from where they are distributed to points of use placed along the production line. Production rate in the assembly line is considered constant, which means that parts are delivered to points of use periodically. A fleet of tow cars transfers the boxes or containers of parts using wheeled towed carts. The objective of this problem is to route the fleet of the tow cars maximizing their utilization and fulfilling the assembly line demand for parts. This problem is common to several companies and has direct impacts in material handling costs. The theme is poorly explored in routing studies and many companies use operator experience to configure tow cars routes. This work proposes a heuristic based on insertion methods to find a solution for the problem. The heuristic was applied to a real problem and resulted in the reduction of the number of routes when compared to former operator solution.

Neste trabalho uma metodologia é proposta para disponibilizar, via internet, um serviço de roteirização de endereços para o campus da USP de Ribeirão Preto, com a determinação do menor caminho entre duas localidades. Esta metodologia pode ser aplicada não apenas ao campus da USP de Ribeirão Preto, mas ela poderá ser estendida às cidades e/ou regiões que possuam um mapa digital correspondente. Um sistema, denominado SIGRIB, foi desenvolvido para implementar a metodologia proposta. Utiliza o software ARCVIEW como suporte na manipulação de dados geográficos e cadastrais. Para facilitar a interação do usuário com o sistema SIGRIB, uma interface foi desenvolvida para que se possa fornecer duas localidades para as quais se deseja obter o menor caminho. O resultado desta consulta é uma figura ou conjunto de figuras contendo o menor caminho correspondente destacado. O sistema SIGRIB está disponível na internet (http://143.107.231.188/sigrib/pagina.asp) e vários testes são apresentados neste trabalho que demonstram o seu bom desempenho. / In this work a methodology is proposal to turn available, through internet, a routing service for addressing at campus of University of São Paulo, in Ribeirão Preto, including the determination of shortest way between two localities. This methodology can be applied not only to this campus but it can be extended to various cities and/or regions that have a corresponding digital map. A system, called SIGRIB, has been developed for implementing the proposed methodology. It utilizes ARCVIEW software as support for manipulation of geographical and cadastral data. To turn easy the interaction of user with SIGRIB system, a interface has been also implemented for that can provide two localities for which it desires to obtain the shortest path. The result of this search is a figure or set of figures containing the corresponding shortest path highlighted. The system SIGRIB is available in the internet (http://143.107.231.188/sigrib/pagina.asp) and several tests are presented in this work that demonstrate its good performance.

Field Programmable Gate Array (FPGA) has a dominating market in digital system prototyping and reconfigurable computing. To make a flexible and efficient FPGA chip both the hardware architecture and the design tool should be further engineered. An innovative architecture always requires excellent development of EDA tools to fully explore the intrinsic merits of the hardware. / FPGA Technology Mapping is an important design automation problem which affects placement and routing dramatically. Depth-optimal technology mapping algorithms were proposed and produced quality mapping solution for delay minimization. However such algorithms have not yet considered to further reduce area consumption using the powerful logic transformation techniques. / On hardware side, we present a study on the effect of direct and fast routing hard-wires in FPGA routing architecture. Based on the routing pattern analyzed from real routing data, we proposed a so-called shortcut -based routing to handle short and localized routing requirements. Experimental results show that the shortcuts are well utilized and it allows a better average wirelength usage in the whole routing architecture. / On software side, we propose a versatile approach to combine logic transformation and technology mapping. In addition to a level-reduction scheme, we also present a method of reducing the number of LUTs used while keeping the depth optimality. Our approach is based on a greedy but effective heuristic to choose good alternative wires for transformation. Large number of experiments were conducted to analyze the effectiveness of the system. Our results show that our approach can effectively reduce at least 5% (up to 25%) of the area over initial mapping by various state-of-the-art FPGA technology mappers. Furthermore, we found that the delay performance can be improved by 5% when the area is reduced by our system. / Tang, Wai Chung. / Adviser: David Yu-Liang Wu. / Source: Dissertation Abstracts International, Volume: 70-06, Section: B, page: 3704. / Thesis (Ph.D.)--Chinese University of Hong Kong, 2008. / Includes bibliographical references (leaves 70-74). / Electronic reproduction. Hong Kong : Chinese University of Hong Kong, [2012] System requirements: Adobe Acrobat Reader. Available via World Wide Web. / Electronic reproduction. [Ann Arbor, MI] : ProQuest Information and Learning, [200-] System requirements: Adobe Acrobat Reader. Available via World Wide Web. / Abstracts in English and Chinese. / School code: 1307.

This research is related to computer networks. In this thesis, three main issues are addressed which affect the performance of any computer network: congestion, efficient resources utilization and link failure. Those issues are related to each other in many situations. Many approaches have been suggested to deal with those issues as well as many solutions were applied. Despite all the improvements of the technology and the proposed solutions, those issues continue to be a burden on the system’s performance. This effect is related to the increase of the Quality of Service (QoS) requirements in modern networks. The basic idea of this research is evolving the intelligence of a conventional computer network when dealing with those issues by adding some features of the Software Defined Networking (SDN). This adoption upgrades the conventional computer network system to be more dynamic and higher self-organizing when dealing with those issues. This idea is applied on a system represented by a computer network that uses the Open Shortest Path First (OSPF) routing protocol. The first improvement deals with the distribution of Internet Protocol (IP) routed flows. The second improvement deals with tunnel establishment that serves Multi-Protocol Label Switching (MPLS) routed flows and the third improvement deals with bandwidth reservation when applying network restoration represented by Fast Re-route (FRR) mechanism to sooth the effect of link failure in OSPF/MPLS routed network. This idea is also applied on another system that uses the Enhanced Interior Gateway Routing Protocol (EIGRP) to improve the performance of its routing algorithm. Adopting the SDN notion is achieved by adding an intelligent controller to the system and creating a dialog of messages between the controller and the conventional routers. This requires upgrading the routers to respond to the new modified system. Our proposed approaches are presented with simulations of different configurations which produce fine results.

"Opportunistic routing (OR) takes advantages of the spatial diversity and broadcast nature of wireless networks to combat the time-varying links by involving multiple neighboring nodes (forwarding candidates) for each packet relay. This dissertation studies the properties, energy efficiency, capacity, throughput, protocol design and security issues about OR in multihop wireless networks. Firstly, we study geographic opportunistic routing (GOR), a variant of OR which makes use of nodes' location information. We identify and prove three important properties of GOR. The first one is on prioritizing the forwarding candidates according to their geographic advancements to the destination. The second one is on choosing the forwarding candidates based on their advancements and link qualities in order to maximize the expected packet advancement (EPA) with different number of forwarding candidates. The third one is on the concavity of the maximum EPA in respect to the number of forwarding candidates. We further propose a local metric, EPA per unit energy consumption, to tradeoff the routing performance and energy efficiency for GOR. Leveraging the proved properties of GOR, we propose two efficient algorithms to select and prioritize forwarding candidates to maximize the local metric. Secondly, capacity is a fundamental issue in multihop wireless networks. We propose a framework to compute the end-to-end throughput bound or capacity of OR in single/multirate systems given OR strategies (candidate selection and prioritization). Taking into account wireless interference and unique properties of OR, we propose a new method of constructing transmission conflict graphs, and we introduce the concept of concurrent transmission sets to allow the proper formulation of the maximum end-to-end throughput problem as a maximum-flow linear programming problem subject to the transmission conflict constraints. We also propose two OR metrics: expected medium time (EMT) and expected advancement rate (EAR), and the corresponding distributed and local rate and candidate set selection schemes, the Least Medium Time OR (LMTOR) and the Multirate Geographic OR (MGOR). We further extend our framework to compute the capacity of OR in multi-radio multi-channel systems with dynamic OR strategies. We study the necessary and sufficient conditions for the schedulability of a traffic demand vector associated with a transmitter to its forwarding candidates in a concurrent transmission set. We further propose an LP approach and a heuristic algorithm to obtain an opportunistic forwarding strategy scheduling that satisfies a traffic demand vector. Our methodology can be used to calculate the end-to-end throughput bound of OR in multi-radio/channel/rate multihop wireless networks, as well as to study the OR behaviors (such as candidate selection and prioritization) under different network configurations. Thirdly, protocol design of OR in a contention-based medium access environment is an important and challenging issue. In order to avoid duplication, we should ensure only the "best" receiver of each packet to forward it in an efficient way. We investigate the existing candidate coordination schemes and propose a "fast slotted acknowledgment" (FSA) to further improve the performance of OR by using a single ACK to coordinate the forwarding candidates with the help of the channel sensing technique. Furthermore, we study the throughput of GOR in multi-rate and single-rate systems. We introduce a framework to analyze the one-hop throughput of GOR, and provide a deeper insight on the trade-off between the benefit (packet advancement, bandwidth, and transmission reliability) and cost (medium time delay) associated with the node collaboration. We propose a local metric named expected one-hop throughput (EOT) to balance the benefit and cost. Finally, packet reception ratio (PRR) has been widely used as an indicator of the link quality in multihop wireless networks. Many routing protocols including OR in wireless networks depend on the PRR information to make routing decision. Providing accurate link quality measurement (LQM) is essential to ensure the right operation of these routing protocols. However, the existing LQM mechanisms are subject to malicious attacks, thus can not guarantee to provide correct link quality information. We analyze the security vulnerabilities in the existing link quality measurement (LQM) mechanisms and propose an efficient broadcast-based secure LQM (SLQM) mechanism, which prevents the malicious attackers from reporting a higher PRR than the actual one. We analyze the security strength and the cost of the proposed mechanism. "

Quality-of-service (QoS) requirements for the timely delivery of real-time multimedia raise new challenges for the networking world. A key component of QoS is QoS routing which allows the selection of network routes with sufficient resources for requested QoS parameters. Several techniques have been proposed in the literature to compute QoS routes, most of which require dynamic update of link-state information across the Internet. Given the growing size of the Internet, it is becoming increasingly difficult to gather up-to-date state information in a dynamic environment. We propose a new technique to compute QoS routes on the Internet in a fast and efficient manner without any need for dynamic updates. Our method, known as Selective Flooding, checks the state of the links on a set of pre-computed routes from the source to the destination in parallel and based on this information computes the best route and then reserves resources. We implemented Selective Flooding on a QoS routing simulator and evaluated the performance of Selective Flooding compared to source routing for a variety of network parameters. We find Selective Flooding consistently outperforms source routing in terms of call-blocking rate and outperforms source routing in terms of network overhead for some network conditions. The contributions of this thesis include the design of a new QoS routing algorithm, Selective Flooding, extensive evaluation of Selective Flooding under a variety of network conditions and a working simulation model for future research.

"This thesis explores techniques for improving the Quality of Service (QoS) driven routing of IP traffic in a Network Centric Military Communications System within an HC3 (High Capacity Communications Capability) tiered topology. In this specialized network various routing algorithms, including traditional, QoS-constrained search-based, and heuristic approaches, were evaluated. An automatic system for the probabilistic generation of appropriate networks and traffic was created for Monte Carlo simulation of the systems and testing of the various routing algorithms. A new algorithm we propose, based upon a hiercharical decomposition of routes about the minimum distance routes, is described and tested. These results provide both insight into this problem and demonstrate the possibility of highly optimized solutions without exhaustive search."