Abstract
The present paper approaches the loading distribution of trucks for Product Transportation as a rich problem. This is formulated with the classic Bin Packing Problem and five variants associated with a real case of study. A state of the art review reveals that related work deals with three variants at the most. Besides, they do not consider its relation with the vehicle routing problem. For the solution of this new rich problem a heuristic-deterministic algorithm was developed. It works together with a metaheuristic algorithm to assign routes and loads. The results of solving a set of real world instances show an average saving of three vehicles regarding their manual solution; this last needed 180 minutes in order to solve an instance and the actual methodology takes two minutes. On average, the demand was satisfied in 97.45%. As future work the use of a non deterministic algorithm is intended.
This research was supported in part by CONACYT and DGEST.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Toth, P., Vigo, D.: The Vehicle Routing Problem. In: Monographs on Discrete Mathematics and Applications. SIAM, Philadelphia (2001)
Pisinger, D., Ropke, S.: A General Heuristic for Vehicle Routing Problems, tech. report, Dept. of Computer Science, Univ. Copenhagen (2005)
OR/MS Today: Vehicle Routing Software Survey, United States. Institute for Operations Research and the Management Sciences (June 2006)
Cordeau, J.F., Laporte, G., Savelsbergh, M.W.P., Vigo, D.: Short-Haul Routing(submitted)
Gendreau, M., Iori, M., Laporte, G., Martello, S.: A tabu search heuristic for the vehicle routing problem with two-dimensional loading constraints, Networks (to appear)
Balgoh, J., Békési, J., Galambos, G., Reinelt, G.: Lower Bound for The On-line Packing Problem with Restricted Repacking. In: 29th Hungarian Conference of Mathematics, Physics and Computer Science (2005)
Herrera, J.: Development of a methodology based on heuristics for the integral solution of routing, scheduling and loading problems on the distribution and products delivery process. Master’s thesis, Posgrado en Ciencias de la Computación, Instituto Tecnológico de Ciudad Madero, México (2006)
Kang, J., Park, S.: Algorithms for Variable Sized Bin Packing Problem. Proc. Operational Research 147, 365–372 (2003)
Epstein, L.: Online Bin Parking with Cardinality Constraints. In: Proc. 13th European Symposium on Algorithms (2005)
Chan, W., Chin, F.Y.L., Ye, D., Zhang, G., Zhang, Y.: Online Bin Parking of Fragile Objects with Application in Cellular Networks, tech. report, Hong Kong RGC Grant HKU5172/03E (2005)
Verweij, B.: Multiple Destination Bin Packing, tech. report, Algorithms and Complexity in Information Technology (1996)
Manyem, P.: Bin Packing and Covering with Longest Items at The Bottom: Online Version, ANZIAM J.43 (E), pp. E186–E232, Australia. Mathematical Soc. (2002)
Correia, I., Gouveia, L., Saldanha da, G.F.: Solving the Variable Size Bin Packing Problem with Discretized Formulations, Centro de Investigacao Operacional (CIO) - Working Paper (2006)
Cruz, L., González, J., Romero, D., Fraire, H., Rangel, N., Herrera, J., Arrañaga, B., Delgado, F.: A Distributed Metaheuristic for Solving a Real-World Scheduling-Routing-Loading Problem. Lectures Notes in Computer Science, vol. 4742, pp. 68–77. Springer, Heidelberg (2007)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Cruz Reyes, L. et al. (2007). DiPro: An Algorithm for the Packing in Product Transportation Problems with Multiple Loading and Routing Variants. In: Gelbukh, A., Kuri Morales, Á.F. (eds) MICAI 2007: Advances in Artificial Intelligence. MICAI 2007. Lecture Notes in Computer Science(), vol 4827. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-76631-5_103
Download citation
DOI: https://doi.org/10.1007/978-3-540-76631-5_103
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-76630-8
Online ISBN: 978-3-540-76631-5
eBook Packages: Computer ScienceComputer Science (R0)