Skip to main content
SpringerLink
Log in

New formulation for the high multiplicity asymmetric traveling salesman problem with application to the Chesapeake problem

  • Original Paper
  • Published:
Optimization Letters Aims and scope Submit manuscript

Abstract

This paper presents a new model for a special type of traveling salesman problem called the High Multiplicity Asymmetric Traveling Salesman Problem (HMATSP). The formulation adopts a flow-based subtour elimination structure and establishes its validity for this problem. Also, we present computational results to demonstrate the efficacy of our modeling approach. The model is then incorporated as a substructure in a formulation for the lot-sizing problem involving parallel machines and sequence-dependent setup costs, also known as the Chesapeake Problem, and related test problems are solved to optimality for the first time in the literature.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Baker, T., Muckstadt, J.A.: The CHES problems. Technical Paper, Chesapeake Decision Sciences, Inc., Providence (1989)

  2. Belvaux G., Wolsey L.A.: Modeling practical lot-sizing problems as mixed integer programs. Manage. Sci. 47, 993–1007 (2001)

    Article  Google Scholar 

  3. Cosmadakis S.S., Papadimitriou C.H.: The traveling salesman problem with many visits to few cities. SIAM J. Comput. 13, 99–108 (1984)

    Article  MATH  MathSciNet  Google Scholar 

  4. Dantzig G., Fulkerson D., Johnson S.: Solution of a large scale traveling salesman problem. Oper. Res. 2, 393–410 (1954)

    Article  MathSciNet  Google Scholar 

  5. Dastidar S.G., Nagi R.: Scheduling injection modeling operations with multiple resource constraints and sequence dependent setup times and costs. Comput. Oper. Res. 32, 2987–3005 (2005)

    Article  MATH  Google Scholar 

  6. Fleischmann B.: The discrete lot-sizing and scheduling problem with sequence-dependent setup costs. Eur. J. Oper. Res. 75, 395–404 (1994)

    Article  MATH  Google Scholar 

  7. Grigoriev A., van de Klundert J.: On the high multiplicity traveling salesman problem. Discrete Optim. 3, 50–62 (2006)

    Article  MATH  MathSciNet  Google Scholar 

  8. Gupta D., Magnusson T.: The capacitated lot-sizing and scheduling problem with sequence-dependent setup costs and setup times. Comput. Oper. Res. 32, 727–747 (2005)

    Article  MATH  MathSciNet  Google Scholar 

  9. Hasse K., Kimms A.: Lot sizing and scheduling with sequence-dependent setup costs and times and efficient rescheduling opportunities. Int. J. Prod. Econ. 66, 159–169 (2000)

    Article  Google Scholar 

  10. Kang S., Malik K., Thomas L.J.: Lotsizing and scheduling on parallel machines with sequence-dependent setup costs. Manage. Sci. 45, 273–289 (1999)

    Article  Google Scholar 

  11. Meyr H.: Simultaneous lotsizing and scheduling on parallel machines. Eur. J. Oper. Res. 139, 277–292 (2002)

    Article  MATH  MathSciNet  Google Scholar 

  12. Sarin S.C., Sherali H.D., Bhootra A.: New tighter polynomial length formulations for the asymmetric traveling salesman problem with and without precedence constraints. Oper. Res. Lett. 33, 62–70 (2005)

    Article  MATH  MathSciNet  Google Scholar 

  13. Sherali H.D., Sarin S.C., Tsai P.F.: A class of lifted path and flow-based formulations for the asymmetric traveling salesman problem with and without precedence constraints. Discrete Optim. 3, 20–32 (2006)

    Article  MATH  MathSciNet  Google Scholar 

  14. Wong, R.T.: Integer programming formulations of the traveling salesman problem. In: Proceedings of the IEEE International Conference on Circuits and Computers, Part I, pp. 149–152, New York (1980)

Download references

Author information

Authors and Affiliations

  1. Grado Department of Industrial and Systems Engineering, Virginia Polytechnic Institute and State University, Blacksburg, VA, 24061, USA

    Subhash C. Sarin, Hanif D. Sherali & Liming Yao

Authors
  1. Subhash C. Sarin
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Hanif D. Sherali
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Liming Yao
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Subhash C. Sarin.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Sarin, S.C., Sherali, H.D. & Yao, L. New formulation for the high multiplicity asymmetric traveling salesman problem with application to the Chesapeake problem. Optim Lett 5, 259–272 (2011). https://doi.org/10.1007/s11590-010-0205-y

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11590-010-0205-y

Keywords

Search

Navigation