Skip to main content

Truck Dock Assignment Problem with Operational Time Constraint Within Crossdocks

  • Conference paper
Advances in Applied Artificial Intelligence (IEA/AIE 2006)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 4031))

Abstract

In this paper, we consider a truck dock assignment problem with operational time constraint in crossdocks where the number of trucks exceeds the number of docks available. The objective is to find an optimal assignment of trucks that minimizes the operational cost of the cargo shipments and the total number of unfulfilled shipments. We combine the above two objectives into one term: the total cost, a sum of the total dock operational cost and the penalty cost for all the unfulfilled shipments. The problem is then formulated as an Integer Programming (IP) model. A genetic algorithm (GA), in which the operators relate to the IP model constraints, is then proposed. Computational experiments are conducted, showing that the proposed GA dominates the CPLEX Solver in nearly all test cases adapted from industrial applications.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Aronson, J.E.: A survey on dynamic network flows. Annals of Operations Research 20, 1–66 (1989)

    Article  MATH  MathSciNet  Google Scholar 

  2. Bartholdi, J., Gue, K.: Reducing labor costs in an ltl cross-docking terminal. Operations Research 48, 823–832 (2000)

    Article  Google Scholar 

  3. Ding, H., Lim, A., Rodrigues, B., Zhu, Y.: New heuristics for the over-constrained flight to gate assignments. Journal of the Operational Research Society 55, 760–768 (2004)

    Article  MATH  Google Scholar 

  4. Ding, H., Lim, A., Rodrigues, B., Zhu, Y.: The over-constrained airport gate assignment problem. Computers and Operational Research 32, 1867–1880 (2005)

    Article  MATH  Google Scholar 

  5. Holland, J.H.: Adaptation in Natural and Artifical Systems. University of Michigan Press, Ann Arbor (1975)

    Google Scholar 

  6. Hoppe, B., Tardos, E.: The quickest transshipment problem. Mathematics of Operations Research 25(1), 36–62 (2000)

    Article  MATH  MathSciNet  Google Scholar 

  7. Lim, A., Rodrigues, B., Zhu, Y.: Airport gate scheduling with time windows. Artificial Intelligence Review 24, 5–31 (2005)

    Article  MATH  Google Scholar 

  8. Napolitano, M.: Making the move to cross docking. Warehousing Education and Research Council (2000)

    Google Scholar 

  9. Obata, T.: The quadratic assignment problem: Evaluation of exact and heuristic algorithms. Technical report (2000)

    Google Scholar 

  10. Tsui, L., Chang, C.: Optimal solution to dock door assignment problem. Computers and Indutrial Engineering 23, 283–286 (1992)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Lim, A., Ma, H., Miao, Z. (2006). Truck Dock Assignment Problem with Operational Time Constraint Within Crossdocks. In: Ali, M., Dapoigny, R. (eds) Advances in Applied Artificial Intelligence. IEA/AIE 2006. Lecture Notes in Computer Science(), vol 4031. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11779568_30

Download citation

  • DOI: https://doi.org/10.1007/11779568_30

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-35453-6

  • Online ISBN: 978-3-540-35454-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics