Jharkhand Sampark Kranti Express

The 12825 / 12826 Jharkhand Sampark Kranti Express was introduced along with others Sampark Kranti Expresses during 2003-04.

Jharkhand Sampark Kranti Express
झारखंड सम्पर्क क्रांति एक्सप्रेस
Overview
Service typeSampark Kranti Express
First service22 March 2005
Current operator(s)South Eastern Railways
Route
StartRanchi Junction (RNC)
Stops7
EndAnand Vihar Terminal (ANVT)
Distance travelled1,296 km (805 mi)
Average journey time21hrs 05mins
Service frequencyBi-weekly
Train number(s)12825 / 12826
On-board services
Class(es)AC 2 Tier, AC 3 Tier, Sleeper Class, General Unreserved
Seating arrangementsYes
Sleeping arrangementsYes
Catering facilitiesAvailable
Observation facilitiesLarge windows
Baggage facilitiesAvailable
Technical
Rolling stockLHB Coaches
Track gauge1,676 mm (5 ft 6 in)
Broad Gauge
Operating speed61 km/h (38 mph) average including halts
Route map

Service

Jharkhand Sampark Kranti Express runs twice a week from Ranchi to New Delhi, the capital of India. This train runs via the Grand Chord route. Like others this train too connects to the national capital.

Time-Table

  • No. 12825 departs from Ranchi Junction at 23:40 and arrives Anand Vihar Terminal at 19:10.
  • No. 12826 departs from Anand Vihar Terminal at 7:00 and arrives Ranchi Junction at 4:05.

Route & Halts

Coach composition

  • SLR-2, 2AC-1, 3AC-1, SL-5, PC-1, GEN-4

On the entire route, the train is hauled by a WAP 7 locomotive of Ghaziabad shed.

gollark: Ridiculous. We *need* to be able to break maths in a snippet of code.
gollark: Here is a copy of the code I don't understand from the old version:```lualocal function descend(intermediateFn, terminalFn, i) local pattern = patterns[i] if pattern then intermediateFn(pattern) local pqty = pattern.qty -- Qty keys must be removed from the pattern for collation -- Otherwise, it shows up as a number stuck in the items needed table, which is bad. pattern.qty = nil local needs = util.collate(pattern) pattern.qty = pqty local has = {} for slot, item in pairs(pattern) do if util.satisfied(needs, has) then break end if patterns[item] then descend(intermediateFn, terminalFn, item) has[item] = (has[item] or 0) + (patterns[item].count or 1) end end else terminalFn(i) endendlocal function cost(i) local items = {} descend(function() end, function(i) table.insert(items, i) end, i) return util.collate(items)endlocal function tasks(i) local t = {} descend(function(pat) table.insert(t, pat) end, function() end, i) return tend```
gollark: Also, implementing whatever is done internally for finding free space to transfer to is hard!
gollark: I'm unlikely to have stupidly large autocrafting trees.
gollark: As long as it doesn't take more than a second it fits within my performance goals.
This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.