Skip to main content

Research Repository

Advanced Search

The capacity-C torch problem

Backhouse, Roland; Truong, Tan Minh

Authors

Roland Backhouse roland.backhouse@nottingham.ac.uk

Tan Minh Truong



Abstract

The torch problem (also known as the bridge problem or the flashlight problem) is about getting a number of people across a bridge as quickly as possible under certain constraints. Although a very simply stated problem, the solution is surprisingly non-trivial. The case in which there are just four people and the capacity of the bridge is two is a well-known puzzle, widely publicised on the internet. We consider the general problem where the number of people, their individual crossing times and the capacity of the bridge are all input parameters. We present two methods to determine the shortest total crossing time: the first expresses the problem as an integer-programming problem that can be solved by a standard linear-programming package, and the second expresses the problem as a shortest-path problem in an acyclic directed graph, i.e. a dynamic-programming solution. The complexity of the integer-programming solution is difficult to predict; its main purpose is to act as an independent test of the correctness of the results returned by the second solution method. The dynamic-programming solution has best- and worst-case time complexity proportional to the square of the number of people. An empirical comparison of the efficiency of both methods is also presented. This manuscript has been accepted for publication in Science of Computer Programming. The manuscript has undergone copyediting, typesetting, and review of the resulting proof before being published in its final form. Please note that during the production process errors may have been discovered which could affect the content, and all disclaimers that apply to the journal apply to this manuscript.

Journal Article Type Article
Publication Date May 1, 2015
Journal Science of Computer Programming
Print ISSN 0167-6423
Electronic ISSN 0167-6423
Publisher Elsevier
Peer Reviewed Peer Reviewed
Volume 102
APA6 Citation Backhouse, R., & Truong, T. M. (2015). The capacity-C torch problem. Science of Computer Programming, 102, doi:10.1016/j.scico.2015.01.003
DOI https://doi.org/10.1016/j.scico.2015.01.003
Keywords Algorithmic problem solving; Dynamic programming; Linear programming; Integer programming; Optimisation
Publisher URL http://www.sciencedirect.com/science/article/pii/S0167642315000118
Copyright Statement Copyright information regarding this work can be found at the following address: http://creativecommons.org/licenses/by-nc-nd/4.0

Files

TorchProblemSent.pdf (326 Kb)
PDF

Copyright Statement
Copyright information regarding this work can be found at the following address: http://creativecommons.org/licenses/by-nc-nd/4.0





Downloadable Citations

;