Pasar al contenido principal

Resultados relacionados

Resultados totales (Incluyendo duplicados): 3
Encontrada(s) 1 página(s)

RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publicación Artículo científico (JournalArticle)

Robust scheduling for Berth Allocation and Quay Crane Assignment Problem

  • Rodríguez Molins, Mario
  • Miguel A. Salido|||0000-0002-4835-4057
  • Barber, Federico|||0000-0002-3966-5742
[EN] Decision makers must face the dynamism and uncertainty of real-world environments when they need to solve the scheduling problems. Different incidences or breakdowns, for example, initial data could change or some resources could become unavailable, may eventually cause the infeasibility of the obtained schedule. To overcome this issue, a robust model and a proactive approach are presented for scheduling problems without any previous knowledge about incidences. This paper is based on proportionally distributing operational buffers among the tasks. In this paper, we consider the berth allocation problem and the quay crane assignment problem as a representative example of scheduling problems. The dynamism and uncertainty are managed by assessing the robustness of the schedules. The robustness is introduced by means of operational buffer times to absorb those unknown incidences or breakdowns. Therefore, this problem becomes a multiobjective combinatorial optimization problem that aims to minimize the total service time, to maximize the buffer times, and to minimize the standard deviation of the buffer times. To this end, a mathematical model and a new hybrid multiobjective metaheuristic is presented and compared with two well-known multiobjective genetic algorithms: NSGAII and SPEA2+., This work has been partially supported by by the Spanish Government under research project MINECO TIN2013-46511-C2-1-P, the project PIRSES-GA-2011-294931 (FP7-PEOPLE-2011-IRSES), and the predoctoral FPU fellowship (AP2010-4405).
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publicación Artículo científico (JournalArticle)

A genetic algorithm for robust berth allocation and quay crane assignment

  • Rodríguez Molins, Mario
  • Ingolotti Hetter, Laura Paola
  • Sierra, María R.
  • Puente, Jorge
  • Barber, Federico|||0000-0002-3966-5742
  • Miguel A. Salido|||0000-0002-4835-4057
[EN] Scheduling problems usually obtain the optimal solutions assuming that the environment is deterministic. However, actually the environment is dynamic and uncertain. Thus, the initial data could change and the initial schedule obtained might be unfeasible. To overcome this issue, a proactive approach is presented for scheduling problems without any previous knowledge about the incidences that can occur. In this paper, we consider the berth allocation problem and the quay crane assignment problem as a representative example of scheduling problems where a typical objective is to minimize the service time. The robustness is introduced within this problem by means of buffer times that should be maximized to absorb possible incidences or breakdowns. Therefore, this problem becomes a multi-objective optimization problem with two opposite objectives: minimizing the total service time and maximizing the robustness or buffer times., This research was supported by the Spanish Government under research projects TIN2010-20976-C02-01 and TIN2010-20976-C02-02 (Min. de Ciencia e Innovación, Spain), the project PIRSES-GA-2011-294931 (FP7-PEOPLE-2011-IRSES) and the predoctoral FPU fellowship (AP2010-4405).
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publicación Artículo científico (JournalArticle)

A GRASP-based metaheuristic for the Berth Allocation Problem and the Quay Crane Assignment Problem by managing vessel cargo holds

  • Rodríguez Molins, Mario
  • Miguel A. Salido|||0000-0002-4835-4057
  • Barber, Federico|||0000-0002-3966-5742
Container terminals are open systems that generally serve as a transshipment zone between vessels and land vehicles. These terminals carry out a large number of planning and scheduling tasks. In this paper, we consider the problem of scheduling a number of incoming vessels by assigning a berthing position, a berthing time, and a number of Quay Cranes to each vessel. This problem is known as the Berth Allocation Problem and the Quay Crane Assignment Problem. Holds of vessels are also managed in order to obtain a more realistic approach. Our aim is to minimize the total waiting time elapsed to serve all these vessels. In this paper, we deal with the above problems and propose an innovative metaheuristic approach. The results are compared against other allocation methods., This work has been partially supported by the research projects TIN2010-20976-C02-01 (Ministerio de Ciencia e Innovacion, Spain) the fellowship program FPU (AP2010-4405), and also with the collaboration of the maritime container terminal MSC (Mediterranean Shipping Company S.A.).