Search Results - (( integer programming modified algorithm ) OR ( java application optimization algorithms ))

Refine Results
  1. 1

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

    Published 2018
    “…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

    Performance evaluation of real-time multiprocessor scheduling algorithms by Alhussian, H., Zakaria, N., Abdulkadir, S.J., Fageeri, S.O.

    Published 2016
    “…These results suggests that optimal algorithms may turn to be non-optimal when practically implemented, unlike USG which reveals far less scheduling overhead and hence could be practically implemented in real-world applications. …”
    Get full text
    Get full text
    Conference or Workshop Item
  4. 4

    Route Optimization System by Zulkifli, Abdul Hayy

    Published 2005
    “…After much research into the many algorithms available, and considering some, including Genetic Algorithm (GA), the author selected Dijkstra's Algorithm (DA). …”
    Get full text
    Get full text
    Final Year Project
  5. 5

    Solving the integrated inventory supply chain problems using meta-heuristic methods / Seyed Mohsen Mousavi by Seyed Mohsen , Mousavi

    Published 2018
    “…A Modified Particle Swarm Optimization (MPSO) algorithm, a Genetic Algorithm (GA), a modified fruit fly optimization algorithm (MFOA) and a simulated annealing (SA) algorithm were used to find the optimal solution. …”
    Get full text
    Get full text
    Get full text
    Thesis
  6. 6
  7. 7

    Development of a new approach for deterministic supply chain network design by Bidhandi, Hadi Mohammadi, Mohd. Yusuff, Rosnah, Megat Ahmad, Megat Mohamad Hamdan, Abu Bakar, Mohd Rizam

    Published 2008
    “…Consequently, this problem is a binary mixed integer linear programming problem. In this paper, a modified version of Benders’ decomposition is proposed to solve the model. …”
    Get full text
    Get full text
    Get full text
    Article
  8. 8
  9. 9

    Integrated supply chain planning under uncertainty using an improved stochastic approach by Mohammadi Bidhandi, Hadi, Mohd Yusuff, Rosnah

    Published 2011
    “…In the improved solution method, the sample average approximation technique is integrated with the accelerated Benders’ decomposition approach to improvement of the mixed integer linear programming solution phase. The surrogate constraints method will be utilized to acceleration of the decomposition algorithm. …”
    Get full text
    Get full text
    Get full text
    Article
  10. 10
  11. 11

    Discrete-event simulation for outpatient flow and emergency patient arrival in a haemodialysis unit by A., Sundar, N. A. A., Rahmin, C. Y., Chen, M. A., Nazihah

    Published 2023
    “…Discrete-event simulation is used to estimate the outpatients flow based on the mean arrival rate, ». A modified integer linear programming model is presented in this paper which highlighted on the patients arrival time, patients departure time and bed availability for emergency case. …”
    Get full text
    Get full text
    Get full text
    Article
  12. 12
  13. 13

    Computer Lab Timetabling Using Genetic Algorithm Case Study - Unit ICT by Abdullah, Amran

    Published 2006
    “…Genetic Algorithm is one of the most popular optimization solutions used in various applications such as scheduling. …”
    Get full text
    Get full text
    Thesis
  14. 14
  15. 15
  16. 16

    Solving a multi-period inventory routing problem with stochastic unstationary demand rates by Muhammad Khodri Harahap, Afif Zuhri

    Published 2022
    “…The computational results show that the algorithms that implement this modified formulation can achieve a better optimization result. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
  17. 17

    Examination timetabling using genetic algorithm case study: KUiTTHO by Mohd Salikon, Mohd Zaki

    Published 2005
    “…Genetic Algorithm (GA) is one of the most popular optimization solutions. …”
    Get full text
    Get full text
    Thesis
  18. 18

    Examination Timetabling Using Genetic Algorithm Case Study : KUiTTHO by Mohd. Zaki, Mohd. Salikon

    Published 2005
    “…Genetic Algorithm (GA) is one of the most popular optimization solutions. …”
    Get full text
    Get full text
    Get full text
    Thesis
  19. 19

    Improving Class Timetabling using Genetic Algorithm by Qutishat, Ahmed Mohammed Ali

    Published 2006
    “…We have targeted the research on class timetabling problem. Hence, Genetic Algorithm (GA) is used as one of the most popular optimization solutions. …”
    Get full text
    Get full text
    Get full text
    Thesis
  20. 20