Minisum location of a travelling salesman on simple networks |
| |
| Institution: | 1. University Institute of Engineering, Chandigarh University, Chandigarh, India;2. Chair & Professor, Computer Science Department, and Director of Cybersecurity Center, University of Texas-Permian Basin, Odessa, TX 79762, USA, King Abdullah II School of Information Technology, University of Jordan, Amman 11942, Jordan and with School of Computer and Communication Engineering, University of Science and Technology Beijing, Beijing 100083, China, and Honorary Distinguished Professor, Amity University, India;3. School of Computer Science, University of Petroleum & Energy Studies, Dehradun, India;4. Star Academy, Yamunanagar, Haryana, India;5. College of Engineering, Al-Balqa’ Applied University, Al Salt, Jordan;6. Faculty of Engineering and Information Sciences, University of Wollongong in Dubai, Dubai Knowledge Park, Dubai, UAE;7. University of Sharjah, UAE;1. Industrial and Systems Engineering Department, Federal University of Santa Catarina, Campus UFSC, Florianópolis, SC, Brazil;2. Canada Research Chair in Integrated Logistics, Faculty of Administration Sciences, Université Laval, Québec, Canada |
| |
| Abstract: | In this paper, we study the travelling salesman location problem on simple networks. The problem is to find the optimal home location of the salesman (e.g., a repair unit) that in each working day, must visit all the customers that require service. The number of customers as well as their location can change from day to day. In simple networks, each link belongs to at most one cycle. The paper includes O(n) algorithms for several types of simple networks and thus, avoids the calculation of 2n − 1 probabilities for each possible tour that may occur (customers are located at n nodesof the network). |
| |
| Keywords: | |
| 本文献已被 ScienceDirect 等数据库收录！ |
|
