• Nenhum resultado encontrado

Routing problems

Vehicle routing problems : investigação e construção de um sistema de informação geográfica

Vehicle routing problems : investigação e construção de um sistema de informação geográfica

... Coene, Arnout, & Spieksma, no seu caso de estudo sobre uma companhia de recolha de lixo belga, afirmam que no PVRP “existe um horizonte, digamos de T dias, e existe uma frequênci[r] ...

101

A Clustering Approach for Vehicle Routing Problems with Hard Time Windows

A Clustering Approach for Vehicle Routing Problems with Hard Time Windows

... of problems: a class of clustered problems whose requests form geographical clusters; a class of random problems, whose requests are randomly scattered; a class that combines both clustered and ...

70

Contributions to the single and multiple vehicle routing problems with deliveries and selective pickups

Contributions to the single and multiple vehicle routing problems with deliveries and selective pickups

... Basically we use a Data Mining strategy, in which every new individual has its route analyzed to extract patterns (sequence of customers) within a given range [minP atternSize, maxP atternSize]. Each pattern found is ...

89

Obstacle-Aware Longest-Path Routing with Parallel MILP Solvers

Obstacle-Aware Longest-Path Routing with Parallel MILP Solvers

... longest-path routing problems, we describe how to use variables (or decision variables) to represent a routing ...final routing result, the routing region shown in ...

5

Modelos e algoritmos para problemas integrados de distribuição e roteamento (Models and algorithms for the integrated routing and distribution problems)

Modelos e algoritmos para problemas integrados de distribuição e roteamento (Models and algorithms for the integrated routing and distribution problems)

... solve routing problems [Salani, ...Vehicle Routing Problem with Cross- Docking (VRPCD) and due to their exponential number of variables, we implemented two BP algorithms to solve ...

136

DYNAMIC K-MEANS ALGORITHM FOR OPTIMIZED ROUTING IN MOBILE AD HOC NETWORKS

DYNAMIC K-MEANS ALGORITHM FOR OPTIMIZED ROUTING IN MOBILE AD HOC NETWORKS

... Clustering methods are used in many different applications, such as data mining and ad hoc networks. Several clustering schemes have been proposed for ad hoc networks. K-means clustering technique is one of the ...

14

A multi-objective Pareto ant colony algorithm for the Multi-Depot Vehicle Routing problem with Backhauls

A multi-objective Pareto ant colony algorithm for the Multi-Depot Vehicle Routing problem with Backhauls

... The goal of the MDVRPB is to determine the routes to be performed from the selected depots to the customers by a fleet of homogeneous vehicles in order to satisfy the demand of the customers (products to be collected or ...

14

QoSRRC: integrated QoS routing and resource provisioning mechanism for future Internet eve  QoS

QoSRRC: integrated QoS routing and resource provisioning mechanism for future Internet eve QoS

... of routing and QoS control mechanisms, in order to correctly map physical resources (links, interfaces, ...the Routing and dynamic Resource Control (QoS-RRC), a suite of mechanisms addressing routingenabled ...

4

Arq. NeuroPsiquiatr.  vol.72 número8 X anp 282X20140098

Arq. NeuroPsiquiatr. vol.72 número8 X anp 282X20140098

... behavioral problems in children and adolescents with age between 6 and 18 years old, and it is based on information provided by ...affective problems, anxiety problems, somatic problems, ...

6

Energy-Aware Performance Metric for AODV and DSDV Routing Protocols in Mobile Ad-Hoc Networks

Energy-Aware Performance Metric for AODV and DSDV Routing Protocols in Mobile Ad-Hoc Networks

... Vector routing protocol is a r eactive routing ...Source Routing (DSR) and DSDV protocol [5]. It is a distance vector routing protocol and is capable of both unicast and multicast ...

6

On the Support of Multimedia Applications over Wireless Mesh Networks

On the Support of Multimedia Applications over Wireless Mesh Networks

... of routing as a network optimization problem, and present a general linear programming (LP) formulation for modelling the ...The routing algorithms derived from these formulations usually claim analytical ...

17

Robust optimization for OSPF routing

Robust optimization for OSPF routing

... The Open Shortest Path First (OSPF) protocol is an IGP that was created by the OSPF working group of the Internet Engineering Task Force [Moy, 1998]. In OSPF routing, the network administrator assigns integer ...

64

ACO Based Routing for MANETs

ACO Based Routing for MANETs

... This is the strategy followed in AntHocNet [2, 8, 22, 23], which is a reactive-proactive multipath algorithm for routing in MANETs. The structure of AntHocNet is quite similar to that of AntNet-FA with the ...

12

Secure Geographic Routing Protocols: Issues and Approaches

Secure Geographic Routing Protocols: Issues and Approaches

... According to great capabilities of WSNs, application of them is increasing in recent decade. But, they face to some challenges such as limitation of power, memory, CPU and etc. these issues of WSNs have a direct effects ...

8

PERFORMANCE OF TOPOLOGY AWARE RELIABLE ROUTING PROTOCOL FOR LARGE SCALE VIRTUAL PRIVATE NETWORK

PERFORMANCE OF TOPOLOGY AWARE RELIABLE ROUTING PROTOCOL FOR LARGE SCALE VIRTUAL PRIVATE NETWORK

... Reliable Routing Protocol (TARRP) for large scale VPN and compare its performance with the traditional protocol, Boarder Gateway Protocol ...phases: Routing phase and authentication phase. In the ...

7

Algumas reflexões sobre os problemas e seu papel no desenvolvimento da matemática

Algumas reflexões sobre os problemas e seu papel no desenvolvimento da matemática

... Let us remember some basic and repeated aspects in civilizations such as Mesopotamia 10 , Egypt, China, India and pre-Columbian America. The word Mathematics or mathematician did not exist (both of Greek origin), ...

16

Attacks in manet

Attacks in manet

... a routing protocol, sleep deprivation attacks might be launched by flooding the targeted node with unnecessary routing ...the routing mechanisms and rendered unreachable by the other nodes in the ...

4

Countering Count-To-Infinity in High Speed  Networks

Countering Count-To-Infinity in High Speed Networks

... Abstract- Routing tables of all the routers needs frequent updates due topology changes resulting because of link failures or link metric ...transient routing loops. These loops pose significant stability ...

4

RouteSpray: A multiple-copy routing algorithm based on transit routes

RouteSpray: A multiple-copy routing algorithm based on transit routes

... years. Routing protocols for this type of network must face several challenges, such as high mobility, high speeds and frequent network ...vehicular routing algorithm called RouteSpray that in addition to ...

8

A Cooperative Blackhole Node Detection Mechanism for ADHOC Networks

A Cooperative Blackhole Node Detection Mechanism for ADHOC Networks

... A wireless ad-hoc network consists of a collection of "peer" mobile nodes that are capable of communicating with each other without help from a fixed infrastructure. The interconnections between nodes are capable ...

5

Show all 2250 documents...

temas relacionados