Preliminary Studies on a Variant of TSP for Servicing Printers and Copiers
AbstractWe 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.
Download InfoIf you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
Bibliographic InfoPaper provided by Department of Applied Mathematics, Università Ca' Foscari Venezia in its series Working Papers with number 205.
Length: 13 pages
Date of creation: Nov 2010
Date of revision:
Case Study; Traveling Salesman Problem.;
Find related papers by JEL classification:
- M37 - Business Administration and Business Economics; Marketing; Accounting - - Marketing and Advertising - - - Advertising
- M31 - Business Administration and Business Economics; Marketing; Accounting - - Marketing and Advertising - - - Marketing
- C61 - Mathematical and Quantitative Methods - - Mathematical Methods; Programming Models; Mathematical and Simulation Modeling - - - Optimization Techniques; Programming Models; Dynamic Analysis
This paper has been announced in the following NEP Reports:
- NEP-ALL-2010-11-20 (All new papers)
You can help add them by filling out this form.
reading list or among the top items on IDEAS.Access and download statisticsgeneral information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Marco LiCalzi).
If references are entirely missing, you can add them using this form.