TAILIEUCHUNG - A grasp +vnd algorithm for the multiple traveling repairmen problem with distance constraints

In our work, we propose a metaheuristic algorithm which is mainly based on the principles of Greedy Randomized Adaptive Search Procedure (GRASP) and Variable Neighborhood Descent (VND) to solve the problem. The GRASP is used to build an initial solution which is good enough in a construction phase. | Journal of Computer Science and Cybernetics, , (2017), 272–288 DOI A GRASP+VND ALGORITHM FOR THE MULTIPLE TRAVELING REPAIRMEN PROBLEM WITH DISTANCE CONSTRAINTS HA BANG BAN School of Information and Communication Technology, Hanoi University of Science and Technology; BangBH@ Abstract. Multiple Traveling Repairmen Problem (MTRP) is a class of NP-hard combinatorial optimization problems. In this paper, an other variant of MTRP, also known as Multiple Traveling Repairmen Problem with Distance Constraint (MTRPD), is introduced. In MTRPD problem, a fleet of vehicles serves a set of customers. Each vehicle which starts from the depot is not allowed to travel any distance longer than a limit and each customer must be visited exactly once. The goal is to find the order of customer visits of all vehicles that minimizes the sum of all vertices’ waiting time. To the best of our knowledge, the problem has not been studied much previously, even though it is a natural and practical extension of the Traveling Repairman Problem or Multiple Traveling Repairmen Problem case. In our work, we propose a metaheuristic algorithm which is mainly based on the principles of Greedy Randomized Adaptive Search Procedure (GRASP) and Variable Neighborhood Descent (VND) to solve the problem. The GRASP is used to build an initial solution which is good enough in a construction phase. In a cooperative way, the VND is employed to generate diverse neighborhoods in an improvement phase, therefore, it can help the search escape from local optimal. Extensive numerical experiments on 321 benchmark instances show that our algorithm can find the optimal solutions with up to 50 vertices in several instances. For larger instances, our algorithm obtains provably near-optimal solutions, even for large instances. Keywords. Multiple Traveling Repairmen Problem with Distance Constraints (MTRPD), GRASP, VND, metaheuristic. 1. INTRODUCTION The .

• Hệ điều hành
• Journal of Computer Science and Cybernetics
• Greedy Randomized Adaptive Search Procedure
• Multiple Traveling Repairmen Problem with Distance Constraints
• Variable Neighborhood Descent
• Traveling Repairman Problem
• Nonstandard finite difference schemes
• Solving a modified epidemiological model for computer viruses
• Nonstandard finite difference
• Computer virus propagation model
• Multi objective evolutionary algorithms
• Evolutionary algorithms and foundation
• development and open issues
• EC enables computer scientists
• Evolutionary algorithms designed
• Learning interaction measure
• Relevance feedback in image retrieval
• Multi feature query
• The fuzzy density values
• Quality of transmission aware routing in ad hoc networks
• Cross layer model combined
• The static agent
• Ad hoc networks
• QoT aware routing
• sattic agent
• Algorithm to build fuzzy decision tree for data classification problem
• Fuzziness intervals matching
• Fuzzy decision tree
• The fuzzy data mining problem
• Hedges algebras and fuzzy partition problem for qualitative attributes
• Construct the membership functions
• Fuzzy Association Rules
• Member ship functions
• Characterizations for several classes of alternative codes
• Several classes of alternative codes
• norm alternative code
• Left norm alternative code
• Two sided alternative code
• Left alternative code
• Strict alternative code
• Packet classification algorithm
• Multi way priority trie
• Significant number of researchers
• Both theoretically and experimentally proved
• Solving min max capacitated vehicle routing problem by local search
• Solving min max capacitated vehicle routing problem
• Solving min max capacitated
• Proposed algorithms compared
• Novel control approach for optimal power flow
• Hybrid wind photovoltaic diesel generation systems
• Diesel generation systems
• Analytical control model
• Mobile ad hoc network
• Valid route testing mechanism
• Using Network Simulator
• Random movement network topology
• Rough set theory
• Polynomial time complexity
• Algorithm finding object reducts
• Improved genetic algorithm
• Test data generation for simulink models
• Conventional genetic algorithm
• Generate test data for Simulink models
• Nonholonomic wheeled mobile robot
• Wheeled mobile robot
• Function neural network
• Unknown external disturbances
• Modeling the differential motion of a mobile manipulator
• Designing a new visual servoing
• Tracking a flying target
• Reinforcement learning algorithm
• Efficient navigation framework
• Autonomous mobile robots
• The mobile robots
• Interpolation based on semantic distance weighting
• Hedge algebra and its application
• Semantic distance weighting
• Bi linear interpolation
• Linguistic rule base system
• Transform the current Web
• Conceptual data model
• Ti meER model
• The temporal databases into OWL ontology
• The ER model into ontology
• Sliding mode control
• Sliding mode control for a planar parallel robot driven
• Electric motors in a task space
• The substructure method
• On the real world semantics interpretability
• Fuzzy rule based systems under fuzzy set approach
• Hedge algebra approach
• The RWS interpretability
• Alternating current electrical systems
• Integer quadratic programming
• Non linear knapsack problems arising
• Polynomial time approximation schemes
• Statistical implication rules
• Collaborative filtering recommender system
• Statistical implicative analysis
• The accuracy of recommender systems
• Picture fuzzy sets
• Picture fuzzy t norms
• Picture fuzzy t conorm
• De Morgan picture operator triple
• Taxonomic assignment for large scale metagenomic data
• High perfomance systems
• Large scale metagenomic data
• Achieve good performance