Mathematical model applied to single-track line scheduling problem in Brazilian railways
Autor(a) principal: | |
---|---|
Data de Publicação: | 2014 |
Outros Autores: | , , |
Tipo de documento: | Artigo |
Idioma: | eng |
Título da fonte: | LOCUS Repositório Institucional da UFV |
Texto Completo: | http://dx.doi.org/10.1007/s10288-014-0276-1 http://www.locus.ufv.br/handle/123456789/21840 |
Resumo: | In this paper, a single machine scheduling model is used to schedule trains in order to minimize the total weighted delay time. The railway studied, is composed of a part of two joined railways in Brazil, which belongs to VALE company and to Ferrovia Centro-Atlântica (FCA). This railway is a single-track line composed by single-tracks and it is shared by these railways (VALE and FCA). The trains travel in both directions on this single-track line. These railways have a bottleneck caused by a heavy traffic. Therefore, mathematical equations are developed to determine the shortest time interval admissible between two trains, ensuring that they will not overlap. These equations enable us to simplify the mathematical representation of the problem and define it as a single machine scheduling problem. Later, two single machine scheduling formulations are proposed and analyzed; one based on “Arc-Time-Indexed” variables and other, on “Binary” variables. Each formulation reflects a specific concept on how the variables and parameters are defined and require particular settings and definitions. Extensive computational experiments are performed considering various instances to capture several aspects of practical situations. Based on the results of experiments, these mathematical formulations are evaluated as decision-support tools. |
id |
UFV_5ed9e091d4055bfcb4ae1f7dbb54b0c3 |
---|---|
oai_identifier_str |
oai:locus.ufv.br:123456789/21840 |
network_acronym_str |
UFV |
network_name_str |
LOCUS Repositório Institucional da UFV |
repository_id_str |
2145 |
spelling |
Nogueira, Thiago HenriqueCarvalho, Carlos Roberto Venâncio deSantos, Gabriel Pinheiro AlvesCamargo, Larissa Cristina de2018-09-17T11:08:04Z2018-09-17T11:08:04Z2014-11-1116142411http://dx.doi.org/10.1007/s10288-014-0276-1http://www.locus.ufv.br/handle/123456789/21840In this paper, a single machine scheduling model is used to schedule trains in order to minimize the total weighted delay time. The railway studied, is composed of a part of two joined railways in Brazil, which belongs to VALE company and to Ferrovia Centro-Atlântica (FCA). This railway is a single-track line composed by single-tracks and it is shared by these railways (VALE and FCA). The trains travel in both directions on this single-track line. These railways have a bottleneck caused by a heavy traffic. Therefore, mathematical equations are developed to determine the shortest time interval admissible between two trains, ensuring that they will not overlap. These equations enable us to simplify the mathematical representation of the problem and define it as a single machine scheduling problem. Later, two single machine scheduling formulations are proposed and analyzed; one based on “Arc-Time-Indexed” variables and other, on “Binary” variables. Each formulation reflects a specific concept on how the variables and parameters are defined and require particular settings and definitions. Extensive computational experiments are performed considering various instances to capture several aspects of practical situations. Based on the results of experiments, these mathematical formulations are evaluated as decision-support tools.eng4ORv. 13, n. 4, p. 403– 441, dez. 2015Springer Nature Switzerland AG.info:eu-repo/semantics/openAccessLogisticRailway transportationSingle-track lineInterchange pointSchedulingMathematical modelingMathematical model applied to single-track line scheduling problem in Brazilian railwaysinfo:eu-repo/semantics/publishedVersioninfo:eu-repo/semantics/articleapplication/pdfreponame:LOCUS Repositório Institucional da UFVinstname:Universidade Federal de Viçosa (UFV)instacron:UFVORIGINALartigo.pdfartigo.pdftexto completoapplication/pdf715078https://locus.ufv.br//bitstream/123456789/21840/1/artigo.pdf2b3e8e7d4b70e096b8b8d91dd1d305beMD51LICENSElicense.txtlicense.txttext/plain; charset=utf-81748https://locus.ufv.br//bitstream/123456789/21840/2/license.txt8a4605be74aa9ea9d79846c1fba20a33MD52THUMBNAILartigo.pdf.jpgartigo.pdf.jpgIM Thumbnailimage/jpeg4734https://locus.ufv.br//bitstream/123456789/21840/3/artigo.pdf.jpg39bc06fa98169d888aab3bdebf797104MD53123456789/218402018-09-17 23:00:28.615oai:locus.ufv.br:123456789/21840Tk9URTogUExBQ0UgWU9VUiBPV04gTElDRU5TRSBIRVJFClRoaXMgc2FtcGxlIGxpY2Vuc2UgaXMgcHJvdmlkZWQgZm9yIGluZm9ybWF0aW9uYWwgcHVycG9zZXMgb25seS4KCk5PTi1FWENMVVNJVkUgRElTVFJJQlVUSU9OIExJQ0VOU0UKCkJ5IHNpZ25pbmcgYW5kIHN1Ym1pdHRpbmcgdGhpcyBsaWNlbnNlLCB5b3UgKHRoZSBhdXRob3Iocykgb3IgY29weXJpZ2h0Cm93bmVyKSBncmFudHMgdG8gRFNwYWNlIFVuaXZlcnNpdHkgKERTVSkgdGhlIG5vbi1leGNsdXNpdmUgcmlnaHQgdG8gcmVwcm9kdWNlLAp0cmFuc2xhdGUgKGFzIGRlZmluZWQgYmVsb3cpLCBhbmQvb3IgZGlzdHJpYnV0ZSB5b3VyIHN1Ym1pc3Npb24gKGluY2x1ZGluZwp0aGUgYWJzdHJhY3QpIHdvcmxkd2lkZSBpbiBwcmludCBhbmQgZWxlY3Ryb25pYyBmb3JtYXQgYW5kIGluIGFueSBtZWRpdW0sCmluY2x1ZGluZyBidXQgbm90IGxpbWl0ZWQgdG8gYXVkaW8gb3IgdmlkZW8uCgpZb3UgYWdyZWUgdGhhdCBEU1UgbWF5LCB3aXRob3V0IGNoYW5naW5nIHRoZSBjb250ZW50LCB0cmFuc2xhdGUgdGhlCnN1Ym1pc3Npb24gdG8gYW55IG1lZGl1bSBvciBmb3JtYXQgZm9yIHRoZSBwdXJwb3NlIG9mIHByZXNlcnZhdGlvbi4KCllvdSBhbHNvIGFncmVlIHRoYXQgRFNVIG1heSBrZWVwIG1vcmUgdGhhbiBvbmUgY29weSBvZiB0aGlzIHN1Ym1pc3Npb24gZm9yCnB1cnBvc2VzIG9mIHNlY3VyaXR5LCBiYWNrLXVwIGFuZCBwcmVzZXJ2YXRpb24uCgpZb3UgcmVwcmVzZW50IHRoYXQgdGhlIHN1Ym1pc3Npb24gaXMgeW91ciBvcmlnaW5hbCB3b3JrLCBhbmQgdGhhdCB5b3UgaGF2ZQp0aGUgcmlnaHQgdG8gZ3JhbnQgdGhlIHJpZ2h0cyBjb250YWluZWQgaW4gdGhpcyBsaWNlbnNlLiBZb3UgYWxzbyByZXByZXNlbnQKdGhhdCB5b3VyIHN1Ym1pc3Npb24gZG9lcyBub3QsIHRvIHRoZSBiZXN0IG9mIHlvdXIga25vd2xlZGdlLCBpbmZyaW5nZSB1cG9uCmFueW9uZSdzIGNvcHlyaWdodC4KCklmIHRoZSBzdWJtaXNzaW9uIGNvbnRhaW5zIG1hdGVyaWFsIGZvciB3aGljaCB5b3UgZG8gbm90IGhvbGQgY29weXJpZ2h0LAp5b3UgcmVwcmVzZW50IHRoYXQgeW91IGhhdmUgb2J0YWluZWQgdGhlIHVucmVzdHJpY3RlZCBwZXJtaXNzaW9uIG9mIHRoZQpjb3B5cmlnaHQgb3duZXIgdG8gZ3JhbnQgRFNVIHRoZSByaWdodHMgcmVxdWlyZWQgYnkgdGhpcyBsaWNlbnNlLCBhbmQgdGhhdApzdWNoIHRoaXJkLXBhcnR5IG93bmVkIG1hdGVyaWFsIGlzIGNsZWFybHkgaWRlbnRpZmllZCBhbmQgYWNrbm93bGVkZ2VkCndpdGhpbiB0aGUgdGV4dCBvciBjb250ZW50IG9mIHRoZSBzdWJtaXNzaW9uLgoKSUYgVEhFIFNVQk1JU1NJT04gSVMgQkFTRUQgVVBPTiBXT1JLIFRIQVQgSEFTIEJFRU4gU1BPTlNPUkVEIE9SIFNVUFBPUlRFRApCWSBBTiBBR0VOQ1kgT1IgT1JHQU5JWkFUSU9OIE9USEVSIFRIQU4gRFNVLCBZT1UgUkVQUkVTRU5UIFRIQVQgWU9VIEhBVkUKRlVMRklMTEVEIEFOWSBSSUdIVCBPRiBSRVZJRVcgT1IgT1RIRVIgT0JMSUdBVElPTlMgUkVRVUlSRUQgQlkgU1VDSApDT05UUkFDVCBPUiBBR1JFRU1FTlQuCgpEU1Ugd2lsbCBjbGVhcmx5IGlkZW50aWZ5IHlvdXIgbmFtZShzKSBhcyB0aGUgYXV0aG9yKHMpIG9yIG93bmVyKHMpIG9mIHRoZQpzdWJtaXNzaW9uLCBhbmQgd2lsbCBub3QgbWFrZSBhbnkgYWx0ZXJhdGlvbiwgb3RoZXIgdGhhbiBhcyBhbGxvd2VkIGJ5IHRoaXMKbGljZW5zZSwgdG8geW91ciBzdWJtaXNzaW9uLgo=Repositório InstitucionalPUBhttps://www.locus.ufv.br/oai/requestfabiojreis@ufv.bropendoar:21452018-09-18T02:00:28LOCUS Repositório Institucional da UFV - Universidade Federal de Viçosa (UFV)false |
dc.title.en.fl_str_mv |
Mathematical model applied to single-track line scheduling problem in Brazilian railways |
title |
Mathematical model applied to single-track line scheduling problem in Brazilian railways |
spellingShingle |
Mathematical model applied to single-track line scheduling problem in Brazilian railways Nogueira, Thiago Henrique Logistic Railway transportation Single-track line Interchange point Scheduling Mathematical modeling |
title_short |
Mathematical model applied to single-track line scheduling problem in Brazilian railways |
title_full |
Mathematical model applied to single-track line scheduling problem in Brazilian railways |
title_fullStr |
Mathematical model applied to single-track line scheduling problem in Brazilian railways |
title_full_unstemmed |
Mathematical model applied to single-track line scheduling problem in Brazilian railways |
title_sort |
Mathematical model applied to single-track line scheduling problem in Brazilian railways |
author |
Nogueira, Thiago Henrique |
author_facet |
Nogueira, Thiago Henrique Carvalho, Carlos Roberto Venâncio de Santos, Gabriel Pinheiro Alves Camargo, Larissa Cristina de |
author_role |
author |
author2 |
Carvalho, Carlos Roberto Venâncio de Santos, Gabriel Pinheiro Alves Camargo, Larissa Cristina de |
author2_role |
author author author |
dc.contributor.author.fl_str_mv |
Nogueira, Thiago Henrique Carvalho, Carlos Roberto Venâncio de Santos, Gabriel Pinheiro Alves Camargo, Larissa Cristina de |
dc.subject.pt-BR.fl_str_mv |
Logistic Railway transportation Single-track line Interchange point Scheduling Mathematical modeling |
topic |
Logistic Railway transportation Single-track line Interchange point Scheduling Mathematical modeling |
description |
In this paper, a single machine scheduling model is used to schedule trains in order to minimize the total weighted delay time. The railway studied, is composed of a part of two joined railways in Brazil, which belongs to VALE company and to Ferrovia Centro-Atlântica (FCA). This railway is a single-track line composed by single-tracks and it is shared by these railways (VALE and FCA). The trains travel in both directions on this single-track line. These railways have a bottleneck caused by a heavy traffic. Therefore, mathematical equations are developed to determine the shortest time interval admissible between two trains, ensuring that they will not overlap. These equations enable us to simplify the mathematical representation of the problem and define it as a single machine scheduling problem. Later, two single machine scheduling formulations are proposed and analyzed; one based on “Arc-Time-Indexed” variables and other, on “Binary” variables. Each formulation reflects a specific concept on how the variables and parameters are defined and require particular settings and definitions. Extensive computational experiments are performed considering various instances to capture several aspects of practical situations. Based on the results of experiments, these mathematical formulations are evaluated as decision-support tools. |
publishDate |
2014 |
dc.date.issued.fl_str_mv |
2014-11-11 |
dc.date.accessioned.fl_str_mv |
2018-09-17T11:08:04Z |
dc.date.available.fl_str_mv |
2018-09-17T11:08:04Z |
dc.type.status.fl_str_mv |
info:eu-repo/semantics/publishedVersion |
dc.type.driver.fl_str_mv |
info:eu-repo/semantics/article |
format |
article |
status_str |
publishedVersion |
dc.identifier.uri.fl_str_mv |
http://dx.doi.org/10.1007/s10288-014-0276-1 http://www.locus.ufv.br/handle/123456789/21840 |
dc.identifier.issn.none.fl_str_mv |
16142411 |
identifier_str_mv |
16142411 |
url |
http://dx.doi.org/10.1007/s10288-014-0276-1 http://www.locus.ufv.br/handle/123456789/21840 |
dc.language.iso.fl_str_mv |
eng |
language |
eng |
dc.relation.ispartofseries.pt-BR.fl_str_mv |
v. 13, n. 4, p. 403– 441, dez. 2015 |
dc.rights.driver.fl_str_mv |
Springer Nature Switzerland AG. info:eu-repo/semantics/openAccess |
rights_invalid_str_mv |
Springer Nature Switzerland AG. |
eu_rights_str_mv |
openAccess |
dc.format.none.fl_str_mv |
application/pdf |
dc.publisher.none.fl_str_mv |
4OR |
publisher.none.fl_str_mv |
4OR |
dc.source.none.fl_str_mv |
reponame:LOCUS Repositório Institucional da UFV instname:Universidade Federal de Viçosa (UFV) instacron:UFV |
instname_str |
Universidade Federal de Viçosa (UFV) |
instacron_str |
UFV |
institution |
UFV |
reponame_str |
LOCUS Repositório Institucional da UFV |
collection |
LOCUS Repositório Institucional da UFV |
bitstream.url.fl_str_mv |
https://locus.ufv.br//bitstream/123456789/21840/1/artigo.pdf https://locus.ufv.br//bitstream/123456789/21840/2/license.txt https://locus.ufv.br//bitstream/123456789/21840/3/artigo.pdf.jpg |
bitstream.checksum.fl_str_mv |
2b3e8e7d4b70e096b8b8d91dd1d305be 8a4605be74aa9ea9d79846c1fba20a33 39bc06fa98169d888aab3bdebf797104 |
bitstream.checksumAlgorithm.fl_str_mv |
MD5 MD5 MD5 |
repository.name.fl_str_mv |
LOCUS Repositório Institucional da UFV - Universidade Federal de Viçosa (UFV) |
repository.mail.fl_str_mv |
fabiojreis@ufv.br |
_version_ |
1801213107773636608 |