3,694 research outputs found
PUBLICATION TYPE: Journal DATE: 2003 FINAL CITATION: “Digital Reference Triage: An Investigation using the Delphi Method into the Factors Influencing Question Routing and Assignment. ” Pomerantz, J.,
No full textPomerantz, J., Nicholson, S., & Lankes, R. D. Digital reference triage: An in... Delphi method into the factors influencing question routing and assignment
Should QoS routing algorithms prefer shortest paths?
No full textMultimedia traffic and real-time e-commerce applications can experience quality degradation in traditional networks such as the Internet. These difficulties can be overcome in networks which feature dynamically set up paths with bandwidth and delay guarantees. The problem of selecting such constrained paths is the task of quality of service (QoS) routing. This paper considers link-state routing, and the choice of cost metric used to implement QoS routing. There are two schools of thought regarding the choice of link cost. It is commonly assumed that QoS routing algorithms should limit hop count so as to conserve resources for future connections. Others advocate load balancing mechanisms so as to increase overall network utilisation. This paper investigates which of these approaches gives the better performance. We show that there is no one general answer to this question. We also point out the dangers of drawing general conclusions about routing algorithm performance based on the study of only a limited set of network topologies
MANAGEMENT OF ROUTING AND SCHEDULING COMPANY TRUCKS
No full textThe author describes the use of the "Lokset method" for routing and scheduling deliveries, with special emphasis on data requirement.Agribusiness,
Cross-Platform Expertise Characterization for Question Routing
No full textCommunity Question-Answer(CQA) services are online portals with a community of people that share similar interests, and post question-answers for solving the difficulties they have. These services have huge social impact and have become a place where knowledge is created and distributed. Despite the advances in Question Routing and Recommendation Systems, CQA still struggles in handling large number of unanswered questions and suffer with the quality of answers provided in general. An effective solution to tackle this problem is to consider the expertise of users when routing a question to its potential answerers. There are many existing methods for measuring expertise but they tend to favour more active users rather than expert users. To address this problem, we look into cross-platform behaviour of a user and incorporate his cross-platform expertise. We provide insights into performance of question routing with this method. We perform an extensive literature survey about the CQA system, question routing, recommendation systems and types of expertise, to map a users' cross-platform behavior with a certain type of expertise. We propose a methodology to match users across multiple platforms, with which we measure expertise according to mapped user behaviour on those platforms. Finally we estimate the reliability of expertise measurement when applied to question routing. We study and discuss the effect of parameters such as division of data into training and test set sizes and use factorization machine for recommendation system.Computer Scienc
The Vehicle Routing Problem with Divisible Deliveries and Pickups
No full textThe vehicle routing problem with divisible deliveries and pickups is a new and interesting model within
reverse logistics. Each customer may have a pickup and delivery demand that have to be served with
capacitated vehicles. The pickup and the delivery quantities may be served, if beneficial, in two separate visits.
The model is placed in the context of other delivery and pickup problems and formulated as a mixed-integer
linear programming problem. In this paper, we study the savings that can be achieved by allowing the pickup
and delivery quantities to be served separately with respect to the case where the quantities have to be served
simultaneously. Both exact and heuristic results are analysed in depth for a better understanding of the problem
structure and an average estimation of the savings due to the possibility of serving pickup and delivery
quantities separately
Ask the Right Expert: Question Routing based on User Expertise in Web Questions Answering Systems
No full textQuestion Routing systems aim at routing questions to users that are more suited to answer them. Different techniques are used to match candidate users to questions, by considering properties of both. Existing techniques however do not consider the expertise of the candidate. This work proposes an approach to Question Routing in which the user expertise is considered for question routing purposes. The proposed approach is a three stage process which allows for different configurations of existing matching techniques and user expertise. An experiment is set up in order to compare different Question Routing configurations. In total thirteen different configurations are evaluated, all based on three different content-based baseline methods. Stack Overflow is used as the source for questions, answers and users for the evaluation of the performance of different Question Routing configurations. A dataset containing 6 months worth of questions is used for the evaluation. The results show that incorporating expertise into Question Routing algorithms can provide significant performance increase.Web Information SystemsSoftware TechnologyElectrical Engineering, Mathematics and Computer Scienc
Intention-Aware Routing to Minimise Delays at Electric Vehicle Charging Stations
No full textEn-route charging stations allow electric vehicles to greatly extend their range. However, as a full charge takes a considerable amount of time, there may be significant waiting times at peak hours. To address this problem, we propose a novel navigation system, which communicates its intentions (i.e., routing policies) to other drivers. Using these intentions, our system accurately predicts congestion at charging stations and suggests the most efficient route to its user. We achieve this by extending existing time-dependent stochastic routing algorithms to include the battery's state of charge and charging stations. Furthermore, we describe a novel technique for combining historical information with agent intentions to predict the queues at charging stations. Through simulations we show that our system leads to a significant increase in utility compared to existing approaches that do not explicitly model waiting times or use intentions, in some cases reducing waiting times by over 80% and achieving near-optimal overall journey times.Software and Computer TechnologyElectrical Engineering, Mathematics and Computer Scienc
The impact of mobility models on the performance of mobile Ad Hoc network routing protocol
No full textA mobility model represents nodes distribution and movement over the network. Several research works have shown that a selection of mobility model can affect the outcome of routing performance simulation in Mobile Ad Hoc Networks. Thus, a routing protocol may only be effective in a particular mobility model or scenario but performs inferiorly in another. As a result, analyses of routing protocol performance are often based on inadequate information leading to inaccurate argument and conclusion. In this paper, three different mobility models have been selected, where each of them is highly distinctive in terms of nodes movement behavior. In addition, a new measurement technique called probability of route connectivity is introduced. The technique is used to quantify the success rate of route established by a routing protocol. Extensive simulation runs are done and results are compared between each mobility model
Genetic algorithms with immigrants and memory schemes for dynamic shortest path routing problems in mobile ad hoc networks
No full textThis article is posted here with permission of IEEE - Copyright @ 2010 IEEEIn recent years, the static shortest path (SP) problem has been well addressed using intelligent optimization techniques, e.g., artificial neural networks, genetic algorithms (GAs), particle swarm optimization, etc. However, with the advancement in wireless communications, more and more mobile wireless networks appear, e.g., mobile networks [mobile ad hoc networks (MANETs)], wireless sensor networks, etc. One of the most important characteristics in mobile wireless networks is the topology dynamics, i.e., the network topology changes over time due to energy conservation or node mobility. Therefore, the SP routing problem in MANETs turns out to be a dynamic optimization problem. In this paper, we propose to use GAs with immigrants and memory schemes to solve the dynamic SP routing problem in MANETs. We consider MANETs as target systems because they represent new-generation wireless networks. The experimental results show that these immigrants and memory-based GAs can quickly adapt to environmental changes (i.e., the network topology changes) and produce high-quality solutions after each change.This work was supported by the Engineering
and Physical Sciences Research Council of U.K. underGrant EP/E060722/
Optimal beaconing control for epidemic routing in delay tolerant networks
No full textOwing to the uncertainty of transmission opportunities between mobile nodes, the routing in delay-tolerant networks (DTNs) exploits the mechanism of opportunistic forwarding. Energy-efficient algorithms and policies for DTN are crucial to maximizing the message delivery probability while reducing the delivery cost. In this contribution, we investigate the problem of energy-efficient optimal beaconing control in a DTN. We model the message dissemination under variable beaconing rate with a continuous-time Markov model. Based on this model, we then formulate the optimization problem of the optimal beaconing control for epidemic routing and obtain the optimal threshold policy from the solution of this optimization problem. Furthermore, through extensive numerical results, we demonstrate that the proposed optimal threshold policy significantly outperforms the static policy with constant beaconing rate in terms of system energy consumption savings
- …
