I am searching for algorithm and jsprit or optaplanner project seems to be in order to resolve my problem. We only work with Java. I have take a look at jsprit bicycle example, an entry point, and now I need to solve a problem arround patient transportation.
- A stretcher can carry a bed, a wheelchair or a valid patient. He can carry a wheelchair and a valid at the same time if they go to the same area and come from a same area.
- for long distance, a bed require 2 stretchers
- a bed mover (a kind of electric truck fixed to the bed) replace 1 stretcher
- bed movers are most efficient for long distance but may be use for short too
- a bed mover only helps for bed (nor for wheelchair nor valid patient)
- when finish, the bed mover stays in place or returns empty to a park area (maybe 1..n places)
General rules :
- the total time of transportation per agent must be as equals as possible as each others (equity)
- transports are time windowed and delay must be as short as possible (depending on priorities)
- new transport requests comes every time
- it's better to use bed movers than 2 stretchers
Can you give me how to start to resolve this kind of problem. Do you think it's possible?
Regards
