Publicação
Solving the vehicle routing problem with time windows and multiple routes exactly using a pseudo-polynomial model
| Resumo: | 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. |
|---|---|
| Autores principais: | Macedo, Rita |
| Outros Autores: | Alves, Cláudio; Carvalho, J. M. Valério de; Clautiaux, François; Hanafi, Said |
| Assunto: | Integer programming Combinatorial optimizatin Combinatorial optimization Routing Network flows |
| Ano: | 2011 |
| País: | Portugal |
| Tipo de documento: | artigo |
| Tipo de acesso: | acesso restrito |
| Instituição associada: | Universidade do Minho |
| Idioma: | inglês |
| Origem: | RepositóriUM - Universidade do Minho |
| _version_ | 1866875557225955328 |
|---|---|
| author | Macedo, Rita |
| author2 | Alves, Cláudio Carvalho, J. M. Valério de Clautiaux, François Hanafi, Said |
| author2_role | author author author author |
| author_facet | Macedo, Rita Alves, Cláudio Carvalho, J. M. Valério de Clautiaux, François Hanafi, Said |
| author_role | author |
| contributor_name_str_mv | Universidade do Minho |
| country_str | PT |
| creators_json_txt | [{\"Person.name\":\"Macedo, Rita\"},{\"Person.name\":\"Alves, Cláudio\"},{\"Person.name\":\"Carvalho, J. M. Valério de\"},{\"Person.name\":\"Clautiaux, François\"},{\"Person.name\":\"Hanafi, Said\"}] |
| datacite.contributors.contributor.contributorName.fl_str_mv | Universidade do Minho |
| datacite.creators.creator.creatorName.fl_str_mv | Macedo, Rita Alves, Cláudio Carvalho, J. M. Valério de Clautiaux, François Hanafi, Said |
| datacite.date.Accepted.fl_str_mv | 2011-01-01T00:00:00Z |
| datacite.date.available.fl_str_mv | 2011-12-14T15:35:58Z |
| datacite.date.embargoed.fl_str_mv | 2011-12-14T15:35:58Z |
| datacite.rights.fl_str_mv | http://purl.org/coar/access_right/c_16ec |
| datacite.subjects.subject.fl_str_mv | Integer programming Combinatorial optimizatin Combinatorial optimization Routing Network flows |
| datacite.titles.title.fl_str_mv | Solving the vehicle routing problem with time windows and multiple routes exactly using a pseudo-polynomial model |
| dc.contributor.none.fl_str_mv | Universidade do Minho |
| dc.creator.none.fl_str_mv | Macedo, Rita Alves, Cláudio Carvalho, J. M. Valério de Clautiaux, François Hanafi, Said |
| dc.date.Accepted.fl_str_mv | 2011-01-01T00:00:00Z |
| dc.date.available.fl_str_mv | 2011-12-14T15:35:58Z |
| dc.date.embargoed.fl_str_mv | 2011-12-14T15:35:58Z |
| dc.format.none.fl_str_mv | application/pdf |
| dc.identifier.none.fl_str_mv | https://hdl.handle.net/1822/15196 |
| dc.language.none.fl_str_mv | eng |
| dc.publisher.none.fl_str_mv | Elsevier Science |
| dc.rights.none.fl_str_mv | http://purl.org/coar/access_right/c_16ec |
| dc.subject.none.fl_str_mv | Integer programming Combinatorial optimizatin Combinatorial optimization Routing Network flows |
| dc.title.fl_str_mv | Solving the vehicle routing problem with time windows and multiple routes exactly using a pseudo-polynomial model |
| dc.type.none.fl_str_mv | http://purl.org/coar/resource_type/c_6501 |
| description | 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. |
| dirty | 0 |
| eu_rights_str_mv | restrictedAccess |
| format | article |
| fulltext.url.fl_str_mv | https://prod-dspace.uminho.pt/bitstreams/3c6d0b2d-3f2f-4fe7-8aa9-ef6a2f8e06bf/download |
| id | rum_2d3a28f8a8ae33fe2b01db45331aec35 |
| identifier.url.fl_str_mv | https://hdl.handle.net/1822/15196 |
| instacron_str | repositorium |
| institution | Universidade do Minho |
| instname_str | Universidade do Minho |
| language | eng |
| network_acronym_str | rum |
| network_name_str | RepositóriUM - Universidade do Minho |
| oai_identifier_str | oai:repositorium.uminho.pt:1822/15196 |
| organization_str_mv | urn:organizationAcronym:repositorium |
| person_str_mv | Macedo, Rita Alves, Cláudio Carvalho, J. M. Valério de Clautiaux, François Hanafi, Said |
| publishDate | 2011 |
| publisher.none.fl_str_mv | Elsevier Science |
| reponame_str | RepositóriUM - Universidade do Minho |
| repository_id_str | urn:repositoryAcronym:rum |
| service_str_mv | urn:repositoryAcronym:rum |
| spelling | engElsevier ScienceporIn 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.application/pdfporSolving the vehicle routing problem with time windows and multiple routes exactly using a pseudo-polynomial modelMacedo, RitaAlves, CláudioCarvalho, J. M. Valério deClautiaux, FrançoisHanafi, SaidHostingInstitutionOrganizationalUniversidade do Minhoe-mailmailto:repositorium@usdb.uminho.ptrepositorium@usdb.uminho.ptISSNIsPartOf0377-2217DOIIsPartOf10.1016/j.ejor.2011.04.0372011-12-14T15:35:58Z201120102011-01-01T00:00:00ZHandlehttps://hdl.handle.net/1822/15196http://purl.org/coar/access_right/c_16ecrestricted accessInteger programmingCombinatorial optimizatinCombinatorial optimizationRoutingNetwork flows678294 bytesliteraturehttp://purl.org/coar/resource_type/c_6501journal articlehttp://purl.org/coar/access_right/c_16ecapplication/pdffulltexthttps://prod-dspace.uminho.pt/bitstreams/3c6d0b2d-3f2f-4fe7-8aa9-ef6a2f8e06bf/download |
| spellingShingle | Solving the vehicle routing problem with time windows and multiple routes exactly using a pseudo-polynomial model Macedo, Rita Integer programming Combinatorial optimizatin Combinatorial optimization Routing Network flows |
| status | SINGLETON |
| subject.fl_str_mv | Integer programming Combinatorial optimizatin Combinatorial optimization Routing Network flows |
| title | Solving the vehicle routing problem with time windows and multiple routes exactly using a pseudo-polynomial model |
| title_full | Solving the vehicle routing problem with time windows and multiple routes exactly using a pseudo-polynomial model |
| title_fullStr | Solving the vehicle routing problem with time windows and multiple routes exactly using a pseudo-polynomial model |
| title_full_unstemmed | Solving the vehicle routing problem with time windows and multiple routes exactly using a pseudo-polynomial model |
| title_short | Solving the vehicle routing problem with time windows and multiple routes exactly using a pseudo-polynomial model |
| title_sort | Solving the vehicle routing problem with time windows and multiple routes exactly using a pseudo-polynomial model |
| topic | Integer programming Combinatorial optimizatin Combinatorial optimization Routing Network flows |
| topic_facet | Integer programming Combinatorial optimizatin Combinatorial optimization Routing Network flows |
| url | https://hdl.handle.net/1822/15196 |
| visible | 1 |