NEW DECOMPOSITION ALGORITHM FOR THE DETERMINISTIC DYNAMIC ALLOCATION OF EMPTY CONTAINERS

Empty container allocation is an important problem encountered by maritime shipping companies in the management of their transportation operations. The problem addresses the short term planning of empty container movements intended to satisfy customer requests, as well as the need to reposition empties for future demand. The starting point for this paper is a dynamic model for the deterministic problem proposed in the literature. The paper proposes a new decomposition approach, based on the classical restriction framework that takes into account the specificities of the model, particularly the substitution property between the different container types. Several variants of a generic algorithm are implemented in sequential and parallel environments, and comparative computational results are presented.

  • Corporate Authors:

    Universite de Montreal

    Centre de Recherche sur Les Transports
    C.P. 6128 Succursale Centre-ville
    Montreal H3C 3J7, Quebec  Canada 
  • Authors:
    • Abrache, J
    • Crainic, T G
    • Gendreau, M
  • Publication Date: 1999

Language

  • English

Media Info

  • Pagination: 30 p.

Subject/Index Terms

Filing Info

  • Accession Number: 00794291
  • Record Type: Publication
  • Files: TRIS
  • Created Date: Jun 11 2000 12:00AM