Advertisement

Truck Dock Assignment Problem with Operational Time Constraint Within Crossdocks

  • Andrew Lim
  • Hong Ma
  • Zhaowei Miao
Part of the Lecture Notes in Computer Science book series (LNCS, 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.

Keywords

Genetic Algorithm Penalty Cost Quadratic Assignment Problem Integer Program Model Operational Time Constraint 
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.
    Aronson, J.E.: A survey on dynamic network flows. Annals of Operations Research 20, 1–66 (1989)CrossRefMATHMathSciNetGoogle Scholar
  2. 2.
    Bartholdi, J., Gue, K.: Reducing labor costs in an ltl cross-docking terminal. Operations Research 48, 823–832 (2000)CrossRefGoogle Scholar
  3. 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)CrossRefMATHGoogle Scholar
  4. 4.
    Ding, H., Lim, A., Rodrigues, B., Zhu, Y.: The over-constrained airport gate assignment problem. Computers and Operational Research 32, 1867–1880 (2005)CrossRefMATHGoogle Scholar
  5. 5.
    Holland, J.H.: Adaptation in Natural and Artifical Systems. University of Michigan Press, Ann Arbor (1975)Google Scholar
  6. 6.
    Hoppe, B., Tardos, E.: The quickest transshipment problem. Mathematics of Operations Research 25(1), 36–62 (2000)CrossRefMATHMathSciNetGoogle Scholar
  7. 7.
    Lim, A., Rodrigues, B., Zhu, Y.: Airport gate scheduling with time windows. Artificial Intelligence Review 24, 5–31 (2005)CrossRefMATHGoogle Scholar
  8. 8.
    Napolitano, M.: Making the move to cross docking. Warehousing Education and Research Council (2000)Google Scholar
  9. 9.
    Obata, T.: The quadratic assignment problem: Evaluation of exact and heuristic algorithms. Technical report (2000)Google Scholar
  10. 10.
    Tsui, L., Chang, C.: Optimal solution to dock door assignment problem. Computers and Indutrial Engineering 23, 283–286 (1992)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Andrew Lim
    • 1
    • 2
  • Hong Ma
    • 1
  • Zhaowei Miao
    • 1
    • 2
  1. 1.Dept of Industrial Engineering and Logistics ManagementHong Kong Univ of Science and TechnologyKowloon, Hong Kong
  2. 2.School of Computer Science & EngineeringSouth China University of TechnologyGuang DongPR China

Personalised recommendations