I was considering how to model the following problem mathematically and was wondering what you thought the best way to do it is.
"A takes 1 minute to cross a bridge, B takes 2 minutes, C takes 5 minutes, D takes 10 minutes. They can cross up to two at a time. Each group needs to have a torch (of which there is only one) with them - meaning that the torch needs to be taken back for the next group to cross. How should the trips be organised such that the total time taken for the group to cross is minimised?"
I can only think of a computationally expensive numerical method where one tries each combination of trips in turn (applying appropriate constraints, such as that A needs to be at the beginning in order to travel from the beginning to the end or that the current combination should be abandonned when the total time exceeds the past best time) and records the combination when it performs better than the past best.
Presumably there are more efficient numerical, and/or more effective non-numerical modelling methods that exist to solve the problem?
Thanks in advance for your contribution.