01338042

Component

https://doi.org/10.3141/2224-08

http://scholar.google.com...Miao&publication_year=2011

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 between each pair on the tour. In addition, a node separation requirement may be conditional on other node separations. Properties of this new traveling salesman problem formulation are discussed, along with an a priori solution to the probabilistic traveling salesman problem with equal node coverage probability as a linear programming alternative to the probabilistic programming method in the literature. A linear programming-based heuristic is proposed and numerically tested.

01353537

11-1307

English

pp 61-67

2011

Transportation Research Record: Journal of the Transportation Research Board

9780309167352

Print

Appendices (1) ; References (10) ; Tables (2)

Costs; Heuristic methods; Linear programming; Network nodes; Numerical analysis; Traveling salesman problem

Freight Transportation; Planning and Forecasting; I72: Traffic and Transport Planning

TRIS, TRB

Feb 17 2011 5:45PM

• Algorithms for Studying the Impact of Travel Time Reliability Along Multisegment Trucking Freight Corridors
• Estimating the Benefits of Performance-Based Standards Vehicles
• Evaluation of Emissions Reduction in Urban Pickup Systems: Heterogeneous Fleet Case Study
• Freight Generation, Freight Trip Generation, and Perils of Using Constant Trip Rates
• Intermodal Container Flow Simulation Model and Its Applications
• Models for Minimizing Backhaul Costs Through Freight Collaboration
• Multicriteria Freeway Performance Measures for Trucking in Congested Corridors
• Online Freight Network Assignment Model with Transportation Disruptions and Recourse
• Supply Chain Broker Operations: Network Perspective
• Time-Dependent Effects on Parameters of Freight Demand Models: Empirical Investigation