Could you OR whizkids please help me out with this one:
https://stackoverflow.com/questions/61854621/a-good-memoryless-elevator-strategy
Surely somebody has solved this before. How do you classify this problem? A 1D transportation problem? A routing problem? What methods do you recommend for solving it?
Notice that the task isn't given at the outset: People keep arriving all the time pushing buttons saying "come here, I want to go there". Notice also that there is only one elevator.
The object is of course to bring people to their destinations as quickly as possible. The individual shouldn't be trampled down: Each customer must be served within a reasonable time, even if he or she travels in an unusual way.
There are simple evident strategies in common use in old elevators, but they cannot be optimal. I wonder how much room there is for improvement.
First of all I'm looking for a memoryless strategy: The decision should only depend on the current list of orders. The next step will be to explore if you can improve on this by learning from experience.