CYCLIC TRANSFER ALGORITHMS FOR MULTIVEHICLE ROUTING AND SCHEDULING PROBLEMS

THOMPSON, PM; PSARAFTIS, HN

dc.contributor.author	THOMPSON, PM	en
dc.contributor.author	PSARAFTIS, HN	en
dc.date.accessioned	2014-03-01T01:09:20Z
dc.date.available	2014-03-01T01:09:20Z
dc.date.issued	1993	en
dc.identifier.issn	0030-364X	en
dc.identifier.uri	https://dspace.lib.ntua.gr/xmlui/handle/123456789/10920
dc.subject	Scheduling Problem	en
dc.subject.classification	Management	en
dc.subject.classification	Operations Research & Management Science	en
dc.subject.other	TRAVELING SALESMAN PROBLEMS	en
dc.subject.other	TIME WINDOW CONSTRAINTS	en
dc.subject.other	VEHICLE	en
dc.subject.other	PERSPECTIVES	en
dc.subject.other	HEURISTICS	en
dc.title	CYCLIC TRANSFER ALGORITHMS FOR MULTIVEHICLE ROUTING AND SCHEDULING PROBLEMS	en
heal.type	journalArticle	en
heal.identifier.primary	10.1287/opre.41.5.935	en
heal.identifier.secondary	http://dx.doi.org/10.1287/opre.41.5.935	en
heal.language	English	en
heal.publicationDate	1993	en
heal.abstract	This paper investigates the application of a new class of neighborhood search algorithms-cyclic transfers-to multivehicle routing and scheduling problems. These algorithms exploit the two-faceted decision structure inherent to this problem class: First, assigning demands to vehicles and, second, routing each vehicle through its assigned demand stops. We describe the application of cyclic transfers to vehicle routing and scheduling problems. Then we determine the worst-case performance of these algorithms for several classes of vehicle routing and scheduling problems. Next, we develop computationally efficient methods for finding negative cost cyclic transfers. Finally, we present computational results for three diverse vehicle routing and scheduling problems, which collectively incorporate a variety of constraint and objective function structures. Our results show that cyclic transfer methods are either comparable to or better than the best published heuristic algorithms for several complex and important vehicle routing and scheduling problems. Most importantly, they represent a novel approach to solution improvement which holds promise in many vehicle routing and scheduling problem domains.	en
heal.publisher	OPERATIONS RESEARCH SOC AMER	en
heal.journalName	OPERATIONS RESEARCH	en
dc.identifier.doi	10.1287/opre.41.5.935	en
dc.identifier.isi	ISI:A1993MD43400008	en
dc.identifier.volume	41	en
dc.identifier.issue	5	en
dc.identifier.spage	935	en
dc.identifier.epage	946	en