Show simple item record

dc.contributor.authorBattarra, M.
dc.contributor.authorErdoğan, Güneş
dc.contributor.authorLaporte, G.
dc.contributor.authorVigo, D.
dc.date.accessioned2010-10-13T11:46:54Z
dc.date.available2010-10-13T11:46:54Z
dc.date.issued2010-08
dc.identifier.issn1526-5447
dc.identifier.urihttp://hdl.handle.net/10679/122
dc.identifier.urihttp://pubsonline.informs.org/doi/abs/10.1287/trsc.1100.0316
dc.descriptionDue to copyright restrictions, the access to the full text of this article is only available via subscription.
dc.description.abstractThis paper introduces a new variant of the one-to-many-to-one single vehicle pickup and delivery problems (SVPDP) that incorporates the handling cost incurred when rearranging the load at the customer locations. The simultaneous optimization of routing and handling costs is difficult, and the resulting loading patterns are hard to implement in practice. However, this option makes economical sense in contexts where the routing cost dominates the handling cost. We have proposed some simplified policies applicable to such contexts. The first is a two-phase heuristic in which the tour having minimum routing cost is initially determined by optimally solving an SVPDP, and the optimal handling policy is then determined for that tour. In addition, branch-and-cutalgorithms based on integer linear programming formulations are proposed, in which routing and handling decisions are simultaneously optimized, but the handling decisions are restricted to three simplified policies. The formulations are strengthened by means of problem specific valid inequalities. The proposed methods have been extensively tested on instances involving up to 25 customers and hundreds of items. Our results show the impact of the handling aspect on the customer sequencing and indicate that the simplified handling policies favorably compare with the optimal one.en_US
dc.description.sponsorshipCanadian Natural Science and Engineering Research Council ; Ministero dell’Istruzione, Università e Ricerca
dc.language.isoengen_US
dc.publisherInformsen_US
dc.relation.ispartofTransportation Science
dc.rightsrestrictedAccess
dc.titleThe traveling salesman problem with pickups, deliveries, and handling costsen_US
dc.typeArticleen_US
dc.peerreviewedyesen_US
dc.publicationstatuspublisheden_US
dc.contributor.departmentÖzyeğin University
dc.contributor.authorID172715
dc.contributor.ozuauthorErdoğan, Güneş
dc.identifier.volume44
dc.identifier.issue3
dc.identifier.startpage383
dc.identifier.endpage399
dc.identifier.wosWOS:000280887100007
dc.identifier.doi10.1287/trsc.1100.0316
dc.subject.keywordsThe traveling salesman problemen_US
dc.subject.keywordsCombinatorial optimizationen_US
dc.subject.keywordsExact algorithmen_US
dc.identifier.scopusSCOPUS:2-s2.0-77955704996


Files in this item

FilesSizeFormatView

There are no files associated with this item.

This item appears in the following Collection(s)

Show simple item record


Share this page