A MIP‐based local search method for the railway rescheduling problem
Identifieur interne : 001411 ( Istex/Corpus ); précédent : 001410; suivant : 001412A MIP‐based local search method for the railway rescheduling problem
Auteurs : Rodrigo Acuna-Agost ; Philippe Michelon ; Dominique Feillet ; Serigne GueyeSource :
- Networks [ 0028-3045 ] ; 2011-01.
English descriptors
Abstract
For operational and unpredictable reasons, many small incidents occur day after day in rail transportation systems. Most of them have a local impact, but, in some cases, mainly in dense networks, minimal disruptions can spread out through the whole network and affect significantly the train schedules. In this article, we present the railway rescheduling problem as the problem of finding a new schedule of trains after one or several incidents by minimizing some measure of the effect. We investigate the solution of this problem through a mixed‐integer programming (MIP) formulation. Because of the impossibility for solving it exactly just using a standard MIP solver, we propose to limit the search space around the original nondisrupted schedule by hard and soft fixing of integer variables with local‐branching‐type cuts. Different variations of the method are compared to a right‐shift rescheduling policy in two different networks located in France and Chile. The experimental results are also used to study the impact of different objectives on the total delay. © 2010 Wiley Periodicals, Inc. NETWORKS, 2011
Url:
DOI: 10.1002/net.20384
Links to Exploration step
ISTEX:BA6A03976F1AEFB04BCE1A11E0A707885A586800Le document en format XML
<record><TEI wicri:istexFullTextTei="biblStruct"><teiHeader><fileDesc><titleStmt><title xml:lang="en">A MIP‐based local search method for the railway rescheduling problem</title><author><name sortKey="Acuna Gost, Rodrigo" sort="Acuna Gost, Rodrigo" uniqKey="Acuna Gost R" first="Rodrigo" last="Acuna-Agost">Rodrigo Acuna-Agost</name><affiliation><mods:affiliation>Université d'Avignon et des Pays de Vaucluse, Laboratoire Informatique d'Avignon, F‐84911 Avignon, France</mods:affiliation></affiliation></author><author><name sortKey="Michelon, Philippe" sort="Michelon, Philippe" uniqKey="Michelon P" first="Philippe" last="Michelon">Philippe Michelon</name><affiliation><mods:affiliation>Université d'Avignon et des Pays de Vaucluse, Laboratoire Informatique d'Avignon, F‐84911 Avignon, France</mods:affiliation></affiliation></author><author><name sortKey="Feillet, Dominique" sort="Feillet, Dominique" uniqKey="Feillet D" first="Dominique" last="Feillet">Dominique Feillet</name><affiliation><mods:affiliation>École des Mines de Saint‐Étienne, CMP Georges Charpak, F‐13541 Gardanne, France</mods:affiliation></affiliation></author><author><name sortKey="Gueye, Serigne" sort="Gueye, Serigne" uniqKey="Gueye S" first="Serigne" last="Gueye">Serigne Gueye</name><affiliation><mods:affiliation>Université du Havre, Laboratoire de Mathématiques Appliquées du Havre, F‐76058 Le Havre, France</mods:affiliation></affiliation></author></titleStmt><publicationStmt><idno type="wicri:source">ISTEX</idno><idno type="RBID">ISTEX:BA6A03976F1AEFB04BCE1A11E0A707885A586800</idno><date when="2011" year="2011">2011</date><idno type="doi">10.1002/net.20384</idno><idno type="url">https://api.istex.fr/document/BA6A03976F1AEFB04BCE1A11E0A707885A586800/fulltext/pdf</idno><idno type="wicri:Area/Istex/Corpus">001411</idno></publicationStmt><sourceDesc><biblStruct><analytic><title level="a" type="main" xml:lang="en">A MIP‐based local search method for the railway rescheduling problem</title><author><name sortKey="Acuna Gost, Rodrigo" sort="Acuna Gost, Rodrigo" uniqKey="Acuna Gost R" first="Rodrigo" last="Acuna-Agost">Rodrigo Acuna-Agost</name><affiliation><mods:affiliation>Université d'Avignon et des Pays de Vaucluse, Laboratoire Informatique d'Avignon, F‐84911 Avignon, France</mods:affiliation></affiliation></author><author><name sortKey="Michelon, Philippe" sort="Michelon, Philippe" uniqKey="Michelon P" first="Philippe" last="Michelon">Philippe Michelon</name><affiliation><mods:affiliation>Université d'Avignon et des Pays de Vaucluse, Laboratoire Informatique d'Avignon, F‐84911 Avignon, France</mods:affiliation></affiliation></author><author><name sortKey="Feillet, Dominique" sort="Feillet, Dominique" uniqKey="Feillet D" first="Dominique" last="Feillet">Dominique Feillet</name><affiliation><mods:affiliation>École des Mines de Saint‐Étienne, CMP Georges Charpak, F‐13541 Gardanne, France</mods:affiliation></affiliation></author><author><name sortKey="Gueye, Serigne" sort="Gueye, Serigne" uniqKey="Gueye S" first="Serigne" last="Gueye">Serigne Gueye</name><affiliation><mods:affiliation>Université du Havre, Laboratoire de Mathématiques Appliquées du Havre, F‐76058 Le Havre, France</mods:affiliation></affiliation></author></analytic><monogr></monogr><series><title level="j">Networks</title><title level="j" type="abbrev">Networks</title><idno type="ISSN">0028-3045</idno><idno type="eISSN">1097-0037</idno><imprint><publisher>Wiley Subscription Services, Inc., A Wiley Company</publisher><pubPlace>Hoboken</pubPlace><date type="published" when="2011-01">2011-01</date><biblScope unit="volume">57</biblScope><biblScope unit="issue">1</biblScope><biblScope unit="page" from="69">69</biblScope><biblScope unit="page" to="86">86</biblScope></imprint><idno type="ISSN">0028-3045</idno></series><idno type="istex">BA6A03976F1AEFB04BCE1A11E0A707885A586800</idno><idno type="DOI">10.1002/net.20384</idno><idno type="ArticleID">NET20384</idno></biblStruct></sourceDesc><seriesStmt><idno type="ISSN">0028-3045</idno></seriesStmt></fileDesc><profileDesc><textClass><keywords scheme="KwdEn" xml:lang="en"><term>disruption management</term><term>local branching</term><term>rescheduling</term><term>train timetabling</term></keywords></textClass><langUsage><language ident="en">en</language></langUsage></profileDesc></teiHeader><front><div type="abstract" xml:lang="en">For operational and unpredictable reasons, many small incidents occur day after day in rail transportation systems. Most of them have a local impact, but, in some cases, mainly in dense networks, minimal disruptions can spread out through the whole network and affect significantly the train schedules. In this article, we present the railway rescheduling problem as the problem of finding a new schedule of trains after one or several incidents by minimizing some measure of the effect. We investigate the solution of this problem through a mixed‐integer programming (MIP) formulation. Because of the impossibility for solving it exactly just using a standard MIP solver, we propose to limit the search space around the original nondisrupted schedule by hard and soft fixing of integer variables with local‐branching‐type cuts. Different variations of the method are compared to a right‐shift rescheduling policy in two different networks located in France and Chile. The experimental results are also used to study the impact of different objectives on the total delay. © 2010 Wiley Periodicals, Inc. NETWORKS, 2011</div></front></TEI><istex><corpusName>wiley</corpusName><author><json:item><name>Rodrigo Acuna‐Agost</name><affiliations><json:string>Université d'Avignon et des Pays de Vaucluse, Laboratoire Informatique d'Avignon, F‐84911 Avignon, France</json:string></affiliations></json:item><json:item><name>Philippe Michelon</name><affiliations><json:string>Université d'Avignon et des Pays de Vaucluse, Laboratoire Informatique d'Avignon, F‐84911 Avignon, France</json:string></affiliations></json:item><json:item><name>Dominique Feillet</name><affiliations><json:string>École des Mines de Saint‐Étienne, CMP Georges Charpak, F‐13541 Gardanne, France</json:string></affiliations></json:item><json:item><name>Serigne Gueye</name><affiliations><json:string>Université du Havre, Laboratoire de Mathématiques Appliquées du Havre, F‐76058 Le Havre, France</json:string></affiliations></json:item></author><subject><json:item><lang><json:string>eng</json:string></lang><value>disruption management</value></json:item><json:item><lang><json:string>eng</json:string></lang><value>rescheduling</value></json:item><json:item><lang><json:string>eng</json:string></lang><value>train timetabling</value></json:item><json:item><lang><json:string>eng</json:string></lang><value>local branching</value></json:item></subject><articleId><json:string>NET20384</json:string></articleId><language><json:string>eng</json:string></language><originalGenre><json:string>article</json:string></originalGenre><abstract>For operational and unpredictable reasons, many small incidents occur day after day in rail transportation systems. Most of them have a local impact, but, in some cases, mainly in dense networks, minimal disruptions can spread out through the whole network and affect significantly the train schedules. In this article, we present the railway rescheduling problem as the problem of finding a new schedule of trains after one or several incidents by minimizing some measure of the effect. We investigate the solution of this problem through a mixed‐integer programming (MIP) formulation. Because of the impossibility for solving it exactly just using a standard MIP solver, we propose to limit the search space around the original nondisrupted schedule by hard and soft fixing of integer variables with local‐branching‐type cuts. Different variations of the method are compared to a right‐shift rescheduling policy in two different networks located in France and Chile. The experimental results are also used to study the impact of different objectives on the total delay. © 2010 Wiley Periodicals, Inc. NETWORKS, 2011</abstract><qualityIndicators><score>7.052</score><pdfVersion>1.3</pdfVersion><pdfPageSize>594 x 792 pts</pdfPageSize><refBibsNative>true</refBibsNative><keywordCount>4</keywordCount><abstractCharCount>1117</abstractCharCount><pdfWordCount>9548</pdfWordCount><pdfCharCount>59596</pdfCharCount><pdfPageCount>18</pdfPageCount><abstractWordCount>171</abstractWordCount></qualityIndicators><title>A MIP‐based local search method for the railway rescheduling problem</title><genre><json:string>article</json:string></genre><host><volume>57</volume><publisherId><json:string>NET</json:string></publisherId><pages><total>18</total><last>86</last><first>69</first></pages><issn><json:string>0028-3045</json:string></issn><issue>1</issue><genre><json:string>journal</json:string></genre><language><json:string>unknown</json:string></language><eissn><json:string>1097-0037</json:string></eissn><title>Networks</title><doi><json:string>10.1002/(ISSN)1097-0037</json:string></doi></host><publicationDate>2011</publicationDate><copyrightDate>2011</copyrightDate><doi><json:string>10.1002/net.20384</json:string></doi><id>BA6A03976F1AEFB04BCE1A11E0A707885A586800</id><score>0.1318055</score><fulltext><json:item><original>true</original><mimetype>application/pdf</mimetype><extension>pdf</extension><uri>https://api.istex.fr/document/BA6A03976F1AEFB04BCE1A11E0A707885A586800/fulltext/pdf</uri></json:item><json:item><original>false</original><mimetype>application/zip</mimetype><extension>zip</extension><uri>https://api.istex.fr/document/BA6A03976F1AEFB04BCE1A11E0A707885A586800/fulltext/zip</uri></json:item><istex:fulltextTEI uri="https://api.istex.fr/document/BA6A03976F1AEFB04BCE1A11E0A707885A586800/fulltext/tei"><teiHeader><fileDesc><titleStmt><title level="a" type="main" xml:lang="en">A MIP‐based local search method for the railway rescheduling problem</title></titleStmt><publicationStmt><authority>ISTEX</authority><publisher>Wiley Subscription Services, Inc., A Wiley Company</publisher><pubPlace>Hoboken</pubPlace><availability><p>Copyright © 2010 Wiley Periodicals, Inc.</p></availability><date>2011</date></publicationStmt><notesStmt><note>ALFA Grant II‐0457‐FA‐FCD‐FI‐FC</note><note>PREDIT under MAGES Project</note></notesStmt><sourceDesc><biblStruct type="inbook"><analytic><title level="a" type="main" xml:lang="en">A MIP‐based local search method for the railway rescheduling problem</title><author xml:id="author-1"><persName><forename type="first">Rodrigo</forename><surname>Acuna‐Agost</surname></persName><note type="correspondence"><p>Correspondence: Université d'Avignon et des Pays de Vaucluse, Laboratoire Informatique d'Avignon, F‐84911 Avignon, France</p></note><affiliation>Université d'Avignon et des Pays de Vaucluse, Laboratoire Informatique d'Avignon, F‐84911 Avignon, France</affiliation></author><author xml:id="author-2"><persName><forename type="first">Philippe</forename><surname>Michelon</surname></persName><affiliation>Université d'Avignon et des Pays de Vaucluse, Laboratoire Informatique d'Avignon, F‐84911 Avignon, France</affiliation></author><author xml:id="author-3"><persName><forename type="first">Dominique</forename><surname>Feillet</surname></persName><affiliation>École des Mines de Saint‐Étienne, CMP Georges Charpak, F‐13541 Gardanne, France</affiliation></author><author xml:id="author-4"><persName><forename type="first">Serigne</forename><surname>Gueye</surname></persName><affiliation>Université du Havre, Laboratoire de Mathématiques Appliquées du Havre, F‐76058 Le Havre, France</affiliation></author></analytic><monogr><title level="j">Networks</title><title level="j" type="abbrev">Networks</title><idno type="pISSN">0028-3045</idno><idno type="eISSN">1097-0037</idno><idno type="DOI">10.1002/(ISSN)1097-0037</idno><imprint><publisher>Wiley Subscription Services, Inc., A Wiley Company</publisher><pubPlace>Hoboken</pubPlace><date type="published" when="2011-01"></date><biblScope unit="volume">57</biblScope><biblScope unit="issue">1</biblScope><biblScope unit="page" from="69">69</biblScope><biblScope unit="page" to="86">86</biblScope></imprint></monogr><idno type="istex">BA6A03976F1AEFB04BCE1A11E0A707885A586800</idno><idno type="DOI">10.1002/net.20384</idno><idno type="ArticleID">NET20384</idno></biblStruct></sourceDesc></fileDesc><profileDesc><creation><date>2011</date></creation><langUsage><language ident="en">en</language></langUsage><abstract xml:lang="en"><p>For operational and unpredictable reasons, many small incidents occur day after day in rail transportation systems. Most of them have a local impact, but, in some cases, mainly in dense networks, minimal disruptions can spread out through the whole network and affect significantly the train schedules. In this article, we present the railway rescheduling problem as the problem of finding a new schedule of trains after one or several incidents by minimizing some measure of the effect. We investigate the solution of this problem through a mixed‐integer programming (MIP) formulation. Because of the impossibility for solving it exactly just using a standard MIP solver, we propose to limit the search space around the original nondisrupted schedule by hard and soft fixing of integer variables with local‐branching‐type cuts. Different variations of the method are compared to a right‐shift rescheduling policy in two different networks located in France and Chile. The experimental results are also used to study the impact of different objectives on the total delay. © 2010 Wiley Periodicals, Inc. NETWORKS, 2011</p></abstract><textClass xml:lang="en"><keywords scheme="keyword"><list><head>keywords</head><item><term>disruption management</term></item><item><term>rescheduling</term></item><item><term>train timetabling</term></item><item><term>local branching</term></item></list></keywords></textClass></profileDesc><revisionDesc><change when="2008-01">Received</change><change when="2009-09">Registration</change><change when="2011-01">Published</change></revisionDesc></teiHeader></istex:fulltextTEI><json:item><original>false</original><mimetype>text/plain</mimetype><extension>txt</extension><uri>https://api.istex.fr/document/BA6A03976F1AEFB04BCE1A11E0A707885A586800/fulltext/txt</uri></json:item></fulltext><metadata><istex:metadataXml wicri:clean="Wiley, elements deleted: body"><istex:xmlDeclaration>version="1.0" encoding="UTF-8" standalone="yes"</istex:xmlDeclaration><istex:document><component version="2.0" type="serialArticle" xml:lang="en"><header><publicationMeta level="product"><publisherInfo><publisherName>Wiley Subscription Services, Inc., A Wiley Company</publisherName><publisherLoc>Hoboken</publisherLoc></publisherInfo><doi registered="yes">10.1002/(ISSN)1097-0037</doi><issn type="print">0028-3045</issn><issn type="electronic">1097-0037</issn><idGroup><id type="product" value="NET"></id></idGroup><titleGroup><title type="main" xml:lang="en" sort="NETWORKS">Networks</title><title type="short">Networks</title></titleGroup></publicationMeta><publicationMeta level="part" position="10"><doi origin="wiley" registered="yes">10.1002/net.v57.1</doi><titleGroup><title type="specialIssueTitle">Optimization in Scheduled Transportation Networks</title></titleGroup><numberingGroup><numbering type="journalVolume" number="57">57</numbering><numbering type="journalIssue">1</numbering></numberingGroup><coverDate startDate="2011-01">January 2011</coverDate></publicationMeta><publicationMeta level="unit" type="article" position="70" status="forIssue"><doi origin="wiley" registered="yes">10.1002/net.20384</doi><idGroup><id type="unit" value="NET20384"></id></idGroup><countGroup><count type="pageTotal" number="18"></count></countGroup><copyright ownership="publisher">Copyright © 2010 Wiley Periodicals, Inc.</copyright><eventGroup><event type="manuscriptReceived" date="2008-01"></event><event type="manuscriptAccepted" date="2009-09"></event><event type="firstOnline" date="2010-03-16"></event><event type="publishedOnlineAcceptedOrEarlyUnpaginated" date="2010-03-16"></event><event type="xmlConverted" agent="Converter:JWSART34_TO_WML3G version:2.3.27 mode:FullText" date="2010-12-10"></event><event type="publishedOnlineFinalForm" date="2010-12-07"></event><event type="xmlConverted" agent="Converter:WILEY_ML3G_TO_WILEY_ML3GV2 version:3.8.8" date="2014-02-03"></event><event type="xmlConverted" agent="Converter:WML3G_To_WML3G version:4.1.7 mode:FullText,remove_FC" date="2014-10-31"></event></eventGroup><numberingGroup><numbering type="pageFirst">69</numbering><numbering type="pageLast">86</numbering></numberingGroup><correspondenceTo>Université d'Avignon et des Pays de Vaucluse, Laboratoire Informatique d'Avignon, F‐84911 Avignon, France</correspondenceTo><linkGroup><link type="toTypesetVersion" href="file:NET.NET20384.pdf"></link></linkGroup></publicationMeta><contentMeta><countGroup><count type="figureTotal" number="0"></count><count type="tableTotal" number="0"></count><count type="referenceTotal" number="21"></count><count type="wordTotal" number="693"></count></countGroup><titleGroup><title type="main" xml:lang="en">A MIP‐based local search method for the railway rescheduling problem</title></titleGroup><creators><creator xml:id="au1" creatorRole="author" affiliationRef="#af1" corresponding="yes"><personName><givenNames>Rodrigo</givenNames><familyName>Acuna‐Agost</familyName></personName><contactDetails><email>rodrigoacunaagost@gmail.com</email></contactDetails></creator><creator xml:id="au2" creatorRole="author" affiliationRef="#af1"><personName><givenNames>Philippe</givenNames><familyName>Michelon</familyName></personName></creator><creator xml:id="au3" creatorRole="author" affiliationRef="#af2"><personName><givenNames>Dominique</givenNames><familyName>Feillet</familyName></personName></creator><creator xml:id="au4" creatorRole="author" affiliationRef="#af3"><personName><givenNames>Serigne</givenNames><familyName>Gueye</familyName></personName></creator></creators><affiliationGroup><affiliation xml:id="af1" countryCode="FR" type="organization"><unparsedAffiliation>Université d'Avignon et des Pays de Vaucluse, Laboratoire Informatique d'Avignon, F‐84911 Avignon, France</unparsedAffiliation></affiliation><affiliation xml:id="af2" countryCode="FR" type="organization"><unparsedAffiliation>École des Mines de Saint‐Étienne, CMP Georges Charpak, F‐13541 Gardanne, France</unparsedAffiliation></affiliation><affiliation xml:id="af3" countryCode="FR" type="organization"><unparsedAffiliation>Université du Havre, Laboratoire de Mathématiques Appliquées du Havre, F‐76058 Le Havre, France</unparsedAffiliation></affiliation></affiliationGroup><keywordGroup xml:lang="en" type="author"><keyword xml:id="kwd1">disruption management</keyword><keyword xml:id="kwd2">rescheduling</keyword><keyword xml:id="kwd3">train timetabling</keyword><keyword xml:id="kwd4">local branching</keyword></keywordGroup><fundingInfo><fundingAgency>ALFA Grant II‐0457‐FA‐FCD‐FI‐FC</fundingAgency></fundingInfo><fundingInfo><fundingAgency>PREDIT under MAGES Project</fundingAgency></fundingInfo><abstractGroup><abstract type="main" xml:lang="en"><title type="main">Abstract</title><p>For operational and unpredictable reasons, many small incidents occur day after day in rail transportation systems. Most of them have a local impact, but, in some cases, mainly in dense networks, minimal disruptions can spread out through the whole network and affect significantly the train schedules. In this article, we present the railway rescheduling problem as the problem of finding a new schedule of trains after one or several incidents by minimizing some measure of the effect. We investigate the solution of this problem through a mixed‐integer programming (MIP) formulation. Because of the impossibility for solving it exactly just using a standard MIP solver, we propose to limit the search space around the original nondisrupted schedule by hard and soft fixing of integer variables with local‐branching‐type cuts. Different variations of the method are compared to a right‐shift rescheduling policy in two different networks located in France and Chile. The experimental results are also used to study the impact of different objectives on the total delay. © 2010 Wiley Periodicals, Inc. NETWORKS, 2011</p></abstract></abstractGroup></contentMeta></header></component></istex:document></istex:metadataXml><mods version="3.6"><titleInfo lang="en"><title>A MIP‐based local search method for the railway rescheduling problem</title></titleInfo><titleInfo type="alternative" contentType="CDATA" lang="en"><title>A MIP‐based local search method for the railway rescheduling problem</title></titleInfo><name type="personal"><namePart type="given">Rodrigo</namePart><namePart type="family">Acuna‐Agost</namePart><affiliation>Université d'Avignon et des Pays de Vaucluse, Laboratoire Informatique d'Avignon, F‐84911 Avignon, France</affiliation><description>Correspondence: Université d'Avignon et des Pays de Vaucluse, Laboratoire Informatique d'Avignon, F‐84911 Avignon, France</description><role><roleTerm type="text">author</roleTerm></role></name><name type="personal"><namePart type="given">Philippe</namePart><namePart type="family">Michelon</namePart><affiliation>Université d'Avignon et des Pays de Vaucluse, Laboratoire Informatique d'Avignon, F‐84911 Avignon, France</affiliation><role><roleTerm type="text">author</roleTerm></role></name><name type="personal"><namePart type="given">Dominique</namePart><namePart type="family">Feillet</namePart><affiliation>École des Mines de Saint‐Étienne, CMP Georges Charpak, F‐13541 Gardanne, France</affiliation><role><roleTerm type="text">author</roleTerm></role></name><name type="personal"><namePart type="given">Serigne</namePart><namePart type="family">Gueye</namePart><affiliation>Université du Havre, Laboratoire de Mathématiques Appliquées du Havre, F‐76058 Le Havre, France</affiliation><role><roleTerm type="text">author</roleTerm></role></name><typeOfResource>text</typeOfResource><genre type="article" displayLabel="article"></genre><originInfo><publisher>Wiley Subscription Services, Inc., A Wiley Company</publisher><place><placeTerm type="text">Hoboken</placeTerm></place><dateIssued encoding="w3cdtf">2011-01</dateIssued><dateCaptured encoding="w3cdtf">2008-01</dateCaptured><dateValid encoding="w3cdtf">2009-09</dateValid><copyrightDate encoding="w3cdtf">2011</copyrightDate></originInfo><language><languageTerm type="code" authority="rfc3066">en</languageTerm><languageTerm type="code" authority="iso639-2b">eng</languageTerm></language><physicalDescription><internetMediaType>text/html</internetMediaType><extent unit="references">21</extent><extent unit="words">693</extent></physicalDescription><abstract lang="en">For operational and unpredictable reasons, many small incidents occur day after day in rail transportation systems. Most of them have a local impact, but, in some cases, mainly in dense networks, minimal disruptions can spread out through the whole network and affect significantly the train schedules. In this article, we present the railway rescheduling problem as the problem of finding a new schedule of trains after one or several incidents by minimizing some measure of the effect. We investigate the solution of this problem through a mixed‐integer programming (MIP) formulation. Because of the impossibility for solving it exactly just using a standard MIP solver, we propose to limit the search space around the original nondisrupted schedule by hard and soft fixing of integer variables with local‐branching‐type cuts. Different variations of the method are compared to a right‐shift rescheduling policy in two different networks located in France and Chile. The experimental results are also used to study the impact of different objectives on the total delay. © 2010 Wiley Periodicals, Inc. NETWORKS, 2011</abstract><note type="funding">ALFA Grant II‐0457‐FA‐FCD‐FI‐FC</note><note type="funding">PREDIT under MAGES Project</note><subject lang="en"><genre>keywords</genre><topic>disruption management</topic><topic>rescheduling</topic><topic>train timetabling</topic><topic>local branching</topic></subject><relatedItem type="host"><titleInfo><title>Networks</title></titleInfo><titleInfo type="abbreviated"><title>Networks</title></titleInfo><genre type="journal">journal</genre><identifier type="ISSN">0028-3045</identifier><identifier type="eISSN">1097-0037</identifier><identifier type="DOI">10.1002/(ISSN)1097-0037</identifier><identifier type="PublisherID">NET</identifier><part><date>2011</date><detail type="title"><title>Optimization in Scheduled Transportation Networks</title></detail><detail type="volume"><caption>vol.</caption><number>57</number></detail><detail type="issue"><caption>no.</caption><number>1</number></detail><extent unit="pages"><start>69</start><end>86</end><total>18</total></extent></part></relatedItem><identifier type="istex">BA6A03976F1AEFB04BCE1A11E0A707885A586800</identifier><identifier type="DOI">10.1002/net.20384</identifier><identifier type="ArticleID">NET20384</identifier><accessCondition type="use and reproduction" contentType="copyright">Copyright © 2010 Wiley Periodicals, Inc.</accessCondition><recordInfo><recordContentSource>WILEY</recordContentSource><recordOrigin>Wiley Subscription Services, Inc., A Wiley Company</recordOrigin></recordInfo></mods></metadata><enrichments><json:item><type>multicat</type><uri>https://api.istex.fr/document/BA6A03976F1AEFB04BCE1A11E0A707885A586800/enrichments/multicat</uri></json:item></enrichments><serie></serie></istex></record>Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/France/explor/LeHavreV1/Data/Istex/Corpus
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 001411 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Istex/Corpus/biblio.hfd -nk 001411 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Wicri/France
|area= LeHavreV1
|flux= Istex
|étape= Corpus
|type= RBID
|clé= ISTEX:BA6A03976F1AEFB04BCE1A11E0A707885A586800
|texte= A MIP‐based local search method for the railway rescheduling problem
}}
| This area was generated with Dilib version V0.6.25. |  |