Skip to main content
SpringerLink
Log in

Mixed integer formulations for the multiple minimum latency problem

  • Original Paper
  • Published:
Operational Research Aims and scope Submit manuscript

Abstract

In this paper we propose five mathematical formulations for the multiple minimum latency problem. The first three mathematical models are straight derived from classical formulations and from a flow-based formulation to the multiple travelling salesman problem. The last two are obtained as generalizations of time-dependent formulations to the minimum latency problem. We carry out an extensive computational experimentation to evaluate the performance of the proposed models using routing and scheduling instances. These experiments evidence that the time-dependent formulations show a much better performance than the other formulations, regarding to the size of instances that can be solved and the elapsed computational time to reach the optimal solutions. The obtained results suggest to consider the development of time-dependent formulations for other problems that consider the latency as objective function.

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.

Institutional subscriptions

Fig. 1

Similar content being viewed by others

References

  • Abeledo H, Fukasawa R, Pessoa AA, Uchoa E (2013) The time dependent traveling salesman problem: polyhedra and algorithm. Math Program Comput 5(1):27–55

    Article  Google Scholar 

  • Angel-Bello F, Alvarez A, García I (2013a) Two improved formulations for the minimum latency problem. Appl Math Model 37:2257–2266

    Article  Google Scholar 

  • Angel-Bello F, Martínez-Salazar I, Alvarez A (2013b) Minimizing waiting times in a route design problem with multiple use of a single vehicle. Electron Notes Discrete Math 41:269–276

    Article  Google Scholar 

  • Araque J, Kudva G, Morin T, Pekny J (1994) A branch-and-cut algorithm for vehicle routing problems. Ann Oper Res 50(1):37–59

    Article  Google Scholar 

  • Aras N, Yurdakul A (2016) A new multi-objective mathematical model for the high-level synthesis of integrated circuits. Appl Math Model 40(3):2274–2290

    Article  Google Scholar 

  • Augerat P, Belenguer JM, Benavent E, Corbern A, Naddef D, Rinaldi G (1995) Computational results with a branch and cut code for the capacitated vehicle routing problem. Tech. rep, IMAG

  • Ausiello G, Leonardi S, Marchetti-Spaccamela A (2000) On salesmen, repairmen, spiders, and other traveling agents. In: Proceedings of the 4th Italian conference on algorithms and complexity. Springer, CIAC ’00, pp 1–16

  • Bektas T (2006) The multiple traveling salesman problem: an overview of formulations and solution procedures. Omega 34(3):209–219

    Article  Google Scholar 

  • Bettayeb B, Kacem I, Adjallah KH (2008) An improved branch-and-bound algorithm to minimize the weighted flowtime on identical parallel machines with family setup times. J Syst Sci Syst Eng 17(4):446–459

    Article  Google Scholar 

  • Blum A, Chalasani P, Coppersmith D, Pulleyblank B, Raghavan P, Sudan M (1994) The minimum latency problem. In: Proceedings of the twenty-sixth annual ACM symposium on theory of computing, STOC ’94, pp 163–171

  • Christofides N, Eilon S (1969) An algorithm for the vehicle dispatching problems. Oper Res Q 20:309–318

    Article  Google Scholar 

  • Christofides N, Mingozzi A, Toth P (1981) Exact algorithms for the vehicle routing problem, based on spanning tree and shortest path relaxations. Math Program 20:255–282

    Article  Google Scholar 

  • Conway R, Maxwell W, Miller L (1967) Theory of scheduling. Addison-Wesley, Reading

  • Ezzine I, Elloumi S (2012) Polynomial formulation and heuristic based approach for the k-travelling repairman problem. Int J Math Oper Res 4(5):503–514

    Article  Google Scholar 

  • Fackcharoenphol J, Harrelson C, Rao S (2003) The k-traveling repairman problem. In: Proceedings of 14th symposium on discrete algorithms (SODA), pp 655–644

  • Fischetti M, Laporte G, Martello S (1993) The delivery man problem and cumulative matroids. Oper Res 41(6):1055–1064

    Article  Google Scholar 

  • Gacias B, Artigues C, Lopez P (2010) Parallel machine scheduling with precedence constraints and setup times. Comput Oper Res 37(12):2141–2151

    Article  Google Scholar 

  • Gavish B, Graves SC (1978) The travelling salesman problem and related problems. Working Paper, Operations Research Center, Massachusetts Institute of Technology

  • Godinho MT, Gouveia L, Magnanti TL (2008) Combined route capacity and route length models for unit demand vehicle routing problems. Discrete Optim 5(2):350–372

    Article  Google Scholar 

  • Godinho MT, Gouveia L, Magnanti TL, Pesneau P, Pires J (2009) On the unit demand vehicle routing problem: flow based inequalities implied by a time-dependent formulation. In: Proceedings of international network optimization conference (INOC)

  • Goemans M, Kleinberg J (1998) An improved approximation ratio for the minimum latency problem. Math Program 82(1):111–124

    Google Scholar 

  • Gouveia L, Voß S (1995) A classification of formulations for the (time-dependent) traveling salesman problem. Eur J Oper Res 83(1):69–82

    Article  Google Scholar 

  • Gouveia L, Riera-Ledesma J, Salazar-Gonzlez JJ (2013) Reverse multistar inequalities and vehicle routing problems with a lower bound on the number of customers per route. Networks 61(4):309–321

    Article  Google Scholar 

  • Luo Z, Qin H, Lim A (2014) Branch-and-price-and-cut for the multiple traveling repairman problem with distance constraints. Eur J Oper Res 234(1):49–60

    Article  Google Scholar 

  • Méndez-Díaz I, Zabala P, Lucena A (2008) A new formulation for the traveling deliveryman problem. Discrete Appl Math 156(17):3223–3237

    Article  Google Scholar 

  • Miller C, Tucker A, Zemlin R (1960) Integer programming formulation of traveling salesman problems. J Assoc Comput Mach 7(4):326–329

    Article  Google Scholar 

  • Mladenovic N, Uroševic D, Hanafi S (2012) Variable neighborhood search for the travelling deliveryman problem. 4OR Q J Oper Res 11:57–73

    Article  Google Scholar 

  • Nessah R, Chu C, Yalaoui F (2007) An exact method for pmsds, risum ci problem. Comput Oper Res 34(9):2840–2848

    Article  Google Scholar 

  • Ngueveu SU, Prins C, Wolfler Calvo R (2010) An effective memetic algorithm for the cumulative capacitated vehicle routing problem. Comput Oper Res 37(11):1877–1885

    Article  Google Scholar 

  • Nucamendi S, Cardona-Valdes Y, Angel-Bello F (2015) Minimizing customers’ waiting time in a vehicle routing problem with unit demands. J Comput Syst Sci Int 54(6):866–881

    Article  Google Scholar 

  • Nucamendi-Guillén S, Martínez-Salazar I, Angel-Bello F, Moreno-Vega MJ (2016) A mixed integer formulation and an efficient metaheuristic procedure for the k-travelling repairmen problem. J Oper Res Soc. doi:10.1057/jors.2015.113

    Google Scholar 

  • Picard JC, Queyranne M (1978) The time-dependent traveling salesman problem and its application to the tardiness problem in one-machine scheduling. Oper Res 26(1):86–110

    Article  Google Scholar 

  • Reinelt G (1991) TSPLIB—a traveling salesman problem library. ORSA J Comput 3:376–384

    Article  Google Scholar 

  • Ruiz R, Andres-Romano C (2011) Scheduling unrelated parallel machines with resource-assignable sequence-dependent setup times. Int J Adv Manuf Technol 57(5):777–794

    Article  Google Scholar 

  • Saharidis GKD, Dimitropoulos C, Skordilis E (2014) Minimizing waiting times at transitional nodes for public bus transportation in greece. Oper Res Int J 14(3):341–359. doi:10.1007/s12351-013-0139-0

    Article  Google Scholar 

  • Salehipour A, Sörensen K, Goos P, Bräysy O (2011) An efficient GRASP + VND and GRASP + VNS metaheuristics for the traveling repairman problem. 4OR Q J Oper Res 9(2):189–209

    Article  Google Scholar 

  • Sarbazi-Azad H (2003) A mathematical model of deterministic wormhole routing in hypercube multicomputers using virtual channels. Appl Math Model 27(12):943–953

    Article  Google Scholar 

  • Silva MM, Subramanian A, Vidal T, Ochi LS (2012) A simple and effective metaheuristic for the minimum latency problem. Eur J Oper Res 221(3):513–520

    Article  Google Scholar 

  • Simchi-Levi D, Berman O (1991) Minimizing the total flow time of n jobs on a network. IIE Trans 23(3):236–244

    Article  Google Scholar 

  • Tavakkoli-Moghaddam R, Taheri F, Bazzazi M (2008) Multi-objective unrelated parallel machines scheduling with sequence-dependent setup times and precedence constraints. Int J Eng Trans A Basics ACM Trans Algorithms 21(3):269–278

    Google Scholar 

  • Tsitsiklis JN (1992) Special cases of traveling salesman and repairman problems with time windows. Networks 22:263–282

    Article  Google Scholar 

  • Vallada E, Ruiz R (2011) A genetic algorithm for the unrelated parallel machine scheduling problem with sequence dependent setup times. Eur J Oper Res 211(3):612–622

    Article  Google Scholar 

