Hi' I am doing train scheduling system for my final year project. i am using NetBeans IDE. I am mainly focus on addressing Train crossing and overtaking problems. have to consider single line and double line both. please help me in algorithms. What are the algorithms i can use and easy to implement in java.
A quick Google for "train scheduling algorithm" got the usual million plus hits. Have you tried any of those? I'm pretty sure the math is going to go over my head in a hurry, so I hope you're in a better position to pick one.
Once you get into design & coding activities, post your "work in progress." The Ranch works best at helping you when you've made a good attempt and gotten stuck. Then we know exactly what is troubling you.
Keep it fun and let us know how things go!
A good question is never answered. It is not a bolt to be tightened into place but a seed to be planted and to bear more seed toward the hope of greening the landscape of the idea. John Ciardi
Did your professor say if train scheduling is NP-Hard? Which doesn't mean you can't solve it, just that you have to keep N small.
Once you get some code up, I'll share my theory that World War 1 was caused by train schedules.
Joined: Sep 17, 2006
I'll share my theory that World War 1 was caused by train schedules.
Little does the poster know.
I have a copy of Kenneth C. Louden's COMPILER CONSTRUCTION Principles and Practice - I made a small attempt at getting started on one today when I got tired of trying to match brackets in Notepad and decided my skills were up to using a LineNumberReader. Sadly, I ran out of time straightening out the BufferedByteArrayWriter from last night's start and the futility of the hung thread on legacy 16-bit cli code.
Can, will you give us a formal - nonStuffy definition of what exactly the "N-P Complete" problem is: The historical and thought basis of the problem. Known solutions and approaches to the problem or general classes of approach. What approaches would you suggest for our original poster ?
What does one do to establish Time, as an element of the system ? By the use of a simple integral numeric as a counter ?
How does one account for travel time in a traversal of Node(n) to Node(n+1)? Or, bettter yet, allow for indeterminate small scale variations in time without distrubing the overall robustness of the process in the face of a page demand algorithm written by proprietary vendors who will not release the sources, nor allow keen observation of their work - such as in the BlackBox paradigm ?
Allow for some resonable first solution to lookahead that avoids crosslock and it's consequent deadlock on the coffin of the coffee house ?
Would you suggest float/double values for the general case to to avoid the problematic loss of convexity in the application of decomposition methods to integral modeling of deterministic dynamic programming ? I.O.W. ~ suggest whether the fp approach taken by greenfoot dot org leads to unforseen weakness elsewhere such as the arrival of two transports on the same level and node being not well modeled by a floating numeric.
[ September 21, 2007: Message edited by: Nicholas Jordan ]
"The differential equations that describe dynamic interactions of power generators are similar to that of the gravitational interplay among celestial bodies, which is chaotic in nature."