Abstract
In this paper, the Capacitated Vehicle Routing Problem is extended to the case where each vehicle is restricted to an additional minimal starting or returning load constraint. We refer to this extension as the Minimal Load Constrained Vehicle Routing Problem. We present integer programming formulations for single and multidepot cases. An illustrative example is also provided to show how a decision maker can use the proposed formulation as an aid in distribution planning.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Achuthan, N.R., Caccetta, L., Hill, S.P.: A New Subtour Elimination Constraint for the Vehicle Routing Problem. European Journal of Operational Research 91, 573–586 (1996)
Toth, P., Vigo, D.: The Vehicle Routing Problem. SIAM Monographs on Discrete Mathematics and Applications (2002)
Ralphs, T.K.: Parallel Branch and Cut for Capacitated Vehicle Routing. Parallel Computing 29, 607–629 (2003)
Dantzig, G.B., Ramser, J.H.: The Truck Dispatching Problem. Management Science 6, 80–91 (1959)
Jozefowiez, N., Semet, F., Talbi, E.: Parallel and Hybrid Models for Multi-Objective Optimization: Application to Vehicle Routing Problem. In: Guervós, J.J.M., Adamidis, P.A., Beyer, H.-G., Fernández-Villacañas, J.-L., Schwefel, H.-P. (eds.) PPSN 2002. LNCS, vol. 2439, pp. 271–280. Springer, Heidelberg (2002)
Lee, T., Ueng, J.: A Study of Vehicle Routing Problems with Load-Balancing. International Journal of Physical Distribution and Management 29, 646–658 (1999)
Clarke, G., Wright, J.: Scheduling of Vehicles from a Central Depot to a Number of Delivery Points. Operations Research 12, 568–581 (1964)
Golden, B.L., Magnanti, T.L., Nguyen, H.Q.: Implementing Vehicle Routing Algorithms. Networks 7, 113–148 (1977)
Dantzig, G.B., Fulkerson, D.R., Johnson, S.M.: Solution of a Large Scale Traveling Salesman Problem. Operations Research 2, 393–410 (1954)
Laporte, G., Nobert, Y.: A Branch and Bound Algorithm for the Capacitated Vehicle Routing Problem. OR Spektrum 5, 77–85 (1983)
Kulkarni, R.V., Bhave, P.R.: Integer Programming Formulations of Vehicle Routing Problems. European Journal of Operational Research 20, 58–67 (1985)
Miller, C.E., Tucker, A.W., Zemlin, R.A.: Integer Programming Formulations and Traveling Salesman Problems. Journal of the Association for Computing Machinery 7, 326–329 (1960)
Desrochers, M., Laporte, G.: Improvements and Extensions to the Miller-Tucker-Zemlin Subtour Elimination Constraints. Operations Research Letters 10, 27–36 (1991)
Kara, İ., Laporte, G., Bektaş, T.: A Note on the Lifted Miller-Tucker-Zemlin Subtour Elimination Constraints for the Capacitated Vehicle Routing Problem. European Journal of Operational Research 158, 793–795 (2004)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kara, İ., Bektaş, T. (2005). Minimal Load Constrained Vehicle Routing Problems. In: Sunderam, V.S., van Albada, G.D., Sloot, P.M.A., Dongarra, J.J. (eds) Computational Science – ICCS 2005. ICCS 2005. Lecture Notes in Computer Science, vol 3514. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11428831_24
Download citation
DOI: https://doi.org/10.1007/11428831_24
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-26032-5
Online ISBN: 978-3-540-32111-8
eBook Packages: Computer ScienceComputer Science (R0)