Show simple item record

dc.contributor.authorGavish, Bezalelen_US
dc.contributor.authorGraves, Stephen C.en_US
dc.date.accessioned2004-05-28T19:35:47Z
dc.date.available2004-05-28T19:35:47Z
dc.date.issued1978-07en_US
dc.identifier.urihttp://hdl.handle.net/1721.1/5363
dc.description.abstractNew formulations are presented for the Travelling Salesman problem, and their relationship to previous formulations is investigated. The new formulations are extended to include a variety of transportation scheduling problems, such as the Multi-Travelling Salesman problem, the Delivery problem, the School Bus problem and the Dial-a-Bus problem. A Benders decomposition procedure is applied on the new formulations and the resulting computational rocedure is seen to be identical to previous methods for solving the Travelling Salesman problem. Based on the Lagrangean Relaxation method, a new procedure is suggested for generating lagrange multipliers for a subgradient optimization procedure. The effectiveness of the bounds obtained is demonstrated by computational test results.en_US
dc.description.sponsorshipResearch supported, in part, by the Office of Naval Research under Contract N00014-75-C-0556.en_US
dc.format.extent1746 bytes
dc.format.extent1409715 bytes
dc.format.mimetypeapplication/pdf
dc.language.isoen_USen_US
dc.publisherMassachusetts Institute of Technology, Operations Research Centeren_US
dc.relation.ispartofseriesOperations Research Center Working Paper;OR 078-78en_US
dc.titleThe Travelling Salesman Problem and Related Problemsen_US
dc.typeWorking Paperen_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record