Search Results - (( based application customization algorithm ) OR ( using optimization problems algorithm ))

Refine Results
  1. 1

    Modified ant colony optimization algorithms for deterministic and stochastic inventory routing problems / Lily Wong by Lily , Wong

    Published 2018
    “…The customers are allowed to be visited more than once in a given period and the demand for each product is deterministic and time varying. The problem is formulated as a mixed integer programming problem and is solved using CPLEX to obtain the lower and upper bound (the best integer solution) for each instance considered. …”
    Get full text
    Get full text
    Get full text
    Thesis
  2. 2
  3. 3

    Development of heuristic methods based on genetic algorithm (GA) for solving vehicle routing problem by Ismail, Zuhaimy, Nurhadi, Irhamah, Zainuddin, Zaitul Marlizawati

    Published 2008
    “…Based on the proposed heuristic method, we developed a program to optimize the routing problem using the Visual Studio C++ 6.0 programming language.…”
    Get full text
    Get full text
    Monograph
  4. 4

    A variant fisher and Jaikuamr algorithm to solve capacitated vehicle routing problem by Sultana, Tanzima, Akhand, Md Aminul Haque, Rahman, M.M. Hafizur

    Published 2017
    “…Route generation is a traveling sales man problem (TSP) and any TSP optimization method is useful for this purpose. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Proceeding Paper
  5. 5

    Mathematical models and optimization algorithms for low-carbon Location-Inventory-Routing Problem with uncertainty by Liu, Lihua

    Published 2024
    “…When compared to the Supply Chain Guru X (SCGX) software, the proposed algorithms offer higher practical applicability.…”
    Get full text
    Get full text
    Get full text
    Thesis
  6. 6

    Optimised crossover genetic algorithm for capacitated vehicle routing problem by Nazif, Habibeh, Lee, Lai Soon

    Published 2012
    “…This paper presents a genetic algorithm for solving capacitated vehicle routing problem, which is mainly characterised by using vehicles of the same capacity based at a central depot that will be optimally routed to supply customers with known demands. …”
    Get full text
    Get full text
    Article
  7. 7

    An Efficient Genetic Algorithm for Large Scale Vehicle Routing Problem Subject to Precedence Constraints by Noraini, Mohd Razali

    Published 2015
    “…The vehicle routing problem is a combinatorial optimization and integer programming problem seeking to service a number of customers with a fleet of vehicles. …”
    Get full text
    Get full text
    Get full text
    Article
  8. 8

    The application of queuing theory model using the DSW Algorithm and the L-R Method to optimize customer flow at Pizza Hut / Anis Natasha Mohamad Nizam, Nurfatihah Nadirah Noor Azla... by Mohamad Nizam, Anis Natasha, Noor Azlan, Nurfatihah Nadirah, Fazli, Nur Izzati Aliah

    Published 2022
    “…This study aims to compare the behaviors of a queuing system at an order counter using the Fuzzy Queuing Model, which are the Dong, Shah, and Wong (DSW) Algorithm and the Left-Right (L-R) Method. …”
    Get full text
    Get full text
    Student Project
  9. 9

    Improving explicit aspects extraction in sentiment analysis using optimized ruleset / Mohammad Ahmad Jomah Tubishat by Mohammad Ahmad, Jomah Tubishat

    Published 2019
    “…In addition, the improved WOA is developed by using Cauchy mutation and local search algorithm to solve its local optima problem and improve population diversity. …”
    Get full text
    Get full text
    Get full text
    Thesis
  10. 10

    Optimization Of Two-Dimensional Dual Beam Scanning System Using Genetic Algorithms by Koh, Johnny Siaw Paw

    Published 2008
    “…This thesis presents a new approach to optimize the performance of a dual beam optical scanning system in terms of its scanning combinations and speed, using Genetic Algorithm (GA). …”
    Get full text
    Get full text
    Thesis
  11. 11

    Dynamic economic dispatch in electricity market using particle swarm optimization algorithm / Nurain Masran by Masran, Nurain

    Published 2017
    “…This paper presents the application of Particle Swarm Optimization (PSO) algorithm to obtain a solution for Bid-Based Dynamic Economic Dispatch (BBDED) model problem to maximize the social profit in a competitive electricity market. …”
    Get full text
    Get full text
    Thesis
  12. 12

    Predicting Customer Buying Decisions for Online Shopping with Unbalanced Data Set by Yap, Chau Tean

    Published 2022
    “…The algorithms involved were K-Nearest Neighbor (KNN), Naïve Bayers, J48, Support Vector Machine (SVM), Sequential Minimal Optimization (SMO) and Multilayer Perceptron (MLP). …”
    Get full text
    Get full text
    Final Year Project / Dissertation / Thesis
  13. 13
  14. 14

    Honey bee based trust management system for cloud computing by Firdhous, Mohamed, Ghazali, Osman, Hassan, Suhaidi, Harun, Nor Ziadah, Abas, Azizi

    Published 2011
    “…In this paper, the authors propose the concept that honey bee algorithm which has been developed to solve complex optimization problems can be successfully used to address this issue.The authors have taken a closer look at the optimization problems that had been solved using the honey bee algorithm and the similarity between these problems and the cloud computing environment.Thus concluding that the honey bee algorithm could be successfully used to solve the trust management issue in cloud computing.…”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
  15. 15

    A genetic algorithm for two-dimensional bin packing with due dates by Bennell, Julia A., Lee, Lai Soon, Potts, Chris N.

    Published 2013
    “…We propose a genetic algorithm for searching the solution space, which uses a new placement heuristic for decoding the gene based on the best fit heuristic designed for the strip packing problems. …”
    Get full text
    Get full text
    Article
  16. 16

    Machine learning based route optimization for the travelling salesman problem with pickup and delivery by Ong, Zhi Ying

    Published 2023
    “…The goal of this project is to deliver an optimal route for pickup and delivery using Reinforcement Learning (RL) and Genetic Algorithm (GA). 16 locations in Klang Valley are chosen randomly and later ETAs between them are retrieved for testing purpose. …”
    Get full text
    Get full text
    Final Year Project / Dissertation / Thesis
  17. 17

    Manufacturing process planning optimisation in reconfigurable multiple parts flow lines by Ismail, Napsiah, Musharavati, Farayi, Hamouda, Abdel Magid Salem, Ramli, Abdul Rahman

    Published 2008
    “…Design/methodology/approach: The genetic algorithm methodology implements a genetic algorithm that is augmented by application specific heuristics in order to guide the search for an optimal solution. …”
    Get full text
    Get full text
    Get full text
    Article
  18. 18

    Stock indicator scanner customization tool using deep reinforcement learning by Cheong, Desmond YongHong

    Published 2022
    “…This project will deliver a web application with dynamic stock prediction model based on deep reinforcement learning or more particularly, Deep Q-Network (DQN) algorithm which enable input customization. …”
    Get full text
    Get full text
    Final Year Project / Dissertation / Thesis
  19. 19

    Design, development and performance optimization of a new artificial intelligent controlled multiple-beam optical scanning module by Koh, Johnny Siaw Paw, Aris, Ishak, Ramachandaramurthy, Vigna Kumaran, Bashi, Sinan Mahmod, Marhaban, Mohammad Hamiruce

    Published 2006
    “…This research presents a new approach to optimise the performance of a multiple-beam optical scanning system in terms of its marking combinations and speed, using Genetic Algorithm (GA). The problem has been decomposed into two sub problems; task segregation, where the marking tasks need to be segregated and assigned for each scanner head and path planning where the best combinatorial paths for each scanner are determined in order to minimise the total motion of marking time. …”
    Get full text
    Get full text
    Get full text
    Article
  20. 20