Abstract
In this paper, we study a real-world variant of the Vehicle Routing Problem, arising from the work of distributing products of an industrial corporation. Given information about vehicles, depots, types of products, and the location of customers, we wish to determine the minimum number of vehicles required to pick up and deliver products to customers within a time limit. Using these vehicles, we are interested in a routing plan that minimizes the total travelling time. Our proposed solution is presented as follows: First, we introduce an exact algorithm using dynamic programming; Second, by relaxing dynamic programming formulation, we give a heuristic algorithm; Third, we provide our experimental results of the heuristic algorithm on real-world datasets provided by the corporation and highlight the effectiveness of the proposed algorithm.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Novoa, C., Storer, R.: An approximate dynamic programming approach for the vehicle routing problem with stochastic demands. European Journal of Operational Research 196, 509–515 (2009)
Leendert, K., Manuel, M., Herbert, K., Marco, J.: Dynamic Programming Algorithm for the Vehicle Routing Problem with Time Windows and EC Social Legislation. Beta Research School for Operations Management and Logistics, University of Twente (2009)
Christofides, N., Mingozzi, A., Toth, P.: State-space relaxation procedures for the computation of bounds to routing problems. Networks 11(2), 145–164 (1981)
Secomandi, N.: Exact and heuristic dynamic programming algorithms for the vehicle routing problem with stochastic demands. Doctoral Thesis, University of Houston (1998)
Eilon, S., Watson-Gandy, C.D.T., Christofides, N., de Neufville, R.: Distribution Management-Mathematical Modelling and Practical Analysis. IEEE Transactions on Systems, Man and Cybernetics, 589–589 (1974)
Bellman, R.: Dynamic Programming Treatment of Travelling Salesman Problem. Journal of the ACM 9(1), 61–63 (1962)
Bellman, R.: Dynamic Programming. Princeton University Press, Princeton (2003) (Republished)
Lenstra, J.K., Kan, A.H.G.R.: Complexity of vehicle routing and scheduling problems. Networks 11, 221–227 (1981)
Dantzig, G.B., Ramser, J.H.: The truck dispatching problem. Management Science 6(1), 80–91 (1959)
Golden, B.L., Assad, A.A., Wasil, E.A.: Routing vehicles in the real world: applications in the solid waste, beverage, food, dairy, and newspaper industries. In: The Vehicle Routing Problem, Society for Industrial and Applied Mathematics. SIAM Monographs on Discrete Mathematics and Applications, pp. 245–286. SIAM, Philadelphia (2001)
Ortega, P., Oliva, C., Ferland, J., Cepeda, M.: Multiple ant colony system for a VRP with time windows and scheduled loading. Ingeniare, Revista chilena de ingenieria 17, 393–403 (2009)
Laporte, G.: Fifty years of vehicle routing. Transportation Science 43(4), 408–416 (2009)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Trinh, K., Dang, N., Dinh, T. (2011). An Approximation Approach for a Real–World Variant of Vehicle Routing Problem. In: Nguyen, N.T., Trawiński, B., Jung, J.J. (eds) New Challenges for Intelligent Information and Database Systems. Studies in Computational Intelligence, vol 351. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-19953-0_9
Download citation
DOI: https://doi.org/10.1007/978-3-642-19953-0_9
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-19952-3
Online ISBN: 978-3-642-19953-0
eBook Packages: EngineeringEngineering (R0)