Purpose - The purpose of this paper is to analyse the processes of collecting used non-returnable packaging. The objective is to increase the quality and quantity of recycling material used in the production of new pa...
详细信息
Purpose - The purpose of this paper is to analyse the processes of collecting used non-returnable packaging. The objective is to increase the quality and quantity of recycling material used in the production of new packages. Design/methodology/approach - A reverse logistics network is proposed, nevertheless the focus of the study is addressing the collection routing problem. Specifically a new "profitable visit algorithm" (PVA) based on the well-known Nearest Neighbor is proposed and tested, in both real and simulated scenarios, in order to achieve higher volume of collected material while lowering the cost of collection. Findings - The proposed algorithm is set to compete against the well-known Nearest Neighbor. The "PVA" showed a far better performance than the Nearest Neighbor. The latter was assessed with real data in a real scenario and was also confirmed by a simulation. Research limitations/implications - Further research should envisage stochastic models and tighter time constraints. Practical implications - Managers can use the algorithm in similar scenarios to address different routing needs. New business activities could be foreseen by starting a logistics scheme of this type. Additionally, new savings in material procurement processes could be achieved in current operations. Social implications - Social responsibility and environmental awareness can be approached by this type of endeavors. While reducing waste disposal, the recovering of these materials yields savings and offer new labor opportunities for people. Originality/value - The "PVA" introduced in this paper, showed substantial advantages. First it automatically determines the visit frequency for each client. Also, it evaluates whether a visit should be granted or not based on its "profitability." The latter ensures that even if the routing circuit is broken at any moment, the company will not lose "profit." Additionally, this research provides performance evaluation in real and simulated scenar
Herein, we present a challenge to the game-theoretical optimization of travel toward the fastest route, which is currently prevailing in most navigation systems. To do so, we depict the game-theoretical limitations of...
详细信息
Herein, we present a challenge to the game-theoretical optimization of travel toward the fastest route, which is currently prevailing in most navigation systems. To do so, we depict the game-theoretical limitations of this optimization method and the problems caused by it. We introduce a new approach to navigation that permits travelers to execute seemingly "irrational" behaviors, and describe how this approach provides a strategic benefit for the individual and the network. We underline the applicability of this approach by providing a functional software architecture. The described system enhances self-benefit and societal-benefit, by promoting individualized utility functions and absorbing the resulting additional complexity.
Efficient search technology is a primary key to peer-to-peer systems. In order to address the inefficient routing problem, a DHT algorithm is presented based on the policy of clustering keys of sharing files. Under th...
详细信息
Efficient search technology is a primary key to peer-to-peer systems. In order to address the inefficient routing problem, a DHT algorithm is presented based on the policy of clustering keys of sharing files. Under the key clustering algorithm, the ring-like key space is divided into two layers. Meanwhile, each node obtains a randomly assigned numeric value as its clustering center in key space. The lower layer, which is called AUT layer, is responsible for managing files' keys. The upper layer, HUB layer, is responsible for maintaining the clustering center of nodes. According to the AUT layer and the HUB layer separately, file keys and node clustering centers discovered from bypassing routing messages are clustered towards the clustering center of local node. The algorithm solves the problems of present unstructured algorithms in some degree, in which the datum is organized in a confused situation and routing is proceed in a disordered manner. Further, the outcome of small-world is used to cut down latency of routing hops. To improve the algorithm, a few connections to remote nodes are introduced with a suitable probability into routing table of clustering keys. In another word, the criterion of clustering is not of determination, but of probability. In this way, it is possible to route overlay network with average latency of O(log2N) hops.
This paper defines the adjacent cost matrix and the path matrix based on the directed weighted-graph, and defines a new operator that 'summarization then minimum' replace 'multiplication then summarization...
详细信息
This paper defines the adjacent cost matrix and the path matrix based on the directed weighted-graph, and defines a new operator that 'summarization then minimum' replace 'multiplication then summarization' between two adjacent cost matrixs, named 'minimum of summarization sequence between two multiplication position elements of the two matrixs'. Based on this new matrix operator, this paper proposes a new algorithm to the shortest path problem within a directed graph. This algorithm can get the global shortest path out for any types of graph. Dijkstra algorithm is a well-known good solution to the shortest path problem, but it will result out a fake path to some kinds of graph. The algorithm presented by this paper completely overcome this phenomena out of Dijikstra algorithm.
This paper studies the problem of degree constrained minimum radius (DCMR) spanning tree in overlay multicast routing. A new heuristic greedy routing algorithm called degree-delay compact tree (DDCT), which is based o...
详细信息
This paper studies the problem of degree constrained minimum radius (DCMR) spanning tree in overlay multicast routing. A new heuristic greedy routing algorithm called degree-delay compact tree (DDCT), which is based on both degree constraints-delay integration and application layer topology optimum strategies, is proposed. The simulation results show that, comparing with similar algorithm having the same computing time complexity, the DDCT algorithm presents better performance all in radius, cost and link's reduplicate packages of the overlay multicast tree.
A Wireless Sensor Network (WSN) consists of large number of small, inexpensive nodes that depend on their sensors, transmission and routing capabilities to collect and disseminate critical data. The energy consumption...
详细信息
ISBN:
(纸本)9781467319706
A Wireless Sensor Network (WSN) consists of large number of small, inexpensive nodes that depend on their sensors, transmission and routing capabilities to collect and disseminate critical data. The energy consumption is a key design criterion for WSN routing algorithms due to the limited availability of energy within network nodes. Hence, energy-efficient routing mechanism is one of the most critical issues in WSNs. In this paper a Biased Random algorithm for Load Balancing (BRALB) in Wireless Sensor Networks for environment monitoring is proposed. It is based on energy biased random walk. It does not require any global information. It uses probability theory to acquire all the information it needs to route packets based on energy resources in each node. It is shown in this paper by using both simulation that BRALB uses the same energy as the shortest path first routing in cases where the message to be sent is comparatively small in size, with the inquiry message among the neighbors. It is also shown to balance the load (i.e. the packets to be sent) among the neighboring nodes.
There have been various routing protocols proposed for static and mobile ad-hoc networks. AODV is an efficient reactive protocol uses traditional routing tables having one entry per destination. An important feature o...
详细信息
ISBN:
(纸本)9781467356039
There have been various routing protocols proposed for static and mobile ad-hoc networks. AODV is an efficient reactive protocol uses traditional routing tables having one entry per destination. An important feature of AODV is the maintenance of time based states in each node;a routing entry not recently used is expired. In case of original AODV, when a link between two nodes fail, AODV issues RREQ control packets for the same destination and tries to find out a new route for it. This regeneration of control packet not only delays the process of data sending but also decreases the throughput of the network. Thus to overcome this decrease in throughput, this proposed approach uses a data structure named 'backup-list' to hold all the active routes for that destination and finds the optimal route. This enhances the packet delivery ratio as well as overall throughput of the network.
The AntNet, a mobile-agent-based routing algorithm for datagram networks, operates by a positive feedback mechanism. This mechanism has the drawback of routing lock. Although the AntNet has a mechanism to counter this...
详细信息
This paper considers the network design and control for multipoint-to-multipoint communications. We propose a new routing control method which includes the member connection method and the route setup algorithm. The f...
详细信息
暂无评论