Evolutionary System with Precedence Constraints for Ore Harbor Schedule Optimization

  • André V. Abs da Cruz
  • Marley M. B. R. Vellasco
  • Marco Aurélio C. Pacheco
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4974)


This work proposes and evaluates an evolutionary system using genetic algorithms and directed graphs for the optimization of a scheduling problem for ore loading of ships in a harbor. In this kind of problem, some tasks are constrained in such a way that they must be planned or executed before others. For this reason, the use of conventional evolutionary models, such as genetic algorithms with an order-based representation, might generate invalid solutions which can not be penalized, needing to be discarded or corrected, leading to a loss in performance. To overcome this problem, we use a hybrid system, based on directed graphs, to allow better handling of the precedence constraints. Results obtained show performances almost 3 times better than a non-trivial search algorithm.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Bergvinsdottir, K.B., Larsen, J., Jorgensen, R.M.: Solving the dial-a-ride problem using genetic algorithms. Technical report, Danmarks Tekniske Universitet (2004)Google Scholar
  2. 2.
    Moon, C., Kim, J., Choi, G., Seo, Y.: An efficient genetic algorithm for the traveling salesman problem with precedence constraints. European Journal of Operational Research 140, 606–617 (2002)MATHCrossRefMathSciNetGoogle Scholar
  3. 3.
    da Cruz, A.V.A.: Schedule optimization with precedence constraints using genetic algorithms and cooperative co-evolution. Master’s thesis, Pontifical Catholic University of Rio de Janeiro (March 2003)Google Scholar
  4. 4.
    Savelsbergh, M., Sol, M.: The general pickup and delivery problem. Transportation Science (29), 17–29 (1995)MATHGoogle Scholar
  5. 5.
    Renaud, J., Boctor, F.F., Quenniche, J.: A heuristic for the pickup and delivery travelling salesman problem. Computers and Operations Research 27, 905–916 (2000)MATHCrossRefMathSciNetGoogle Scholar
  6. 6.
    Mingozzi, A., Bianco, L., Ricciardelli, A.: Dynamic programming strategies for the tsp with time windows and precedence constraints. Operations Research 45, 365–377 (1997)MATHMathSciNetCrossRefGoogle Scholar
  7. 7.
    Fagerholt, K., Christiansen, M.A.: Travelling salesman problem with allocation, time window and precedence constraints – an application to ship scheduling. Intl. Trans. Operations Research 7, 231–244 (2000)CrossRefMathSciNetGoogle Scholar
  8. 8.
    Michalewicz, Z.: Genetic Algorithms + Data Structures = Evolution Programs, 3rd edn. Springer, Heidelberg (1996)MATHGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2008

Authors and Affiliations

  • André V. Abs da Cruz
    • 1
  • Marley M. B. R. Vellasco
    • 1
  • Marco Aurélio C. Pacheco
    • 1
  1. 1.Applied Computational Intelligence Lab Electrical Engineering DepartmentPontifical Catholic University of Rio de JaneiroRio de JaneiroBrazil

Personalised recommendations