Citation
A GRASP Heuristic to the Extended Car Sequencing Problem. In proceedings of the 5th Multidisciplinary International Conference on Scheduling : Theory and Applications (MISTA 2011), 9-11 August 2011, Phoenix, Arizona, USA, pages 366-373, 2011.
Paper
Abstract
This paper describes a GRASP heuristic to the recently introduced Extended Car Sequencing Problem. A constructive heuristic is developed based on an heuristic for the classical Car Sequencing Problem. The local search procedure uses a very simple neighborhood easy to be evaluated. Computational results on instances from the CSPLibīs library verify the efficiency of the method in comparison with the literature.
You can download the pdf of this publication from here
doi
This publication does not have a doi, so we cannot provide a link to the original source
What is a doi?: A doi (Document Object Identifier) is a unique identifier for sicientific papers (and occasionally other material). This provides direct access to the location where the original article is published using the URL http://dx.doi/org/xxxx (replacing xxx with the doi). See http://dx.doi.org/ for more information
URL
This pubication does not have a URL associated with it.
The URL is only provided if there is additional information that might be useful. For example, where the entry is a book chapter, the URL might link to the book itself.
Bibtex
@INPROCEEDINGS{2011-366-373-P, author = {L. M. Rizzo and S. Urrutia},
title = {A GRASP Heuristic to the Extended Car Sequencing Problem},
booktitle = {In proceedings of the 5th Multidisciplinary International Conference on Scheduling : Theory and Applications (MISTA 2011), 9-11 August 2011, Phoenix, Arizona, USA},
year = {2011},
editor = {J. Fowler and G. Kendall and B. McCollum},
pages = {366--373},
note = {Paper},
abstract = {This paper describes a GRASP heuristic to the recently introduced Extended Car Sequencing Problem. A constructive heuristic is developed based on an heuristic for the classical Car Sequencing Problem. The local search procedure uses a very simple neighborhood easy to be evaluated. Computational results on instances from the CSPLibīs library verify the efficiency of the method in comparison with the literature.},
owner = {gxk},
timestamp = {2011.08.15},
webpdf = {2011-366-373-P.pdf} }