Suchergebnisse - "complex combinatorial optimisation problem"
-
1
Capacitor placement in distribution systems for power loss reduction and voltage improvement: a new methodology
ISSN: 1751-8687, 1751-8695Veröffentlicht: The Institution of Engineering and Technology 04.11.2016Verö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
A simulated annealing algorithm for dynamic layout problem
ISSN: 0305-0548, 1873-765X, 0305-0548Veröffentlicht: New York Elsevier Ltd 01.12.2001Verö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
Designing vehicle routes for a mix of different request types, under time windows and loading constraints
ISSN: 0377-2217, 1872-6860Veröffentlicht: Amsterdam Elsevier B.V 01.09.2013Verö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
Finding optimal path of feeder routing problem in power distribution network by an efficient and new methodology
ISSN: 2050-7038, 2050-7038Veröffentlicht: Hoboken John Wiley & Sons, Inc 01.12.2021Veröffentlicht in International transactions on electrical energy systems (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
Late acceptance hill climbing algorithm for solving patient admission scheduling problem
ISSN: 0950-7051, 1872-7409Veröffentlicht: Amsterdam Elsevier B.V 01.04.2018Verö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
An Evolutionary Non-Linear Great Deluge Approach for Solving Course Timetabling Problems
ISSN: 1694-0814, 1694-0784Veröffentlicht: Mahebourg International Journal of Computer Science Issues (IJCSI) 01.07.2012Verö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
Optimal Supplier Selection and Order Allocation for Multi-Period Multi-Product Manufacturing Incorporating Customer Flexibility
ISSN: 1816-093XVeröffentlicht: 12.11.2011Verö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
A New Hybrid Approach for Unit Commitment Using Lagrangian Relaxation Combined with Evolutionary and Quadratic Programming
ISBN: 1424424860, 9781424424863ISSN: 2157-4839Veröffentlicht: IEEE 01.03.2009Veröffentlicht in 2009 Asia-Pacific Power and Energy Engineering Conference (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
A non-linear discrete stochastic optimization model for Advanced Access patient appointment scheduling
ISBN: 0549081631, 9780549081630Verö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
Improved Variable-Relationship Guided LNS for the Data Centre Machine Reassignment Problem
Veröffentlicht: IEEE 07.12.2023Veröffentlicht in 2023 31st Irish Conference on Artificial Intelligence and Cognitive Science (AICS) (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
Efficient Heuristics for Two-Dimensional Cutting and Packing Problems
ISBN: 1392771714, 9781392771716Verö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
On Heterogeneous Ising Machines
ISSN: 2331-8422Veröffentlicht: Ithaca Cornell University Library, arXiv.org 30.10.2024Veröffentlicht in arXiv.org (30.10.2024)“… Ising machines are effective solvers for complex combinatorial optimization problems …”
Volltext
Paper -
13
Cuckoo search algorithm for constraint satisfaction and optimization
Veröffentlicht: IEEE 01.09.2016Veröffentlicht in 2016 Second International Conference on Research in Computational Intelligence and Communication Networks (ICRCICN) (01.09.2016)“… ). CSP is a powerful paradigm which includes many complex combinatorial optimization problems like scheduling, planning or configuration problems …”
Volltext
Tagungsbericht

