• About
  • Policies
  • What is openaccess
  • Library
  • Contact
Advanced search
      View Item 
      •   BUIR Home
      • Scholarly Publications
      • Faculty of Engineering
      • Department of Industrial Engineering
      • View Item
      •   BUIR Home
      • Scholarly Publications
      • Faculty of Engineering
      • Department of Industrial Engineering
      • View Item
      JavaScript is disabled for your browser. Some features of this site may not work without it.

      Time constrained maximal covering salesman problem with weighted demands and partial coverage

      Thumbnail
      Embargo Lift Date: 2019-12-01
      View / Download
      1.1 Mb
      Author
      Ozbaygin, G.
      Yaman, H.
      Karasan, O. E.
      Date
      2016
      Source Title
      Computers and Operations Research
      Print ISSN
      0305-0548
      Publisher
      Elsevier Ltd
      Volume
      76
      Pages
      226 - 237
      Language
      English
      Type
      Article
      Item Usage Stats
      161
      views
      115
      downloads
      Abstract
      In a routing framework, it may not be viable to visit every single customer separately due to resource limitations or efficiency concerns. In such cases, utilizing the notion of coverage; i.e., satisfying the demand of multiple customers by visiting a single customer location, may be advantageous. With this motivation, we study the time constrained maximal covering salesman problem (TCMCSP) in which the aim is to find a tour visiting a subset of customers so that the amount of demand covered within a limited time is maximized. We provide flow and cut formulations and derive valid inequalities. Since the connectivity constraints and the proposed valid inequalities are exponential in the size of the problem, we devise different branch-and-cut schemes. Computational experiments performed on a set of problem instances demonstrate the effectiveness of the proposed valid inequalities in terms of strengthening the linear relaxation bounds as well as speeding up the solution procedure. Moreover, the results indicate the superiority of using a branch-and-cut methodology over a flow-based formulation. Finally, we discuss the relation between the problem parameters and the structure of optimal solutions based on the results of our experiments. © 2016 Elsevier Ltd
      Keywords
      Branch-and-cut
      Covering salesman
      Valid inequalities
      Sales
      Structural optimization
      Branch and cut
      Computational experiment
      Connectivity constraints
      Covering salesman
      Covering salesman problems
      Problem parameters
      Resource limitations
      Valid inequality
      Integer programming
      Permalink
      http://hdl.handle.net/11693/36857
      Published Version (Please cite this version)
      http://dx.doi.org/10.1016/j.cor.2016.06.019
      Collections
      • Department of Industrial Engineering 687
      Show full item record

      Browse

      All of BUIRCommunities & CollectionsTitlesAuthorsAdvisorsBy Issue DateKeywordsTypeDepartmentsThis CollectionTitlesAuthorsAdvisorsBy Issue DateKeywordsTypeDepartments

      My Account

      Login

      Statistics

      View Usage StatisticsView Google Analytics Statistics

      Bilkent University

      If you have trouble accessing this page and need to request an alternate format, contact the site administrator. Phone: (312) 290 1771
      © Bilkent University - Library IT

      Contact Us | Send Feedback | Off-Campus Access | Admin | Privacy