Heuristic Algorithms for Solving the Slot Planning Problem

Francisco Parreno; Dario Pacino; Ramon Alvarez-Valdes

Heuristic Algorithms for Solving the Slot Planning Problem

Francisco Parreno
, Dario Pacino
, Ramon Alvarez-Valdes

University of Castilla-La Mancha
University of Valencia

Research output: Contribution to conference › Conference abstract for conference › Research › peer-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 language	English
Publication date	2014
Number of pages	1
Publication status	Published - 2014
Event	20^th Conference of the International Federation of Operational Research Societies. - Barcelona International Convention Center, Barcelona, Spain Duration: 13 Jul 2014 → 18 Jul 2014 Conference number: 20

Conference

Conference	20^th Conference of the International Federation of Operational Research Societies.
Number	20
Location	Barcelona International Convention Center
Country/Territory	Spain
City	Barcelona
Period	13/07/2014 → 18/07/2014

OpenUrl availability

Check availability in DTU Findit

Cite this

@conference{059c1e80f8be4f83bfd7148273a859c5,

title = "Heuristic Algorithms for Solving the Slot Planning Problem",

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. ",

author = "Francisco Parreno and Dario Pacino and Ramon Alvarez-Valdes",

year = "2014",

language = "English",

note = "20<sup>th</sup> Conference of the International Federation of Operational Research Societies., IFORS ; Conference date: 13-07-2014 Through 18-07-2014",

}

TY - ABST

T1 - Heuristic Algorithms for Solving the Slot Planning Problem

AU - Parreno, Francisco

AU - Pacino, Dario

AU - Alvarez-Valdes, Ramon

N1 - Conference code: 20

PY - 2014

Y1 - 2014

N2 - 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.

AB - 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.

M3 - Conference abstract for conference

T2 - 20<sup>th</sup> Conference of the International Federation of Operational Research Societies.

Y2 - 13 July 2014 through 18 July 2014

ER -

Heuristic Algorithms for Solving the Slot Planning Problem

Abstract

Conference

OpenUrl availability

Fingerprint

Cite this