tailieunhanh - Solving min max capacitated vehicle routing problem by local search

This paper investigates local search approach for solving the min-max capacitated vehicle routing problem with different neighborhood structures. We also propose a combined function instead of the objective function itself for controlling the local search. Experimental results on different datasets show the efficiency of our proposed algorithms compared to previous techniques. | Journal of Computer Science and Cybernetics, , (2017), 3–18 DOI SOLVING MIN-MAX CAPACITATED VEHICLE ROUTING PROBLEM BY LOCAL SEARCH NGUYEN VAN SON1,2 , PHAM QUANG DUNG1 , BUI QUOC TRUNG3 , NGUYEN THANH HOANG1 1 Ha Noi University of Science and Technology of Cryptography Techniques 3 Viettel Research and Development Institute 1,2 sonnv188@; dungpq@ 2 Academy Abstract. Vehicle routing is a class of combinatorial optimization problems in transportation and logistics. Min-max capacitated vehicle routing is a problem of this class in which the length of the longest route must be minimized. This paper investigates local search approach for solving the min-max capacitated vehicle routing problem with different neighborhood structures. We also propose a combined function instead of the objective function itself for controlling the local search. Experimental results on different datasets show the efficiency of our proposed algorithms compared to previous techniques. Keywords. Vehicle routing, local search, min-max vehicle routing, combinatorial optimization. 1. INTRODUCTION A large number of applications involve sets of clients that must be served by vehicles located at a common depot. Problems which optimize the selection of routes for the vehicles, are referred to as vehicle routing problem [27, 19]. Solving these problems is very hard and is still an active research topic which attracts the attention of many computer scientists due to their impact to the society and the economy. Many variants of vehicle routing applications have been studied in the literature, for example, Capacitated Vehicle Routing problem (CVRP) [32], Min-Max Vehicle Routing Problem (MMVRP) [1], Vehicle Routing Problem with Time Windows (VRPTW) [9], etc. We consider in this paper the Min-Max Capacitated Vehicle Routing Problem (MMCVRP). The goal of this problem is to ensure that all clients are served as soon as possible such .

• Hệ điều hành
• Journal of Computer Science and Cybernetics
• Solving min max capacitated vehicle routing problem by local search
• Solving min max capacitated vehicle routing problem
• Solving min max capacitated
• Proposed algorithms compared
• 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
• 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
• Greedy Randomized Adaptive Search Procedure
• Multiple Traveling Repairmen Problem with Distance Constraints
• Variable Neighborhood Descent
• Traveling Repairman Problem
• 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