Heuristic solution to a discrete collection model

descriptionPublicationkeyboard_double_arrow_right Article 01 Jun 1972 English Publisher:WileyJournal:Naval Research Logistics Quarterly, volume 19, pages 379-388 (issn: 0028-1441, eissn: 1931-9193,

Copyright policy )

Authors: Saipe, Alan L.; Cunningham, A. A.;

doi: 10.1002/nav.3800190212

Heuristic solution to a discrete collection model

- Summary
- Subjects
- Metrics

Abstract

AbstractA discrete time Collection Model is formulated, involving the completion of a touring objective on a network with stochastic node states. Heuristic touring strategies are constructed, there being as yet inadequate analytic results for its optimal solution. Effectiveness of the heuristics is assessed by comparing expected tour times under the heuristics with expected tour times given perfect information. A branch and bound algorithm is presented for computing the perfect information tour times.

Related Organizations

Keywords

Stochastic network models in operations research, Integer programming

Impact byBIP!

	selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	0
	popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.	Average
	influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	Average
	impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.	Average