IDEAS home Printed from https://ideas.repec.org/p/vnm/wpaper/205.html
   My bibliography  Save this paper

Preliminary Studies on a Variant of TSP for Servicing Printers and Copiers

Author

Listed:
  • Daniela Favaretto

    (Dept. of Applied Mathematics, University Ca' Foscari of Venice)

  • Paola Pellegrini

    (Dept. of Applied Mathematics, University CaíFoscari of Venice)

Abstract

We analyze a case study and we model it as a variant of the Traveling Salesman Problem. It is characterized by multiple time windows, variable service duration, priority constraints, and appointments with customers. The definition of the feasible region differs from the classical one: a maximum duration is imposed to the tour, and some customers may be neglected. The number of customers to visit is fixed as the maximum number given all constraints: it is found by solving a further optimization problem. The objective function to minimize is the sum of the time required to serve this number of customers. We propose a mathematical formulation for this problem and we solve it on two real instances. We compare the solutions obtained with the ones implemented by the firm.

Suggested Citation

  • Daniela Favaretto & Paola Pellegrini, 2010. "Preliminary Studies on a Variant of TSP for Servicing Printers and Copiers," Working Papers 205, Department of Applied Mathematics, Università Ca' Foscari Venezia.
    • Handle: RePEc:vnm:wpaper:205
    as

    Download full text from publisher

    File URL: http://virgo.unive.it/wpideas/storage/2010wp205.pdf
    File Function: First version, 2010
    Download Restriction: no
    ---><---

    More about this item

    Keywords

    Case Study; Traveling Salesman Problem.;

    JEL classification:

    • M37 - Business Administration and Business Economics; Marketing; Accounting; Personnel Economics - - Marketing and Advertising - - - Advertising
    • M31 - Business Administration and Business Economics; Marketing; Accounting; Personnel Economics - - Marketing and Advertising - - - Marketing
    • C61 - Mathematical and Quantitative Methods - - Mathematical Methods; Programming Models; Mathematical and Simulation Modeling - - - Optimization Techniques; Programming Models; Dynamic Analysis

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:vnm:wpaper:205. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Daria Arkhipova (email available below). General contact details of provider: https://edirc.repec.org/data/dmvenit.html .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.