the shapley value, one of the most common solution concepts of cooperative game theory is defined and axiomatically characterized in different game-theoretic models. certainly, the shapley value can be used in interesting sharing cost/reward problems in the operations research area such as connection, routing, scheduling, production and inventory situations. in this paper, we focus on the shapl...

a significant portion of gross domestic production (gdp) in any country belongs to the transportation system. transportation equipment, in the other hand, is supposed to be great consumer of oil products. many attempts have been assigned to the vehicles to cut down greenhouse gas (ghg). in this paper a novel heuristic algorithm based on clark and wright algorithm called green clark and wright (...

mobile ad hoc networks (manets) are composed of mobile stations communicating through wireless links, without any fixed backbone support. in these networks, limited power energy supply, and frequent topology changes caused by node mobility, makes their routing a challenging problem. tora is one of the routing protocols that successfully copes with the nodes’ mobility side effects, but it doesn’...

Effective and congestion-aware routing is vital to the performance of network-on-chip. The efficient routing algorithm undoubtedly relies on the considered selection strategy. If the routing function returns a number of more than one permissible output ports, a selection function is exploited to choose the best output port to reduce packets latency. In this paper, we introduce a new selection s...

multi-path is favorite alternative for sensor networks, as it provides an easy mechanism to distributetraffic, as well as considerate fault tolerance. in this paper, a new clustering based multi path routingprotocol namely ecrr (energy efficient cluster based routing algorithm for improving reliability) isproposed, which is a new routing algorithm and guarantees the achievement to required qos ...

multicast routing is one of the most important services in multi radio multi channel (mrmc) wireless mesh networks (wmn). multicast routing performance in wmns could be improved by choosing the best routes and the routes that have minimum interference to reach multicast receivers. in this paper we want to address the multicast routing problem for a given channel assignment in wmns. the channels...

in recent years mobile networks have expanded dramatically, compared with other wireless networks. routing protocols in these networks are designed with the assumption that there is no attacker node, so routing protocols are vulnerable to various attacks in these networks. in this paper, we review the network layer attacks and then we simulate the impact of black hole attack on ad hoc on demand...

in this paper, we propose a scheme to improve existing ad-hoc on-demanddistance vector (aodv) routing protocol by discovering and maintaining multiplenon-overlapped routes. our routing protocol is a multipath version of aodvrouting protocol that considers only the disjoint path. due to non-overlappingamong paths, when a link breaks in the network, only one of paths is expired. thepresented rout...

We study a new variant of the vehicle routing problem, called Mobile Production Vehicle Routing Problem (MoP-VRP). In this vehicles are equipped with 3D printers, and production takes place on way to customer. The objective is minimize weighted cost incurred by travel delay service. formulate Mixed Integer Programming (MIP) model develop an Adaptive Large Neighbourhood Search (ALNS) heuristic f...

Stochastic Approach to Vehicle Routing Problem: Development and Theories Abstract In this article, a chance constrained (CCP) formulation of the Vehicle Routing Problem (VRP) is proposed. The reality is that once we convert some special form of probabilistic constraint into their equivalent deterministic form then a nonlinear constraint generates. Knowing that reliable computer software...