A hybrid scatter search for the probabilistic traveling salesman problem

The probabilistic traveling salesman problem (PTSP) is an important theoretical and practical topic in the study of stochastic network problems. It provides researchers with a modeling framework for exploring the stochastic effects in routing problems. This paper focuses on developing the hybrid sca...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Computers & operations research 2007-10, Vol.34 (10), p.2949-2963
1. Verfasser:	Liu, Yu-Hsin
Format:	Artikel
Sprache:	eng
Schlagworte:	Applied sciences Edge recombination crossover Exact sciences and technology Flows in networks. Combinatorial problems Logistics Operational research and scientific management Operational research. Management science Optimization algorithms Probabilistic traveling salesman problem Scatter search Stochastic combinatorial optimization Stochastic models Studies Threshold accepting Traveling salesman problem
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!