Download references

Acknowledgements

This work has been partially supported by Tecnológico de Monterrey-Research Group in Industrial Engineering and Numerical Methods 0822B01006. This grant is gratefully acknowledged.

Author information

Authors and Affiliations

  1. Tecnológico de Monterrey, School of Engineering and Science, Ave. Eugenio Garza Sada 2501, CP 64849, Monterrey, Nuevo León, Mexico

    F. Angel-Bello

  2. Research Centre in Applied Mathematics, Universidad Autónoma de Coahuila, Unidad Camporredondo, CP 25280, Saltillo, Coahuila, Mexico

    Y. Cardona-Valdés

  3. Graduated Program in Systems Engineering, Universidad Autónoma de Nuevo León, Av. Universidad s/n, CP 66451, San Nicolás de los Garza, Nuevo León, Mexico

    A. Álvarez

Authors
  1. F. Angel-Bello
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Y. Cardona-Valdés
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. A. Álvarez
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to F. Angel-Bello.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Angel-Bello, F., Cardona-Valdés, Y. & Álvarez, A. Mixed integer formulations for the multiple minimum latency problem. Oper Res Int J 19, 369–398 (2019). https://doi.org/10.1007/s12351-017-0299-4

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s12351-017-0299-4

Keywords

Search

Navigation