Please use this identifier to cite or link to this item: http://hdl.handle.net/11718/23877
Full metadata record
DC FieldValueLanguage
dc.contributor.authorAgarwal, Y.
dc.contributor.authorVenkateshan, Prahalad
dc.date.accessioned2021-05-24T06:31:23Z
dc.date.available2021-05-24T06:31:23Z
dc.date.issued2019
dc.identifier.citationAgarwal, Y., & Venkateshan, P. (2019). A new model for the asymmetric vehicle routing problem with simultaneous pickup and deliveries. Operations Research Letters, 48(1), 48-54. doi:https://doi.org/10.1016/j.orl.2019.11.005en_US
dc.identifier.issn01676377
dc.identifier.urihttp://hdl.handle.net/11718/23877
dc.description.abstractThe asymmetric vehicle routing problem with simultaneous pickup and deliveries is considered. This paper develops four new classes of valid inequalities for the problem. We generalize the idea of a no-good cut. Together, these help us solve 45-node randomly generated problem instances more efficiently. We report results on a set of benchmark instances in literature. In this set, we are able to show an order of magnitude improvement in computational times over currently published results in literature.en_US
dc.language.isoenen_US
dc.publisherOperations Research Lettersen_US
dc.subjectReverse logisticsen_US
dc.subjectBranch-and-cuten_US
dc.subjectVRP with simultaneous pickup and deliveryen_US
dc.titleA new model for the asymmetric vehicle routing problem with simultaneous pickup and deliveriesen_US
dc.typeArticleen_US
Appears in Collections:Journal Articles

Files in This Item:
There are no files associated with this item.


Items in IIMA Institutional Repository are protected by copyright, with all rights reserved, unless otherwise indicated.