Ramón Alvarez-Valdés

Orcid: 0000-0002-8450-629X

According to our database1, Ramón Alvarez-Valdés authored at least 49 papers between 1999 and 2024.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
The berth allocation and quay crane assignment problem with crane travel and setup times.
Comput. Oper. Res., February, 2024

Solving the Palliative Home Health Care Routing and Scheduling Problem with an integer linear programming model.
Expert Syst. Appl., 2024

The optimal container selection problem for parts transportation in the automotive sector.
Expert Syst. Appl., 2024

The container premarshalling problem under limited crane time: A constraint programming approach.
Comput. Oper. Res., 2024

2023
A matheuristic algorithm for the maintenance planning problem at an electricity transmission system operator.
Expert Syst. Appl., November, 2023

Models and algorithms for a yard crane scheduling problem in container ports.
Eur. J. Oper. Res., September, 2023

A constraint programming approach for the premarshalling problem.
Eur. J. Oper. Res., 2023

Multi-container loading problems with multidrop and split delivery conditions.
Comput. Ind. Eng., 2023

2022
A beam search algorithm for minimizing crane times in premarshalling problems.
Eur. J. Oper. Res., 2022

The pallet-loading vehicle routing problem with stability constraints.
Eur. J. Oper. Res., 2022

2021
Measuring diversity. A review and an empirical analysis.
Eur. J. Oper. Res., 2021

Solving the generalized multi-port container stowage planning problem by a matheuristic algorithm.
Comput. Oper. Res., 2021

2020
Solving a large cutting problem in the glass manufacturing industry.
Eur. J. Oper. Res., 2020

Irregular packing problems: A review of mathematical models.
Eur. J. Oper. Res., 2020

A GRASP algorithm for multi container loading problems with practical constraints.
4OR, 2020

2019
A branch and bound approach for large pre-marshalling problems.
Eur. J. Oper. Res., 2019

Integer programming models for the pre-marshalling problem.
Eur. J. Oper. Res., 2019

The berth allocation problem in terminals with irregular layouts.
Eur. J. Oper. Res., 2019

New exact methods for the time-invariant berth allocation and quay crane assignment problem.
Eur. J. Oper. Res., 2019

Mathematical models for Multi Container Loading Problems with practical constraints.
Comput. Ind. Eng., 2019

2018
Cutting and Packing.
Proceedings of the Handbook of Heuristics., 2018

2017
A biased random-key genetic algorithm for the time-invariant berth allocation and quay crane assignment problem.
Expert Syst. Appl., 2017

Matheuristics for the irregular bin packing problem with free rotations.
Eur. J. Oper. Res., 2017

Solving a large multicontainer loading problem in the car manufacturing industry.
Comput. Oper. Res., 2017

2016
Preface to the Special Issue on Cutting and Packing.
Int. Trans. Oper. Res., 2016

Determining the best shipper sizes for sending products to customers.
Int. Trans. Oper. Res., 2016

A decomposition approach to dual shuttle automated storage and retrieval systems.
Comput. Ind. Eng., 2016

2015
Lower bounds for three-dimensional multiple-bin-size bin packing problems.
OR Spectr., 2015

The continuous Berth Allocation Problem in a container terminal with multiple quays.
Expert Syst. Appl., 2015

Minimizing weighted earliness-tardiness on parallel machines using hybrid metaheuristics.
Comput. Oper. Res., 2015

2013
A GRASP/Path Relinking algorithm for two- and three-dimensional multiple bin-size bin packing problems.
Comput. Oper. Res., 2013

2010
Neighborhood structures for the container loading problem: a VNS implementation.
J. Heuristics, 2010

A hybrid GRASP/VND algorithm for two- and three-dimensional bin packing.
Ann. Oper. Res., 2010

2009
A branch and bound algorithm for the strip packing problem.
OR Spectr., 2009

2008
A Maximal-Space Algorithm for the Container Loading Problem.
INFORMS J. Comput., 2008

GRASP and path relinking for project scheduling under partially renewable resources.
Eur. J. Oper. Res., 2008

Reactive GRASP for the strip-packing problem.
Comput. Oper. Res., 2008

2007
GRASP and Path Relinking for the Two-Dimensional Two-Stage Cutting-Stock Problem.
INFORMS J. Comput., 2007

A tabu search algorithm for a two-dimensional non-guillotine cutting problem.
Eur. J. Oper. Res., 2007

2006
A scatter search algorithm for project scheduling under partially renewable resources.
J. Heuristics, 2006

2005
A tabu search algorithm for the pallet loading problem.
OR Spectr., 2005

A GRASP algorithm for constrained two-dimensional non-guillotine cutting problems.
J. Oper. Res. Soc., 2005

A heuristic to schedule flexible job-shop in a glass factory.
Eur. J. Oper. Res., 2005

A branch-and-cut algorithm for the pallet loading problem.
Comput. Oper. Res., 2005

2002
A computational study of LP-based heuristic algorithms for two-dimensional guillotine cutting stock problems.
OR Spectr., 2002

Design and implementation of a course scheduling system using Tabu Search.
Eur. J. Oper. Res., 2002

A tabu search algorithm for large-scale guillotine (un)constrained two-dimensional cutting problems.
Comput. Oper. Res., 2002

2000
Assigning students to course sections using tabu search.
Ann. Oper. Res., 2000

1999
Labour scheduling at an airport refuelling installation.
J. Oper. Res. Soc., 1999


  Loading...