The Allocated Maximal Backup Covering Tour Problem with Minimum Building Cost

Rashed Sahraeian, Ali Ebrahimi

Abstract


This study addresses the Allocated Maximal Backup Covering Tour Problem (AMBCTP) that is a generalization of the Covering Tour Problem (CTP). This problem is defined on an undirected graph , where W is a set of vertices that must be collectively covered by a vehicle. The AMBCTP consist of determining a minimum length vehicle route on a subset of V, subject to side constraints, such that every vertex of W is within a pre-specified distance from the route. Maximizing number of vertices of W set which are covered for second or more times is another objective in this problem. Moreover, allocation cost of the every vertex of W to one vertex of V which is belonging to the tour is minimized. Transmission vehicle from each city, in health care teams example that provided by Current and Schilling (1994) for this problem, requires to build a clinic in it, therefore we considered a fixed and variable cost (i.e. building cost) for visited cities, that must be minimized. Mathematical formulation of the AMBCTP, that is a multi-objective problem, is proposed. We used a powerful Multi-objective Decision Making (MODM) method for optimizing it. Finally a numerical example is provided to demonstrate the validity of the model.


Full Text: PDF DOI: 10.5539/jms.v2n1p151

Refbacks

  • There are currently no refbacks.


Creative Commons License
This work is licensed under a Creative Commons Attribution 3.0 License.

Journal of Management and Sustainability   ISSN 1925-4725 (Print)   ISSN 1925-4733 (Online)

 

Copyright © Canadian Center of Science and Education

 

To make sure that you can receive messages from us, please add the 'ccsenet.org' domain to your e-mail 'safe list'. If you do not receive e-mail in your 'inbox', check your 'bulk mail' or 'junk mail' folders.