Diversified local search strategy under scatter search framework for the probabilistic traveling salesman problem
AbstractThis paper focuses on introducing a concept of diversified local search strategy under the scatter search framework for the probabilistic traveling salesman problem (PTSP). Different combinations of three commonly used local search methods in the PTSP, i.e., 1-shift, 2-opt, and 3-opt, were used to investigate its effects. A set of numerical experiments were conducted to test the validity of the proposed strategy based on randomly generated test instances. The numerical results and the permutation test showed that the diversified local search strategy, especially by combining 1-shift and 2-opt algorithms, can most effectively solve the homogeneous and heterogeneous PTSP in most of the tested instances in comparison with the single local search strategy under scatter search framework.
Download InfoIf you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
As the access to this document is restricted, you may want to look for a different version under "Related research" (further below) or search for a different version of it.
Bibliographic InfoArticle provided by Elsevier in its journal European Journal of Operational Research.
Volume (Year): 191 (2008)
Issue (Month): 2 (December)
Contact details of provider:
Web page: http://www.elsevier.com/locate/eor
Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
- Bianchi, Leonora & Knowles, Joshua & Bowler, Neill, 2005. "Local search for the probabilistic traveling salesman problem: Correction to the 2-p-opt and 1-shift algorithms," European Journal of Operational Research, Elsevier, vol. 162(1), pages 206-219, April.
- Hansen, Pierre & Mladenovic, Nenad, 2001. "Variable neighborhood search: Principles and applications," European Journal of Operational Research, Elsevier, vol. 130(3), pages 449-467, May.
- Bertsimas, Dimitris & Howell, Louis H., 1993. "Further results on the probabilistic traveling salesman problem," European Journal of Operational Research, Elsevier, vol. 65(1), pages 68-95, February.
- Bianchi, Leonora & Campbell, Ann Melissa, 2007. "Extension of the 2-p-opt and 1-shift algorithms to the heterogeneous probabilistic traveling salesman problem," European Journal of Operational Research, Elsevier, vol. 176(1), pages 131-144, January.
- John J. Bartholdi, III & Loren K. Platzman, 1988. "Heuristics Based on Spacefilling Curves for Combinatorial Problems in Euclidean Space," Management Science, INFORMS, vol. 34(3), pages 291-305, March.
- Gendron, Bernard & Potvin, Jean-Yves & Soriano, Patrick, 2002. "Diversification strategies in local search for a nonbifurcated network loading problem," European Journal of Operational Research, Elsevier, vol. 142(2), pages 231-241, October.
- Liu, Yu-Hsin, 2011. "Incorporating scatter search and threshold accepting in finding maximum likelihood estimates for the multinomial probit model," European Journal of Operational Research, Elsevier, vol. 211(1), pages 130-138, May.
- Kang, Seungmo & Ouyang, Yanfeng, 2011. "The traveling purchaser problem with stochastic prices: Exact and approximate algorithms," European Journal of Operational Research, Elsevier, vol. 209(3), pages 265-272, March.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Zhang, Lei).
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
If references are entirely missing, you can add them using this form.
If the full references list an item that is present in RePEc, but the system did not link to it, you can help with this form.
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your profile, as there may be some citations waiting for confirmation.
Please note that corrections may take a couple of weeks to filter through the various RePEc services.