Utilize este identificador para referenciar este registo:
https://hdl.handle.net/1822/15196
Registo completo
Campo DC | Valor | Idioma |
---|---|---|
dc.contributor.author | Macedo, Rita | - |
dc.contributor.author | Alves, Cláudio | - |
dc.contributor.author | Carvalho, J. M. Valério de | - |
dc.contributor.author | Clautiaux, François | - |
dc.contributor.author | Hanafi, Said | - |
dc.date.accessioned | 2011-12-14T15:35:58Z | - |
dc.date.available | 2011-12-14T15:35:58Z | - |
dc.date.issued | 2011 | - |
dc.date.submitted | 2010 | - |
dc.identifier.issn | 0377-2217 | por |
dc.identifier.uri | https://hdl.handle.net/1822/15196 | - |
dc.description.abstract | In this paper, we address a variant of the vehicle routing problem called the vehicle routing problem with time windows and multiple routes. It considers that a given vehicle can be assigned to more than one route per planning period. We propose a new exact algorithm for this problem. Our algorithm is iterative and it relies on a pseudo-polynomial network flow model whose nodes represent time instants, and whose arcs represent feasible vehicle routes. This algorithm was tested on a set of benchmark instances from the literature. The computational results show that our method is able to solve more instances than the only other exact method described so far in the literature, and it clearly outperforms this method in terms of computing time. | por |
dc.description.sponsorship | This work was partially supported by the Portuguese Science and Technology Foundation through the doctoral grant SFRH/BD/39607/2007 for Rita Macedo, by the Algoritmi Research Center of the University of Minho for Claudio Alves and Jose Valerio de Carvalho, by the Universite de Lille 1 and INRIA Lille Nord Europe for Francois Clautiaux, and by the International Campus on Safety and Intermodality in Transportation, the Nord-Pas-de-Calais Region, the European Community, the Regional Delegation for Research and Technology, the French Ministry of Higher Education and Research, and the French National Center for Scientific Research for Said Hanafi. | por |
dc.language.iso | eng | por |
dc.publisher | Elsevier Science BV | por |
dc.rights | restrictedAccess | por |
dc.subject | Integer programming | por |
dc.subject | Combinatorial optimizatin | por |
dc.subject | Combinatorial optimization | por |
dc.subject | Routing | por |
dc.subject | Network flows | por |
dc.title | Solving the vehicle routing problem with time windows and multiple routes exactly using a pseudo-polynomial model | por |
dc.type | article | - |
dc.peerreviewed | yes | por |
sdum.publicationstatus | published | por |
oaire.citationStartPage | 536 | por |
oaire.citationEndPage | 545 | por |
oaire.citationIssue | 3 | por |
oaire.citationTitle | European Journal of Operational Research | por |
oaire.citationVolume | 214 | por |
dc.identifier.doi | 10.1016/j.ejor.2011.04.037 | por |
dc.subject.wos | Social Sciences | por |
dc.subject.wos | Science & Technology | por |
sdum.journal | European Journal of Operational Research | por |
Aparece nas coleções: | CAlg - Artigos em revistas internacionais / Papers in international journals LES/ALG - Artigos em revistas científicas internacionais com arbitragem |
Ficheiros deste registo:
Ficheiro | Descrição | Tamanho | Formato | |
---|---|---|---|---|
MVRPTW.pdf Acesso restrito! | 662,4 kB | Adobe PDF | Ver/Abrir |