Advertisement

DiPro: An Algorithm for the Packing in Product Transportation Problems with Multiple Loading and Routing Variants

  • Laura Cruz Reyes
  • Diana M. Nieto-Yáñez
  • Nelson Rangel-Valdez
  • Juan A. Herrera Ortiz
  • J. González B
  • Guadalupe Castilla Valdez
  • J. Francisco Delgado-Orta
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4827)

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.

Keywords

Vehicle Route Problem Metaheuristic Algorithm Assignment Module Balance Module Construction Module 
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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Toth, P., Vigo, D.: The Vehicle Routing Problem. In: Monographs on Discrete Mathematics and Applications. SIAM, Philadelphia (2001)Google Scholar
  2. 2.
    Pisinger, D., Ropke, S.: A General Heuristic for Vehicle Routing Problems, tech. report, Dept. of Computer Science, Univ. Copenhagen (2005)Google Scholar
  3. 3.
    OR/MS Today: Vehicle Routing Software Survey, United States. Institute for Operations Research and the Management Sciences (June 2006)Google Scholar
  4. 4.
    Cordeau, J.F., Laporte, G., Savelsbergh, M.W.P., Vigo, D.: Short-Haul Routing(submitted)Google Scholar
  5. 5.
    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)Google Scholar
  6. 6.
    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)Google Scholar
  7. 7.
    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)Google Scholar
  8. 8.
    Kang, J., Park, S.: Algorithms for Variable Sized Bin Packing Problem. Proc. Operational Research 147, 365–372 (2003)zbMATHCrossRefMathSciNetGoogle Scholar
  9. 9.
    Epstein, L.: Online Bin Parking with Cardinality Constraints. In: Proc. 13th European Symposium on Algorithms (2005)Google Scholar
  10. 10.
    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)Google Scholar
  11. 11.
    Verweij, B.: Multiple Destination Bin Packing, tech. report, Algorithms and Complexity in Information Technology (1996)Google Scholar
  12. 12.
    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)Google Scholar
  13. 13.
    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) Google Scholar
  14. 14.
    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)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2007

Authors and Affiliations

  • Laura Cruz Reyes
    • 1
  • Diana M. Nieto-Yáñez
    • 1
  • Nelson Rangel-Valdez
    • 1
  • Juan A. Herrera Ortiz
    • 1
  • J. González B
    • 1
  • Guadalupe Castilla Valdez
    • 1
  • J. Francisco Delgado-Orta
    • 1
  1. 1.Instituto Tecnológico de Ciudad MaderoMéxico

Personalised recommendations