Extension of the 2-p-opt and 1-shift algorithms to the heterogeneous probabilistic traveling salesman problem-Reference-Cited by-同舟云学术

Extension of the 2-p-opt and 1-shift algorithms to the heterogeneous probabilistic traveling salesman problem

Published:2007-01 Issue:1 Volume:176 Page:131-144
ISSN:0377-2217
Container-title:European Journal of Operational Research
language:en
Short-container-title:European Journal of Operational Research

Author:

Bianchi Leonora,Campbell Ann Melissa

Publisher

Elsevier BV

Subject

Information Systems and Management,Management Science and Operations Research,Modeling and Simulation,General Computer Science,Industrial and Manufacturing Engineering

Reference12 articles.

1. Finding the optimal a priori tour and location of a traveling salesman with nonhomogeneous customers;Berman;Transportation Science,1988

2. Computational approaches to stochastic vehicle routing problems;Bertsimas;Transportation Science,1995

3. Further results on the probabilistic traveling salesman problem;Bertsimas;European Journal of Operational Research,1993

4. Solving the homogeneous probabilistic traveling salesman problem by the ACO metaheuristic;Bianchi,2002

5. Local search for the probabilistic traveling salesman problem: Correction to the 2-p-opt and 1-shift algorithms;Bianchi;European Journal of Operational Research,2005

Cited by 27 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Branch-and-price for routing with probabilistic customers;Computers & Industrial Engineering;2023-09

2. Solving Probabilistic Traveling Salesman Problem;The Traveling Salesman Problem;2023-07-09

3. Some Heuristic Methods for Discrete Facility Location with Uncertain Demands;International Series in Operations Research & Management Science;2023

4. Stochastic hub location problems with Bernoulli demands;Computers & Operations Research;2022-09

5. A novel state transition simulated annealing algorithm for the multiple traveling salesmen problem;The Journal of Supercomputing;2021-03-29