Abstract
We study the maximal covering salesman problem with the average travelling cost constraints (MCSPATCC) where the objective is to find a subset of customers with their tour so that the number of covered demand points is maximised. This paper presents a mathematical model to select a profitable subset of demand points to be covered. We also propose an effective heuristic algorithm with three elimination methods to remove unprofitable demand points. The proposed algorithm is based on the genetic algorithm (GA) hybridised with different local search strategies to solve this problem. Parameters of the algorithm are analysed for calibration by the Taguchi method. Extensive computational experiments, on a set of standard problems, have indicated the effectiveness of our algorithm.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: International Journal of Mathematics in Operational Research
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
