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

Simple item page
dc.citation.epage237en_US
dc.citation.spage226en_US
dc.citation.volumeNumber76en_US
dc.contributor.authorOzbaygin, G.en_US
dc.contributor.authorYaman, H.en_US
dc.contributor.authorKarasan, O. E.en_US
dc.date.accessioned2018-04-12T10:55:39Z
dc.date.available2018-04-12T10:55:39Z
dc.date.issued2016en_US
dc.departmentDepartment of Industrial Engineeringen_US
dc.description.abstractIn 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 Ltden_US
dc.embargo.release2019-12-01en_US
dc.identifier.doi10.1016/j.cor.2016.06.019en_US
dc.identifier.issn0305-0548
dc.identifier.urihttp://hdl.handle.net/11693/36857
dc.language.isoEnglishen_US
dc.publisherElsevier Ltden_US
dc.relation.isversionofhttp://dx.doi.org/10.1016/j.cor.2016.06.019en_US
dc.source.titleComputers and Operations Researchen_US
dc.subjectBranch-and-cuten_US
dc.subjectCovering salesmanen_US
dc.subjectValid inequalitiesen_US
dc.subjectSalesen_US
dc.subjectStructural optimizationen_US
dc.subjectBranch and cuten_US
dc.subjectComputational experimenten_US
dc.subjectConnectivity constraintsen_US
dc.subjectCovering salesmanen_US
dc.subjectCovering salesman problemsen_US
dc.subjectProblem parametersen_US
dc.subjectResource limitationsen_US
dc.subjectValid inequalityen_US
dc.subjectInteger programmingen_US
dc.titleTime constrained maximal covering salesman problem with weighted demands and partial coverageen_US
dc.typeArticleen_US
Files
Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
Time_constrained_maximal_covering_salesman_problem_with_weighted_demands_and_partial_coverage.pdf
Size:
1.09 MB
Format:
Adobe Portable Document Format
Description:
Full printable version
Download
Collections
Department of Industrial Engineering