[go: up one dir, main page]

Ashouri et al., 2017 - Google Patents

A Combination of Meta-heuristic and Heuristic Algorithms for the VRP, OVRP and VRP with Simultaneous Pickup and Delivery

Ashouri et al., 2017

View PDF
Document ID
13596704566481117185
Author
Ashouri M
Yousefikhoshbakht M
Publication year
Publication venue
BRAIN. Broad Research in Artificial Intelligence and Neuroscience

External Links

Snippet

Vehicle routing problem (VRP) is a Nondeterministic Polynomial Hard combinatorial optimization problem to serve the consumers from central depots and returned back to the originated depots with given vehicles. Furthermore, two of the most important extensions of …
Continue reading at edusoft.ro (PDF) (other versions)

Classifications

    • 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
    • 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
    • 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/04—Forecasting or optimisation, e.g. linear programming, "travelling salesman problem" or "cutting stock problem"
    • 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/04—Inference methods or devices
    • 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
    • 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
    • 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
    • G06Q30/00—Commerce, e.g. shopping or e-commerce
    • G06Q30/02—Marketing, e.g. market research and analysis, surveying, promotions, advertising, buyer profiling, customer management or rewards; Price estimation or determination
    • G06Q30/0202—Market predictions or demand forecasting
    • 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/50—Computer-aided design

Similar Documents

Publication Publication Date Title
Wang et al. Deep reinforcement learning for solving vehicle routing problems with backhauls
Ashouri et al. A Combination of Meta-heuristic and Heuristic Algorithms for the VRP, OVRP and VRP with Simultaneous Pickup and Delivery
Chiang et al. Simulated annealing metaheuristics for the vehicle routing problem with time windows
Bräysy et al. Evolutionary algorithms for the vehicle routing problem with time windows
Basu et al. Metaheuristic applications on discrete facility location problems: a survey
Lau et al. A fuzzy guided multi-objective evolutionary algorithm model for solving transportation problem
Escobar et al. A two-phase hybrid heuristic algorithm for the capacitated location-routing problem
Narasimha et al. An ant colony optimization technique for solving min–max multi-depot vehicle routing problem
Hien et al. A greedy search based evolutionary algorithm for electric vehicle routing problem
Nalepa et al. Co-operation in the parallel memetic algorithm
Sayyah et al. Solving the vehicle routing problem with simultaneous pickup and delivery by an effective ant colony optimization
Mulloorakam et al. Combined objective optimization for vehicle routing using genetic algorithm
Islam et al. Chemical reaction optimization: survey on variants
Yousefikhoshbakht et al. A mixed integer programming formulation for the heterogeneous fixed fleet open vehicle routing problem
Yousefikhoshbakht et al. AN EFFECTIVE RANK BASED ANT SYSTEM ALGORITHM FOR SOLVING THE BALANCED VEHICLE ROUTING PROBLEM.
Balaprakash et al. Estimation-based metaheuristics for the single vehicle routing problem with stochastic demands and customers
Ghaziri et al. Self-organizing feature maps for the vehicle routing problem with backhauls
Shamshirband et al. OVRP_ICA: an imperialist-based optimization algorithm for the open vehicle routing problem
Niazy et al. A hybrid chicken swarm optimization with tabu search algorithm for solving capacitated vehicle routing problem
Niazy et al. Solving capacitated vehicle routing problem using chicken swarm optimization with genetic algorithm
Sakhri et al. A memetic algorithm for the inventory routing problem
Tan et al. A multiobjective evolutionary algorithm for solving vehicle routing problem with time windows
Liu et al. Dynamic immune cooperative scheduling of agricultural machineries
Kuyu et al. A hybrid approach of ALNS with alternative initialization and acceptance mechanisms for capacitated vehicle routing problems
Comert et al. EFFECTIVE CLUSTER-FIRST ROUTE-SECOND APPROACHES USING METAHEURISTIC ALGORITHMS FOR THE CAPACITATED VEHICLE ROUTING PROBLEM.