The Open Automation and Control Systems Journal

2014, 6 : 493-496
Published online 2014 December 31. DOI: 10.2174/1874444301406010493
Publisher ID: TOAUTOCJ-6-493

Research on the Bilateral Sweep Heuristic for Single Path’s Construction

Yao Qifu
Department of Mechatronics, Zhejiang Business Technology Institute, Ningbo, Zhejiang, 315012, P.R. China.

ABSTRACT

The team orienteering problem (TOP) is the generation to the case of multi tours of the Orienteering Problem (OP). A pair of origin and destination is specified and a set of potential customers with profits are provided. A single path’s initial construction which is considered as the main procedure for feasible solution initialization for the TOP is formulated as an integer program, then the BS heuristic’s implementing process is illustrated and the process of bilateral sweep heuristic algorithm (BS) is detailed. Applying the BS to solve the related combinatorial optimization problems appears to be a very promising technique.

Keywords:

Bilateral sweep heuristic, Single path, Team orienteering problem.