On the reformulation of vehicle routing problems and scheduling problems

Beck, J.C., Prosser, P. and Selensky, E. (2002) On the reformulation of vehicle routing problems and scheduling problems. Lecture Notes in Computer Science, 2371, pp. 282-289.



Publisher's URL: http://www.springerlink.com/content/r181nr07ub3h/


We can reformulate a vehicle routing problem (VRP) as an open shop scheduling problem (SSP) by representing visits as activities, vehicles as resources on the factory floor, and travel as set up costs between activities. In this paper we present two reformulations: from VRP to open shop, and the inverse, from SSP to VRP. Not surprisingly, VRP technology performs poorly on reformulated SSP's, as does scheduling technology on reformulated VRP's. We present a pre-processing transformation that "compresses" the VRP, transforming an element of travel into the duration of the visits. The compressed VRP's are then reformulated as scheduling problem, to determine if it is primarily distance in the VRP that causes scheduling technology to degrade on the reformulated problem. This is a step towards understanding the features of a problem that make it more amenable to one technology rather than another.

Item Type:Articles
Glasgow Author(s) Enlighten ID:Prosser, Dr Patrick
Authors: Beck, J.C., Prosser, P., and Selensky, E.
Subjects:Q Science > QA Mathematics > QA75 Electronic computers. Computer science
College/School:College of Science and Engineering > School of Computing Science
Journal Name:Lecture Notes in Computer Science
Copyright Holders:Copyright © 2002 Springer
First Published:First published in Lecture Notes in Computer Science 2371:282-289
Publisher Policy:Reproduced in accordance with the copyright policy of the publisher

University Staff: Request a correction | Enlighten Editors: Update this record