• About
  • Policies
  • What is open access
  • 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.

      Traveling repairmen problem: A biogeography-based optimization

      Thumbnail
      View / Download
      472.5 Kb
      Author(s)
      Öder Uzun, G.
      Dengiz, B.
      Kara, İ.
      Karasan, Oya Ekin
      Editor
      Xu, Jiuping
      Altıparmak, Fulya
      Hassan, Mohamed Hag Ali
      Márquez, Fausto Pedro García
      Hajiyev, Asaf
      Date
      2022-07-14
      Source Title
      Proceedings of the sixteenth international conference on management science and engineering management
      Publisher
      Springer Cham
      Volume
      1
      Pages
      506 - 515
      Language
      English
      Type
      Conference Paper
      Item Usage Stats
      4
      views
      7
      downloads
      Series
      Lecture Notes on Data Engineering and Communications Technologies;
      Abstract
      Traveling Repairman Problem (TRP), which is also known by names cumulative traveling salesman problem, the deliveryman prob lem and the minimum latency problem, is a special variant of Traveling Salesman Problem (TSP). In contrast to the minimization of completion time objective of TSP, the desired objective of TRP is to minimize the cumulative latency (waiting time or delay time) of all customers. In this paper, a generalized version of TRP with multi depots and time windows, namely Multi Depot Traveling Repairman Problem with Time Windows (MDTRPTW) is considered. A group of homogeneous repairmen initi ate and finish their visit tours at multiple depots. Each customer must be visited exactly by one repairman within their provided earliest end latest times. Being a challenging Nondeterministic Polynomial-hard (NP hard) optimization problem, exact solution approaches are not expected to scale to realistic dimensions of MDTRPTW. Thus, we propose a biogeography-based optimization algorithm (BBOA) as a metaheuristic approach to solve large size MDTRPTW problems. The proposed meta heuristic is analyzed in terms of solution quality, coefficient of variation as well as computation time by solving some test problems adapted from the related literature. The efficacy of the proposed solution methodology is demonstrated by solving instances with 288 customers within seconds.
      Keywords
      Traveling salesman problem
      Heuristic algorithms
      Logistics problems
      Routing
      Permalink
      http://hdl.handle.net/11693/111338
      Published Version (Please cite this version)
      https://doi.org/10.1007/978-3-031-10388-9_37
      Collections
      • Department of Industrial Engineering 758
      Show full item record

      Browse

      All of BUIRCommunities & CollectionsTitlesAuthorsAdvisorsBy Issue DateKeywordsTypeDepartmentsCoursesThis CollectionTitlesAuthorsAdvisorsBy Issue DateKeywordsTypeDepartmentsCourses

      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 2976
      © Bilkent University - Library IT

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