Publicação
A branch-and-price algorithm for the vehicle routing problem with 2-dimensional loading constraints
| Resumo: | In this paper, we describe a branch-and-price algorithm for the capacitated vehicle routing problem with 2-dimensional loading constraints and a virtually unlimited number of vehicles. The column generation subproblem is solved heuristically through variable neighborhood search. Branch-and-price is used when it is not possible to add more attractive columns to the current restricted master problem, and the solution remains fractional. In order to accelerate the convergence of the algorithm, a family of valid dual inequalities is presented. Computational results are provided to evaluate the performance of the algorithm and to compare the different branching strategies proposed. |
|---|---|
| Autores principais: | Pinto, Telmo |
| Outros Autores: | Alves, Cláudio; Valério de Carvalho, José Manuel |
| Assunto: | Branch-and-price Computational study Loading constraints Vehicle routing |
| Ano: | 2016 |
| País: | Portugal |
| Tipo de documento: | comunicação em conferência |
| Tipo de acesso: | acesso restrito |
| Instituição associada: | Universidade do Minho |
| Idioma: | inglês |
| Origem: | RepositóriUM - Universidade do Minho |
| _version_ | 1864250154530373632 |
|---|---|
| author | Pinto, Telmo |
| author2 | Alves, Cláudio Valério de Carvalho, José Manuel |
| author2_role | author author |
| author_facet | Pinto, Telmo Alves, Cláudio Valério de Carvalho, José Manuel |
| author_role | author |
| contributor_name_str_mv | Universidade do Minho |
| country_str | PT |
| creators_json_str | [{\"Person.name\":\"Pinto, Telmo\"},{\"Person.name\":\"Alves, Cláudio\"},{\"Person.name\":\"Valério de Carvalho, José Manuel\"}] |
| datacite.contributors.contributor.contributorName.fl_str_mv | Universidade do Minho |
| datacite.creators.creator.creatorName.fl_str_mv | Pinto, Telmo Alves, Cláudio Valério de Carvalho, José Manuel |
| datacite.date.Accepted.fl_str_mv | 2016-01-01T00:00:00Z |
| datacite.rights.fl_str_mv | http://purl.org/coar/access_right/c_16ec |
| datacite.subjects.subject.fl_str_mv | Branch-and-price Computational study Loading constraints Vehicle routing |
| datacite.titles.title.fl_str_mv | A branch-and-price algorithm for the vehicle routing problem with 2-dimensional loading constraints |
| dc.contributor.none.fl_str_mv | Universidade do Minho |
| dc.creator.none.fl_str_mv | Pinto, Telmo Alves, Cláudio Valério de Carvalho, José Manuel |
| dc.date.Accepted.fl_str_mv | 2016-01-01T00:00:00Z |
| dc.format.none.fl_str_mv | application/pdf |
| dc.identifier.none.fl_str_mv | https://hdl.handle.net/1822/53147 |
| dc.language.none.fl_str_mv | eng |
| dc.publisher.none.fl_str_mv | Springer Verlag |
| dc.rights.none.fl_str_mv | http://purl.org/coar/access_right/c_16ec |
| dc.subject.none.fl_str_mv | Branch-and-price Computational study Loading constraints Vehicle routing |
| dc.title.fl_str_mv | A branch-and-price algorithm for the vehicle routing problem with 2-dimensional loading constraints |
| dc.type.none.fl_str_mv | http://purl.org/coar/resource_type/c_5794 |
| description | In this paper, we describe a branch-and-price algorithm for the capacitated vehicle routing problem with 2-dimensional loading constraints and a virtually unlimited number of vehicles. The column generation subproblem is solved heuristically through variable neighborhood search. Branch-and-price is used when it is not possible to add more attractive columns to the current restricted master problem, and the solution remains fractional. In order to accelerate the convergence of the algorithm, a family of valid dual inequalities is presented. Computational results are provided to evaluate the performance of the algorithm and to compare the different branching strategies proposed. |
| dirty | 0 |
| eu_rights_str_mv | restrictedAccess |
| format | conferencePaper |
| fulltext.url.fl_str_mv | https://prod-dspace.uminho.pt/bitstreams/76031256-2541-4cda-a594-21ad1beb1be7/download |
| id | rum_884db55e7dfcb51cfca73d99bc2f168d |
| identifier.url.fl_str_mv | https://hdl.handle.net/1822/53147 |
| 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/53147 |
| organization_str_mv | urn:organizationAcronym:repositorium |
| person_str_mv | Pinto, Telmo Alves, Cláudio Valério de Carvalho, José Manuel |
| publishDate | 2016 |
| publisher.none.fl_str_mv | Springer Verlag |
| reponame_str | RepositóriUM - Universidade do Minho |
| repository_id_str | urn:repositoryAcronym:rum |
| service_str_mv | urn:repositoryAcronym:rum |
| spelling | engSpringer VerlagporIn this paper, we describe a branch-and-price algorithm for the capacitated vehicle routing problem with 2-dimensional loading constraints and a virtually unlimited number of vehicles. The column generation subproblem is solved heuristically through variable neighborhood search. Branch-and-price is used when it is not possible to add more attractive columns to the current restricted master problem, and the solution remains fractional. In order to accelerate the convergence of the algorithm, a family of valid dual inequalities is presented. Computational results are provided to evaluate the performance of the algorithm and to compare the different branching strategies proposed.application/pdfporA branch-and-price algorithm for the vehicle routing problem with 2-dimensional loading constraintsPinto, TelmoAlves, CláudioValério de Carvalho, José ManuelHostingInstitutionOrganizationalUniversidade do Minhoe-mailmailto:repositorium@usdb.uminho.ptrepositorium@usdb.uminho.ptISBNIsPartOf9783319448954ISSNIsPartOf0302-9743DOIIsPartOf10.1007/978-3-319-44896-1_2120162018-03-21T20:45:49Z2016-01-01T00:00:00ZHandlehttps://hdl.handle.net/1822/53147http://purl.org/coar/access_right/c_16ecrestricted accessBranch-and-priceComputational studyLoading constraintsVehicle routing389633 bytesother research producthttp://purl.org/coar/resource_type/c_5794conference paperhttp://purl.org/coar/access_right/c_16ecapplication/pdffulltexthttps://prod-dspace.uminho.pt/bitstreams/76031256-2541-4cda-a594-21ad1beb1be7/download |
| spellingShingle | A branch-and-price algorithm for the vehicle routing problem with 2-dimensional loading constraints Pinto, Telmo Branch-and-price Computational study Loading constraints Vehicle routing |
| subject.fl_str_mv | Branch-and-price Computational study Loading constraints Vehicle routing |
| title | A branch-and-price algorithm for the vehicle routing problem with 2-dimensional loading constraints |
| title_full | A branch-and-price algorithm for the vehicle routing problem with 2-dimensional loading constraints |
| title_fullStr | A branch-and-price algorithm for the vehicle routing problem with 2-dimensional loading constraints |
| title_full_unstemmed | A branch-and-price algorithm for the vehicle routing problem with 2-dimensional loading constraints |
| title_short | A branch-and-price algorithm for the vehicle routing problem with 2-dimensional loading constraints |
| title_sort | A branch-and-price algorithm for the vehicle routing problem with 2-dimensional loading constraints |
| topic | Branch-and-price Computational study Loading constraints Vehicle routing |
| topic_facet | Branch-and-price Computational study Loading constraints Vehicle routing |
| url | https://hdl.handle.net/1822/53147 |
| visible | 1 |