Take a look at the new version of this page: [ beta version ]. Tell us what you think.

ABSTRACT

The transportation planning (TP) is well-known basic network problem. However, for some real-world applications, it is often that the TP model is extended to satisfy other additional constraints or performed in several stages. In this study, we formulate the two-stage transportation planning with inventory and exclusionary side constraints (esc-2ITP). In this model, one week divided into some terms and the annual demands of delivery centers are satisfied for each them and it includes the additional constraint in which the simultaneous shipments between some plants are prohibited. To solve the problem, we propose the hybrid Genetic Algorithms (h-GA) approach by using a priority-based encoding method.

REFERENCES

• 1: M. Gen, R. W. Cheng and L. Lin, "Network Models and Optimization: Multiobjective Genetic Algorithm Approach", Springer, In Press, 2008.
• 2: M. Sun, "The transportation problem with exclusionary side constraints and two branch-and-bound algorithms", European Journal of Operational Research, vol. 140, no. 3, pp. 629--647, 2002.

INDEX TERMS

Primary Classification:
  G. Mathematics of Computing
  G.2 DISCRETE MATHEMATICS
      G.2.2 Graph Theory

Additional Classification:
  G. Mathematics of Computing
  G.2 DISCRETE MATHEMATICS
      G.2.3 Applications

General Terms:
Algorithms, Design

Keywords:
hybrid genetic algorithm, inventory, priority-based encoding, transportation planning