Computer Science Stack Exchange
Computer Science Stack Exchange

Questions tagged [routing]

58 questions
4
votes
0 answers

Parallel bubble sorting on arbitrary graphs

Are there bubblesort-esque algorithms for sorting on arbitrary graphs? I'm working on a problem in which $k$ robots are placed randomly on a graph and have to reach their respective goals as quickly as possible. The robots can only move one step at…
James Drain
  • 41
  • 1
3
votes
1 answer

Routing algorithm for train network

I am trying to analyse a weighted multi-graph which represents a snapshot of a rail network for a particular day. As such, the vertices of the graph can be considered stations and the weighted edges represent the time taken to travel from one…
Tom
  • 131
  • 3
3
votes
1 answer

Shortest path problem where edge weight depends on path taken

I am attempting to find the most efficient route to get from a source to a destination in a bus network. Each stop is a vertex in a graph, and each edge between vertices represents a route between stops. The weights of the edges represents how long…
Jack Greenhill
  • 133
  • 4
3
votes
1 answer

Unsplittable flow in capacitated networks

I have an undirected network with capacitated links/edges. Between some nodes unsplittable traffic has to be routed. All demands and capacities are known, but it is uncertain if all flows can be routed without capacity violations. This problem…
stefanbschneider
  • 131
  • 2
3
votes
1 answer

How to solve cubing, batching, and routing problem together?

I am working on an order picking project, which requires to cube the items into several totes in a trolley, then batching the totes, followed by parallel aisle picking/routing. The input data has some orders with items. Items have locations, 3…
janicebaratheon
  • 131
  • 2
3
votes
1 answer

Destination-based vs source-based routing

I understand that destination-based routing builds the "route" from the destination backwards to the source (e.g. if using a spanning tree, then the tree is routed at the destination). With source-based routing the opposite is true: the route is…
JB2
  • 141
  • 1
  • 1
  • 4
3
votes
0 answers

Time complexity 2-opt method

I'm doing a practice test for a course on routing problems. There's a question asking to infere the time complexity of the 2-opt method. I can see that the complexity per iteration is in $O(n^2)$ because you need to check all combinations of 2 arcs.…
Thomas Bosman
  • 499
  • 2
  • 9
3
votes
1 answer

Distance Vector Routing Example

Consider a network with five nodes, N1 to N5, as shown as below. The network uses a Distance Vector Routing protocol. Once the routes have been stabilized, the distance vectors at different nodes are as follows. N1: (0,1,7,8,4) N2: (1,0,6,7,3) N3:…
user3767495
  • 329
  • 1
  • 5
  • 14
2
votes
1 answer

Question regarding terminology used to describe Benes networks

I'm studying a routing problem on a cyclic butterfly network. The paper I am reading states that two properties of the cyclic butterfly network make it efficient for the routing algorithm it describes. I'm new to this subject, and I'm struggling to…
foobar
  • 21
  • 1
2
votes
1 answer

route and/or packing optimization algorithm

What type of problem would this question fall under, are there known algorithms/heuristics for it, what would be good resources to learn more about solving it? Given: a list of items each with a destination location: the number of items per…
Cois
  • 21
  • 1
2
votes
0 answers

How to use Clarke and Wright saving algorithm to afford heterogeneous fleet?

I want to solve Heterogeneous fleet in vehicle routing problem using the Clarke and Wright saving algorithm. After reading many literature I found two options: Explicit and early assignment for the route. Using saving algorithm sequentially, and…
Sulistyo Chandrianto
  • 21
  • 4
2
votes
2 answers

Raptor Algorithm: Differences between trip and route

I'm reading Microsoft's white paper "Round-Based Public Transit Routing" (the RAPTOR algorithm). In this algorithm, there are some definitions that I don't understand: About trip: trip represents a sequence of stops a specific vehicle (train, bus, …
Trần Kim Dự
  • 121
  • 3
2
votes
0 answers

How to know for sure that a router is congested?

Suppose a router X is dropping packets. Another router A will investigate whether X is dropping packets due to congestion. What are the procedures that A should follow? A already knows X's buffer capacity. Please explain the procedures and assume…
SrvSsG
  • 21
  • 2
2
votes
1 answer

Route planning for a car driver picking up people using public transport

We just had an interesting though for a routing algorithm for people carpooling. Imagine the following situation: Person 1 is driving with his car from the south of city A to city B far in the north. He is picking up person 2 who is starting in the…
Hurzelchen
  • 123
  • 3
2
votes
0 answers

Best route around confirmed appts - Traveling Salesman Problem

First, I am not a programmer, but an end user. We are trying to come up with a solution to a TSP issue that is causing us SIGNIFICANT time being wasted "manually" routing. Here is the issue. We receive customers to go see. We route, place on the…
user3570728
  • 21
  • 1
1
2 3 4