Heuristic Algorithms for Solving the Slot Planning Problem

Francisco Parreno, Dario Pacino, Ramon Alvarez-Valdes

    Research output: Contribution to conferenceConference abstract for conferenceResearchpeer-review

    Abstract

    In the Slot Planning Problem, for each location of the container ship we are given a list of containers to be loaded, and the problem is to assign each container to a feasible position, satisfying the specific packing constraints associated to the ship locations and to the different types of containers involved. We have developed a GRASP algorithm in which the constructive randomized phase packs as many containers as possible and the improvement phase tries several moves in order to minimize the number of containers left out. The algorithm has been tested on a set of real-world instances.
    Original languageEnglish
    Publication date2014
    Number of pages1
    Publication statusPublished - 2014
    EventConference of the International Federation of Operational Research Societies. - Barcelona International Convention Center, Barcelona, Spain
    Duration: 13 Jul 201418 Jul 2014
    Conference number: 20

    Conference

    ConferenceConference of the International Federation of Operational Research Societies.
    Number20
    LocationBarcelona International Convention Center
    CountrySpain
    CityBarcelona
    Period13/07/201418/07/2014

    Cite this

    Parreno, F., Pacino, D., & Alvarez-Valdes, R. (2014). Heuristic Algorithms for Solving the Slot Planning Problem. Abstract from Conference of the International Federation of Operational Research Societies., Barcelona, Spain. http://ifors2014.org/