Conference Interactive Program
To view the 2013 Annual Meeting Interactive Program
TRB 90th Annual Meeting (January 23-27, 2011)
Modeling Theories and Practices in Freight Planning and Logistics
Jan 26 2011 2:30PM- 5:00PM
Shoreham, Blue Room Foyer
New Formulation for Traveling Salesman Problem with Separation Requirement and Cost (11-1307)
A unique integer linear programming formulation is proposed to define a Hamiltonian tour in which the cost between a node pair is determined by the number of nodes in between them on the tour. In addition, a node separation requirement may be conditional on other node separations. We briefly discuss some properties of this new TSP formulation. In a special case, we discuss an a priori solution to the probabilistic TSP problem with equal node coverage probability, as an LP alternative to the probabilistic programming method in literature. We additionally propose an LP based heuristic, which is tested numerically.
Wang, Xiubin Bruce, Texas A&M University
Regan, Amelia , University of California, Irvine
Miao, Qing , Texas A&M University
Transportation Research Board. 500 Fifth St. NW, Washington, D.C. 20001
Copyright © 2012. National Academy of Sciences. All Rights Reserved.