| dc.contributor.author | Agarwal, Y. | |
| dc.contributor.author | Venkateshan, Prahalad | |
| dc.date.accessioned | 2021-05-24T06:31:23Z | |
| dc.date.available | 2021-05-24T06:31:23Z | |
| dc.date.issued | 2019 | |
| dc.identifier.citation | Agarwal, 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.005 | en_US |
| dc.identifier.issn | 01676377 | |
| dc.identifier.uri | http://hdl.handle.net/11718/23877 | |
| dc.description.abstract | The 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.iso | en | en_US |
| dc.publisher | Operations Research Letters | en_US |
| dc.subject | Reverse logistics | en_US |
| dc.subject | Branch-and-cut | en_US |
| dc.subject | VRP with simultaneous pickup and delivery | en_US |
| dc.title | A new model for the asymmetric vehicle routing problem with simultaneous pickup and deliveries | en_US |
| dc.type | Article | en_US |
