Show simple item record

dc.contributor.authorYaman, H.en_US
dc.date.accessioned2016-02-08T10:19:11Z
dc.date.available2016-02-08T10:19:11Z
dc.date.issued2006en_US
dc.identifier.issn0025-5610
dc.identifier.urihttp://hdl.handle.net/11693/23786
dc.description.abstractWe consider the vehicle routing problem where one can choose among vehicles with different costs and capacities to serve the trips. We develop six different formulations: the first four based on Miller-Tucker-Zemlin constraints and the last two based on flows. We compare the linear programming bounds of these formulations. We derive valid inequalities and lift some of the constraints to improve the lower bounds. We generalize and strengthen subtour elimination and generalized large multistar inequalities.en_US
dc.language.isoEnglishen_US
dc.source.titleMathematical Programmingen_US
dc.relation.isversionofhttp://dx.doi.org/10.1007/s10107-005-0611-6en_US
dc.subjectLinear programmingen_US
dc.subjectProblem solvingen_US
dc.subjectHeterogeneous vehicle routing problemen_US
dc.subjectMix fleeten_US
dc.subjectValid inequalitiesen_US
dc.subjectLiftingen_US
dc.subjectProjectionen_US
dc.titleFormulations and valid inequalities for the heterogeneous vehicle routing problemen_US
dc.typeArticleen_US
dc.departmentDepartment of Industrial Engineeringen_US
dc.citation.spage365en_US
dc.citation.epage390en_US
dc.citation.volumeNumber106en_US
dc.citation.issueNumber2en_US
dc.identifier.doi10.1007/s10107-005-0611-6en_US
dc.publisherSpringeren_US
dc.identifier.eissn1436-4646


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record