| Article ID: | iaor19972329 |
| Country: | United Kingdom |
| Volume: | 48 |
| Issue: | 1 |
| Start Page Number: | 57 |
| End Page Number: | 64 |
| Publication Date: | Jan 1997 |
| Journal: | Journal of the Operational Research Society |
| Authors: | Laporte G., De Meulemeester L., Louveaux F.V.Semet, F. |
| Keywords: | transportation: general, programming: transportation |
The purpose of this paper is to model and solve a complex routing problem associated with the collection and delivery of skips. This study is motivated by a real-life problem encountered by a skip rental firm in Belgium. Two simple heuristics as well as an exact enumerative algorithm are developed for the problem. Computational experiments carried out on both randomly generated and real-life data confirm the efficiency of the proposed approach.