Suchergebnisse - "complex combinatorial optimisation problem"

  • Treffer 1 - 13 von 13
Treffer weiter einschränken
  1. 1

    Capacitor placement in distribution systems for power loss reduction and voltage improvement: a new methodology von Askarzadeh, Alireza

    ISSN: 1751-8687, 1751-8695
    Veröffentlicht: The Institution of Engineering and Technology 04.11.2016
    Veröffentlicht in IET generation, transmission & distribution (04.11.2016)
    “… However, finding optimal size and location of capacitors in distribution networks is a complex combinatorial optimisation problem …”
    Volltext
    Journal Article
  2. 2

    A simulated annealing algorithm for dynamic layout problem von Baykasoğlu, Adil, Gindy, Nabil N.Z.

    ISSN: 0305-0548, 1873-765X, 0305-0548
    Veröffentlicht: New York Elsevier Ltd 01.12.2001
    Veröffentlicht in Computers & operations research (01.12.2001)
    “… The problem was defined as a complex combinatorial optimisation problem. The efficiency of SA in solving combinatorial optimisation problems is very well known …”
    Volltext
    Journal Article
  3. 3

    Designing vehicle routes for a mix of different request types, under time windows and loading constraints von Zachariadis, Emmanouil E., Tarantilis, Christos D., Kiranoudis, Chris T.

    ISSN: 0377-2217, 1872-6860
    Veröffentlicht: Amsterdam Elsevier B.V 01.09.2013
    Veröffentlicht in European journal of operational research (01.09.2013)
    “… •New vehicle routing model with operational constraints.•Routes satisfy a blend of plain delivery and pick-up and delivery requests.•Feasible pallet packing …”
    Volltext
    Journal Article
  4. 4

    Finding optimal path of feeder routing problem in power distribution network by an efficient and new methodology von Ayazi, Sajjad, Askarzadeh, Alireza

    ISSN: 2050-7038, 2050-7038
    Veröffentlicht: Hoboken John Wiley & Sons, Inc 01.12.2021
    “… Optimal feeder routing is a complex combinatorial optimization problem, which needs a superior optimization technique to be effectively solved …”
    Volltext
    Journal Article
  5. 5

    Late acceptance hill climbing algorithm for solving patient admission scheduling problem von Bolaji, Asaju La’aro, Bamigbola, Akeem Femi, Shola, Peter Bamidele

    ISSN: 0950-7051, 1872-7409
    Veröffentlicht: Amsterdam Elsevier B.V 01.04.2018
    Veröffentlicht in Knowledge-based systems (01.04.2018)
    “… Patient admission scheduling is a complex combinatorial optimization problem which have been proven to belongs to class of NP-hard problem in almost all its variations …”
    Volltext
    Journal Article
  6. 6

    An Evolutionary Non-Linear Great Deluge Approach for Solving Course Timetabling Problems von Obit, Joe Henry, Ouelhadj, Djamila, Landa-Silva, Dario, Alfred, Rayner

    ISSN: 1694-0814, 1694-0784
    Veröffentlicht: Mahebourg International Journal of Computer Science Issues (IJCSI) 01.07.2012
    Veröffentlicht in International journal of computer science issues (01.07.2012)
    “… This approach might be seen as a variation of memetic algorithms. The popularity of evolutionary computation approaches has increased and become an important technique in solving complex combinatorial optimisation problems …”
    Volltext
    Journal Article
  7. 7

    Optimal Supplier Selection and Order Allocation for Multi-Period Multi-Product Manufacturing Incorporating Customer Flexibility von Mak, K L, Cui, L X, Su, W

    ISSN: 1816-093X
    Veröffentlicht: 12.11.2011
    Veröffentlicht in Engineering Letters (12.11.2011)
    “… The objective is to maximize the manufacturer's profit subject to the various operating constraints of the supply chain …”
    Volltext
    Journal Article
  8. 8

    A New Hybrid Approach for Unit Commitment Using Lagrangian Relaxation Combined with Evolutionary and Quadratic Programming von Bavafa, M., Monsef, H., Navidi, N.

    ISBN: 1424424860, 9781424424863
    ISSN: 2157-4839
    Veröffentlicht: IEEE 01.03.2009
    “… ) for short-term thermal unit commitment. Unit commitment is a complex combinatorial optimization problem which is difficult to be solved for large-scale power systems …”
    Volltext
    Tagungsbericht
  9. 9

    A non-linear discrete stochastic optimization model for Advanced Access patient appointment scheduling von Sundaram, Ramakrishnan

    ISBN: 0549081631, 9780549081630
    Veröffentlicht: ProQuest Dissertations & Theses 01.01.2007
    “… Access to healthcare is a major problem in which patients are deprived of receiving timely admission to healthcare. Poor access has resulted in significant but …”
    Volltext
    Dissertation
  10. 10

    Improved Variable-Relationship Guided LNS for the Data Centre Machine Reassignment Problem von Souza, Filipe, Grimes, Diarmuid, O'Sullivan, Barry

    Veröffentlicht: IEEE 07.12.2023
    “… Large Neighborhood Search (LNS) is a potent metaheuristic technique for addressing complex Combinatorial Optimization Problems by focusing in each iteration on smaller, more manageable subproblems …”
    Volltext
    Tagungsbericht
  11. 11

    Efficient Heuristics for Two-Dimensional Cutting and Packing Problems von Oliveira, Óscar António Maia de

    ISBN: 1392771714, 9781392771716
    Veröffentlicht: ProQuest Dissertations & Theses 01.01.2019
    “… Cutting and packing problems are complex combinatorial optimization problems that have gained a lot of attention from the scientific community …”
    Volltext
    Dissertation
  12. 12

    On Heterogeneous Ising Machines von Cılasun, Hüsrev, Kumar, Abhimanyu, Zeng, Ziqing, Prova, Nafisa Sadaf, Sapatnekar, Sachin S, Karpuzcu, Ulya R

    ISSN: 2331-8422
    Veröffentlicht: Ithaca Cornell University Library, arXiv.org 30.10.2024
    Veröffentlicht in arXiv.org (30.10.2024)
    “… Ising machines are effective solvers for complex combinatorial optimization problems …”
    Volltext
    Paper
  13. 13

    Cuckoo search algorithm for constraint satisfaction and optimization von Majumdar, Dipankar, Mallick, Subhasis

    Veröffentlicht: IEEE 01.09.2016
    “… ). CSP is a powerful paradigm which includes many complex combinatorial optimization problems like scheduling, planning or configuration problems …”
    Volltext
    Tagungsbericht