Khanra et al., 2016 - Google Patents

A hybrid heuristic algorithm for single and multi-objective imprecise traveling salesman problems

Khanra et al., 2016

Document ID
185925041937746842
Author
Khanra A
Maiti M
Maiti M
Publication year
Publication venue
Journal of Intelligent & Fuzzy Systems

External Links

Snippet

Abstract Normally, Travelling salesman problems (TSPs) are formulated with deterministic parameters and either total cost or time is minimized. In real life TSPs, the travel costs and times are not defined precisely and represented by fuzzy or rough data. Very often, in …
Continue reading at content.iospress.com (other versions)

Classifications

    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
    • G06F17/30—Information retrieval; Database structures therefor; File system structures therefor
    • G06F17/30286—Information retrieval; Database structures therefor; File system structures therefor in structured data stores
    • G06F17/30386—Retrieval requests
    • G06F17/30424—Query processing
    • G06F17/30533—Other types of queries
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06N—COMPUTER SYSTEMS BASED ON SPECIFIC COMPUTATIONAL MODELS
    • G06N5/00—Computer systems utilising knowledge based models
    • G06N5/02—Knowledge representation
    • G06N5/022—Knowledge engineering, knowledge acquisition
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
    • G06F17/30—Information retrieval; Database structures therefor; File system structures therefor
    • G06F17/30286—Information retrieval; Database structures therefor; File system structures therefor in structured data stores
    • G06F17/30312—Storage and indexing structures; Management thereof
    • G06F17/30321—Indexing structures
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06N—COMPUTER SYSTEMS BASED ON SPECIFIC COMPUTATIONAL MODELS
    • G06N5/00—Computer systems utilising knowledge based models
    • G06N5/04—Inference methods or devices
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06N—COMPUTER SYSTEMS BASED ON SPECIFIC COMPUTATIONAL MODELS
    • G06N99/00—Subject matter not provided for in other groups of this subclass
    • G06N99/005—Learning machines, i.e. computer in which a programme is changed according to experience gained by the machine itself during a complete run
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
    • G06F17/30—Information retrieval; Database structures therefor; File system structures therefor
    • G06F17/30943—Information retrieval; Database structures therefor; File system structures therefor details of database functions independent of the retrieved data type
    • G06F17/30946—Information retrieval; Database structures therefor; File system structures therefor details of database functions independent of the retrieved data type indexing structures
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06N—COMPUTER SYSTEMS BASED ON SPECIFIC COMPUTATIONAL MODELS
    • G06N3/00—Computer systems based on biological models
    • G06N3/12—Computer systems based on biological models using genetic models
    • G06N3/126—Genetic algorithms, i.e. information processing using digital simulations of the genetic system
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06N—COMPUTER SYSTEMS BASED ON SPECIFIC COMPUTATIONAL MODELS
    • G06N3/00—Computer systems based on biological models
    • G06N3/02—Computer systems based on biological models using neural network models
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06Q—DATA PROCESSING SYSTEMS OR METHODS, SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL, SUPERVISORY OR FORECASTING PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL, SUPERVISORY OR FORECASTING PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q10/00—Administration; Management
    • G06Q10/06—Resources, workflows, human or project management, e.g. organising, planning, scheduling or allocating time, human or machine resources; Enterprise planning; Organisational models
    • G06Q10/063—Operations research or analysis
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06N—COMPUTER SYSTEMS BASED ON SPECIFIC COMPUTATIONAL MODELS
    • G06N7/00—Computer systems based on specific mathematical models
    • G06N7/005—Probabilistic networks
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06Q—DATA PROCESSING SYSTEMS OR METHODS, SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL, SUPERVISORY OR FORECASTING PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL, SUPERVISORY OR FORECASTING PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q50/00—Systems or methods specially adapted for a specific business sector, e.g. utilities or tourism
    • G06Q50/01—Social networking
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F15/00—Digital computers in general; Data processing equipment in general
    • G06F15/18—Digital computers in general; Data processing equipment in general in which a programme is changed according to experience gained by the computer itself during a complete run; Learning machines
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F19/00—Digital computing or data processing equipment or methods, specially adapted for specific applications

Similar Documents

Publication Publication Date Title
Evans et al. Opinion formation on dynamic networks: identifying conditions for the emergence of partisan echo chambers
Carmona et al. Overview on evolutionary subgroup discovery: analysis of the suitability and potential of the search performed by evolutionary algorithms
Wang et al. An Improved Hybrid Algorithm Based on Biogeography/Complex and Metropolis for Many‐Objective Optimization
Cai et al. An ensemble bat algorithm for large-scale optimization
Tiwari et al. AMGA2: improving the performance of the archive-based micro-genetic algorithm for multi-objective optimization
Oda et al. Evaluation of WMN-GA for different mutation operators
Kurz On the inverse power index problem
Amelio et al. Correction for closeness: Adjusting normalized mutual information measure for clustering comparison
Ishfaq et al. Identifying the influential nodes in complex social networks using centrality-based approach
Khanra et al. A hybrid heuristic algorithm for single and multi-objective imprecise traveling salesman problems
Duan et al. Efficient heuristics for learning Bayesian network from labeled and unlabeled data
Rödder et al. Entropy based evaluation of net structures–deployed in social network analysis
Zhao et al. Ranking influential nodes in complex networks with information entropy method
Wang et al. Modeling on virtual network embedding using reinforcement learning
Gong et al. Directed network Laplacians and random graph models
Abu Doush et al. The effect of different stopping criteria on multi-objective optimization algorithms
Wang et al. Towards fair and personalized federated recommendation
Majbouri Yazdi et al. Prediction optimization of diffusion paths in social networks using integration of ant colony and densest subgraph algorithms
Fei Study on neutrosophic graph with application in wireless network
He et al. IIMOF: An iterative framework to settle influence maximization for opinion formation in social networks
Ammar et al. A study of uncertainty multi-objective nonlinear programming problems for rough intervals
Fu et al. An interactive preference-based evolutionary algorithm for multi-criteria satisficing optimization
Liu et al. Community opinion maximization in social networks
Xu et al. Ant colony optimization with three stages for independent test cost attribute reduction
Baños et al. A Pareto-based memetic algorithm for optimization of looped water distribution systems