G-DMP

An algorithm without constraint relaxation to solve the train departure matching problem

Alondra Rojas, Elizabeth Montero, Maria Cristina Riff

Resultado de la investigación: Conference contribution

Resumen

In this work we present a GRASP based approach for solving the departure matching problem, an important subproblem of the Rolling Stock Units Management problem. Our approach implements a constructive and a Local Search steps that are able to deal with all the constraints and costs related to the problem. We evaluate our approach using two sets of instances: a set of randomly generated instances and the set of instances used in ROADEF/EURO Challenge 2014.

Idioma originalEnglish
Título de la publicación alojada2017 IEEE Congress on Evolutionary Computation, CEC 2017 - Proceedings
EditorialInstitute of Electrical and Electronics Engineers Inc.
Páginas2382-2389
Número de páginas8
ISBN (versión digital)9781509046010
DOI
EstadoPublished - 5 jul 2017
Evento2017 IEEE Congress on Evolutionary Computation, CEC 2017 - Donostia-San Sebastian, Spain
Duración: 5 jun 20178 jun 2017

Conference

Conference2017 IEEE Congress on Evolutionary Computation, CEC 2017
PaísSpain
CiudadDonostia-San Sebastian
Período5/06/178/06/17

Huella dactilar

Costs

ASJC Scopus subject areas

  • Artificial Intelligence
  • Computer Networks and Communications
  • Computer Science Applications
  • Signal Processing

Citar esto

Rojas, A., Montero, E., & Riff, M. C. (2017). G-DMP: An algorithm without constraint relaxation to solve the train departure matching problem. En 2017 IEEE Congress on Evolutionary Computation, CEC 2017 - Proceedings (pp. 2382-2389). [7969593] Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/CEC.2017.7969593
Rojas, Alondra ; Montero, Elizabeth ; Riff, Maria Cristina. / G-DMP : An algorithm without constraint relaxation to solve the train departure matching problem. 2017 IEEE Congress on Evolutionary Computation, CEC 2017 - Proceedings. Institute of Electrical and Electronics Engineers Inc., 2017. pp. 2382-2389
@inproceedings{b1dd35e654f446d0b37123f3207c93b5,
title = "G-DMP: An algorithm without constraint relaxation to solve the train departure matching problem",
abstract = "In this work we present a GRASP based approach for solving the departure matching problem, an important subproblem of the Rolling Stock Units Management problem. Our approach implements a constructive and a Local Search steps that are able to deal with all the constraints and costs related to the problem. We evaluate our approach using two sets of instances: a set of randomly generated instances and the set of instances used in ROADEF/EURO Challenge 2014.",
author = "Alondra Rojas and Elizabeth Montero and Riff, {Maria Cristina}",
year = "2017",
month = "7",
day = "5",
doi = "10.1109/CEC.2017.7969593",
language = "English",
pages = "2382--2389",
booktitle = "2017 IEEE Congress on Evolutionary Computation, CEC 2017 - Proceedings",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
address = "United States",

}

Rojas, A, Montero, E & Riff, MC 2017, G-DMP: An algorithm without constraint relaxation to solve the train departure matching problem. En 2017 IEEE Congress on Evolutionary Computation, CEC 2017 - Proceedings., 7969593, Institute of Electrical and Electronics Engineers Inc., pp. 2382-2389, 2017 IEEE Congress on Evolutionary Computation, CEC 2017, Donostia-San Sebastian, Spain, 5/06/17. https://doi.org/10.1109/CEC.2017.7969593

G-DMP : An algorithm without constraint relaxation to solve the train departure matching problem. / Rojas, Alondra; Montero, Elizabeth; Riff, Maria Cristina.

2017 IEEE Congress on Evolutionary Computation, CEC 2017 - Proceedings. Institute of Electrical and Electronics Engineers Inc., 2017. p. 2382-2389 7969593.

Resultado de la investigación: Conference contribution

TY - GEN

T1 - G-DMP

T2 - An algorithm without constraint relaxation to solve the train departure matching problem

AU - Rojas, Alondra

AU - Montero, Elizabeth

AU - Riff, Maria Cristina

PY - 2017/7/5

Y1 - 2017/7/5

N2 - In this work we present a GRASP based approach for solving the departure matching problem, an important subproblem of the Rolling Stock Units Management problem. Our approach implements a constructive and a Local Search steps that are able to deal with all the constraints and costs related to the problem. We evaluate our approach using two sets of instances: a set of randomly generated instances and the set of instances used in ROADEF/EURO Challenge 2014.

AB - In this work we present a GRASP based approach for solving the departure matching problem, an important subproblem of the Rolling Stock Units Management problem. Our approach implements a constructive and a Local Search steps that are able to deal with all the constraints and costs related to the problem. We evaluate our approach using two sets of instances: a set of randomly generated instances and the set of instances used in ROADEF/EURO Challenge 2014.

UR - http://www.scopus.com/inward/record.url?scp=85027861921&partnerID=8YFLogxK

U2 - 10.1109/CEC.2017.7969593

DO - 10.1109/CEC.2017.7969593

M3 - Conference contribution

SP - 2382

EP - 2389

BT - 2017 IEEE Congress on Evolutionary Computation, CEC 2017 - Proceedings

PB - Institute of Electrical and Electronics Engineers Inc.

ER -

Rojas A, Montero E, Riff MC. G-DMP: An algorithm without constraint relaxation to solve the train departure matching problem. En 2017 IEEE Congress on Evolutionary Computation, CEC 2017 - Proceedings. Institute of Electrical and Electronics Engineers Inc. 2017. p. 2382-2389. 7969593 https://doi.org/10.1109/CEC.2017.7969593