Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
De Meulemeester, L., Laporte, G., Louveaux, F. et al. Optimal sequencing of skip collections and deliveries. J Oper Res Soc 48, 57–64 (1997). https://doi.org/10.1057/palgrave.jors.2600325
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1057/palgrave.jors.2600325