Formulations and branch-and-cut algorithms for the generalized vehicle routing problem
dc.contributor.author | Bektaş, T. | |
dc.contributor.author | Erdoğan, Güneş | |
dc.contributor.author | Ropke, S. | |
dc.date.accessioned | 2012-08-17T07:58:07Z | |
dc.date.available | 2012-08-17T07:58:07Z | |
dc.date.issued | 2011-08 | |
dc.identifier.issn | 0041-1655 | |
dc.identifier.uri | http://hdl.handle.net/10679/240 | |
dc.identifier.uri | http://transci.journal.informs.org/content/early/2011/02/18/trsc.1100.0352.abstract | |
dc.description.abstract | The generalized vehicle routing problem (GVRP) consists of finding a set of routes for a number of capacitated vehicles on a graph where the vertices are partitioned into clusters with given demands, such that the total cost of travel is minimized and all demands are met. This paper describes and compares four new integer linear programming formulations for the GVRP, two based on multicommodity flow and the other two based on exponential-size sets of inequalities. Branch-and-cut algorithms are proposed for the latter two. Computational results on a large set of instances are presented. | en_US |
dc.description.sponsorship | University of Southampton | |
dc.language.iso | eng | en_US |
dc.publisher | Informs | en_US |
dc.relation.ispartof | Transportation Science | |
dc.rights | restrictedAccess | |
dc.title | Formulations and branch-and-cut algorithms for the generalized vehicle routing problem | en_US |
dc.type | Article | en_US |
dc.peerreviewed | yes | en_US |
dc.publicationstatus | published | en_US |
dc.contributor.department | Özyeğin University | |
dc.contributor.authorID | (ORCID 0000-0002-2456-3719 & YÖK ID 172715) Erdoğan, Güneş | |
dc.contributor.ozuauthor | Erdoğan, Güneş | |
dc.identifier.volume | 45 | |
dc.identifier.issue | 3 | |
dc.identifier.startpage | 299 | |
dc.identifier.endpage | 316 | |
dc.identifier.wos | WOS:000293890400002 | |
dc.identifier.doi | 10.1287/trsc.1100.0352 | |
dc.subject.keywords | Generalized vehicle routing | en_US |
dc.subject.keywords | Integer programming | en_US |
dc.subject.keywords | Branch-and-cut | en_US |
dc.identifier.scopus | SCOPUS:2-s2.0-80051924578 | |
dc.contributor.authorMale | 1 | |
dc.relation.publicationcategory | Article - International Refereed Journal - Institutional Academic Staff |
Files in this item
Files | Size | Format | View |
---|---|---|---|
There are no files associated with this item. |
This item appears in the following Collection(s)
Share this page