0000000000114233

AUTHOR

Juan Francisco Correcher

showing 6 related works from this author

A biased random-key genetic algorithm for the time-invariant berth allocation and quay crane assignment problem

2017

We address Berth Allocation and Quay Crane Assignment Problems in a heuristic wayWe propose a Biased Random-Key Genetic Algorithm for BACAP and its extension BACASPSolutions of the Genetic Algorithm are improved by a Local SearchThe complete procedure obtains high-quality solutions for large instances Maritime transportation plays a crucial role in the international economy. Port container terminals around the world compete to attract more traffic and are forced to offer better quality of service. This entails reducing operating costs and vessel service times. In doing so, one of the most important problems they face is the Berth Allocation and quay Crane Assignment Problem (BACAP). This pr…

Mathematical optimization021103 operations researchOperations researchHeuristic (computer science)Computer scienceHeuristicbusiness.industry0211 other engineering and technologiesGeneral Engineering02 engineering and technologyComputer Science ApplicationsArtificial IntelligenceContainer (abstract data type)Genetic algorithm0202 electrical engineering electronic engineering information engineeringKey (cryptography)020201 artificial intelligence & image processingLocal search (optimization)businessAssignment problemMetaheuristicLocal search (constraint satisfaction)Expert Systems with Applications
researchProduct

New exact methods for the time-invariant berth allocation and quay crane assignment problem

2019

Abstract Efficient management of operations in seaport container terminals has become a critical issue, due to the increase in maritime traffic and the strong competition between ports. In this paper we focus on two seaside operational problems: the Berth Allocation Problem and the Quay Crane Assignment Problem, which are considered in an integrated way. For the continuous BACAP problem with time-invariant crane assignment we propose a new mixed integer linear model in which the vessels can be moored at any position on the quay, not requiring any quay discretization. The model is enhanced by adding several families of valid inequalities. The resulting model is able to solve instances with u…

050210 logistics & transportationMathematical optimization021103 operations researchInformation Systems and ManagementGeneral Computer ScienceDiscretizationComputer science05 social sciences0211 other engineering and technologiesComputerApplications_COMPUTERSINOTHERSYSTEMS02 engineering and technologyManagement Science and Operations ResearchIndustrial and Manufacturing EngineeringBerth allocation problemModeling and Simulation0502 economics and businessContainer (abstract data type)Combinatorial optimizationAssignment problemInteger programmingInteger (computer science)European Journal of Operational Research
researchProduct

The berth allocation problem in terminals with irregular layouts

2019

As international trade thrives, terminals attempt to obtain higher revenue while coping with an increased complexity with regard to terminal management operations. One of the most prevalent problems such terminals face is the Berth Allocation Problem (BAP), which concerns allocating vessels to a set of berths and time slots while simultaneously minimizing objectives such as total stay time or total assignment cost. Complex layouts of real terminals introduce spatial constraints which limit the mooring and departure of vessels. Although significant research has been conducted regarding the BAP, these real-world restrictions have not been taken into account in a general way. The present work …

050210 logistics & transportationMathematical optimization021103 operations researchInformation Systems and ManagementGeneral Computer ScienceIterated local searchHeuristicComputer science05 social sciences0211 other engineering and technologies02 engineering and technologyManagement Science and Operations ResearchIndustrial and Manufacturing EngineeringBerth allocation problemModeling and Simulation0502 economics and businessCombinatorial optimizationRevenueInteger programming
researchProduct

Solving a large multicontainer loading problem in the car manufacturing industry

2017

Abstract Renault, a large car manufacturer with factories all over the world, has a production system in which not every factory produces all the parts required to assemble a vehicle. Every day, large quantities of car parts are sent from one factory to another, defining very large truck/container transportation problems. The main challenge faced by the Renault logistics platforms is to load the items into trucks and containers as efficiently as possible so as to minimize the number of vehicles sent. Therefore, the problem to be solved is a multicontainer loading problem in which, besides the usual geometric constraints preventing items from overlapping and exceeding the dimensions of the c…

Truck0209 industrial biotechnologyMathematical optimization021103 operations researchGeneral Computer ScienceComputer science0211 other engineering and technologies02 engineering and technologyCar manufacturingManagement Science and Operations ResearchIndustrial engineeringConstructiveSet (abstract data type)020901 industrial engineering & automationModeling and SimulationContainer (abstract data type)Factory (object-oriented programming)MetaheuristicComputers & Operations Research
researchProduct

The continuous Berth Allocation Problem in a container terminal with multiple quays

2015

We propose an integer linear model for the case of BAP with multiple quays.We design several constructive procedures and propose a large set of priority rules.We design a genetic algorithm, using the solutions obtained by the priority rules.For BAP with one quay, our genetic algorithm outperforms the best published methods. This paper extends the study of the continuous Berth Allocation Problem to the case of multiple quays, which is found in many container terminals around the world. Considering multiple quays adds a problem of assigning vessels to quays to the problem of determining berthing times and positions for each incoming vessel.This problem has not been considered in the literatur…

Mathematical optimizationArtificial IntelligenceBerth allocation problemComputer scienceContainer (abstract data type)Genetic algorithmGeneral EngineeringMetaheuristicConstructiveComputer Science ApplicationsInteger (computer science)Generator (mathematics)Expert Systems with Applications
researchProduct

Trends in Incidence and Transmission Patterns of COVID-19 in Valencia, Spain

2021

Importance Limited information on the transmission and dynamics of SARS-CoV-2 at the city scale is available. Objective To describe the local spread of SARS-CoV-2 in Valencia, Spain. Design, Setting, and Participants This single-center epidemiological cohort study of patients with SARS-CoV-2 was performed at University General Hospital in Valencia (population in the hospital catchment area, 364 000), a tertiary hospital. The study included all consecutive patients with COVID-19 isolated at home from the start of the COVID-19 pandemic on February 19 until August 31, 2020. Exposures Cases of SARS-CoV-2 infection confirmed by the presence of IgM antibodies or a positive polymerase chain reacti…

AdultMalemedicine.medical_specialtyPopulation01 natural sciencesDisease Outbreakslaw.inventionCohort Studies010104 statistics & probability03 medical and health sciences0302 clinical medicineCatchment Area HealthResidence CharacteristicsRisk FactorslawEpidemiologyDisease Transmission InfectiousmedicineHumans030212 general & internal medicine0101 mathematicseducationOriginal InvestigationAgedAged 80 and overeducation.field_of_studyGeographySARS-CoV-2ResearchIncidenceIncidence (epidemiology)COVID-19OutbreakGeneral MedicineMiddle Aged3. Good healthOnline OnlyTransmission (mechanics)GeographySpainRelative riskHousehold incomeFemalePublic HealthDemographyCohort studyJAMA Network Open
researchProduct