Abstract
We consider a company that has to satisfy customers' pick-up requests arriving over time every day. The overall objective of the company is to serve as many requests as possible at a minimum operational cost. When organizing its business the company has to fix some features of the service that may affect both service quality and operational costs. Some of these features concern the time a request is taken into account to plan its service, the associated deadline and the way requests are managed when the system is overloaded. In this paper we analyse several policies that can be implemented by the management of a carrier company in a multi-period context. For example, a company might reject all the requests that cannot be feasibly scheduled or accept all the requests and rely on a backup service in order to serve requests that are difficult to handle. Another interesting issue considered in this paper is the impact of collaborative service where two or more carrier companies, with their own customers, decide to share customers in order to optimize the overall costs. We set up a general framework to allow comparison of alternative service policies. Extensive computational results evaluating the number of lost requests and the distance travelled provide interesting insights.
Similar content being viewed by others
References
Angelelli E, Savelsbergh MWP and Speranza MG (2007a). Competitive analysis for dynamic multi-period uncapacitated routing problems . Networks 49: 308–317.
Angelelli E, Savelsbergh MWP and Speranza MG (2007b). Competitive analysis of a dispatch policy for a dynamic multi-period routing problem . Opns Res Lett 35: 713–721.
Angelelli E, Bianchessi N, Mansini R and Speranza MG (2008a). Management policies in a dynamic multi-period routing problem . In: Bertazzi L, van Nunen J and Speranza MG (eds). Innovation in Distribution Logistics, Lecture notes in Economics and Mathematical Systems. Springer-Verlag: Berlin in press.
Angelelli E, Bianchessi N, Mansini R and Speranza MG (2008b). Short term strategies for a dynamic multi-period routing problem. Transport Res C 17: 106–119.
Gendreau M, Guertin F, Potvin J-Y and Taillard E (1999). Parallel tabu search for real-time vehicle routing and dispatching . Transport Sci 33: 381–390.
Ghiani G, Guerriero F, Laporte G and Musmanno R (2003). Real-time vehicle routing: Solution concepts, algorithms and parallel computing strategies . Eur J Opl Res 151: 1–11.
Ichoua S, Gendreau M and Potvin J-Y (2000). Diversion issues in real-time vehicle dispatching . Transport Sci 34: 426–438.
Madsen OBG, Ravn HF and Rygaard JM (1995). A heuristic algorithm for a dial-a-ride problem with time windows, multiple capacities and multiple objectives . Ann Opns Res 60: 193–208.
Mitrović-Minić S and Laporte G (2004). Waiting strategies for the dynamic pickup and delivery problem with time windows . Transport Res B 38: 635–655.
Mitrović-Minić S, Krishnamurti R and Laporte G (2004). Double-horizon based heuristics for the dynamic pickup and delivery problem with time windows. Transport Res B 38: 669–685.
Psaraftis HN (1995). Dynamic vehicle routing: Status and prospects . Ann Opns Res 61: 143–164.
Psaraftis HN (1998). Dynamic vehicle routing problems . In: Golden BL and Assad AA (eds). Vehicle Routing: Methods and Studies. Elsevier Science: Amsterdam, pp. 223–248.
Savelsbergh MWP and Sol M (1998). Drive: Dynamic routing of independent vehicles . Opns Res 46: 474–490.
Solomon MM (1987). Algorithms for the vehicle routing and scheduling problems with time window constraints . Opns Res 35: 254–266.
Yang J, Jaillet P and Mahmassani H (2004). Real-time multivehicle truckload pickup and delivery problems . Transport Sci 38: 135–148.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Angelelli, E., Bianchessi, N., Mansini, R. et al. Comparison of policies in dynamic routing problems. J Oper Res Soc 61, 686–695 (2010). https://doi.org/10.1057/jors.2009.17
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1057/jors.2009.17