Optimal routing of a single vehicle with loading and unloading constraints

References

• Chistofides , N. , Mingozzi , A. and Toth , P. 1980 . “Dynamic loading and unloading of liquids into tanks,” . Operations Research , 28 : 633 – 649 .
   Web of Science ®Google Scholar
• Held , M. and Karp , M. 1971 . “The travelling salesman problem and minimum spanning trees,” . Math. Programming , 1 : 6 – 25 . Part II
   Google Scholar
• Bellmore , M. and Nemhauser , G. L. 1968 . “The travelling salesman problem — a survey,” . Operations Research , 16 : 538 – 558 .
   Web of Science ®Google Scholar
• Bellman , R. 1962 . “Dynamic programming treatment of the travelling salesman problem,” . J. Assoc. Comp. Mech. , 9 : 61 – 63 .
   Web of Science ®Google Scholar
• Gonzales , R. H. 1962 . “Solution to the travelling salesman problem by dynamic programming on the hypercube,” . In Tech. Rep. No. 18, , O.R. Center, Masschausetts Institute of Technology .
   Google Scholar
• Gilmore , P. C. and Gomory , R.E. 1964 . “Sequencing a one‐state variable machine — a solvable case of the travelling salesman problem,” . Operations Research , 12 : 655 – 679 .
   Web of Science ®Google Scholar
• Picard , J. C. and Queyranne , M. 1978 . “The Time‐dependent travelling salesman problem and its application to the tardiness problem in one‐machine scheduling,” . Operations Research , 26 : 86 – 110 .
   Web of Science ®Google Scholar