作者: FRET 時(shí)間: 2025-3-21 20:43
Conference proceedings 2024–7, 2024...The 36 full papers presented together with 34 short papers were carefully reviewed and selected from 127 submissions. The conference focuses on artificial intelligence, combinatorial optimization, computer science, graph theory, evolutionary algorithms, genetic algorithms, simulated annealing, optimization, optimization problems..作者: 皺痕 時(shí)間: 2025-3-22 01:51 作者: 帶傷害 時(shí)間: 2025-3-22 06:09
Metaheuristics978-3-031-62912-9Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: 不利 時(shí)間: 2025-3-22 10:34
https://doi.org/10.1007/978-3-031-62912-9artificial intelligence; combinatorial optimization; computer science; graph theory; evolutionary algori作者: entice 時(shí)間: 2025-3-22 16:30
Lecture Notes in Computer Sciencehttp://image.papertrans.cn/m/image/631357.jpg作者: Foment 時(shí)間: 2025-3-22 21:07 作者: collagen 時(shí)間: 2025-3-22 22:24 作者: 有斑點(diǎn) 時(shí)間: 2025-3-23 04:58 作者: insightful 時(shí)間: 2025-3-23 08:06
Miguel Reula,Consuelo Parre?o-Torres,Anna Martínez-Gavara,Rafael Martí作者: CARK 時(shí)間: 2025-3-23 13:46
Adaptive Ant Colony Optimization Using Node Clustering with?Simulated Annealingy, finding a good solution becomes increasingly difficult as the search progresses. Therefore, we implement the simulated annealing?(SA) method to expand the solution search space and to escape from the local optimum solution. Numerical experiments demonstrate that the proposed method outperforms th作者: Strength 時(shí)間: 2025-3-23 16:59
SIRO: A Deep Learning-Based Next-Generation Optimizer for Solving Global Optimization Problemsits competitors. Moreso, it delivers high-quality solutions while utilizing fewer control parameters. The incorporation of a learning process in SIRO leads to superior precision and computational efficiency compared to other optimization approaches in the existing literature.作者: 防止 時(shí)間: 2025-3-23 18:02 作者: pantomime 時(shí)間: 2025-3-24 00:52
A Memetic Algorithm for?Large-Scale Real-World Vehicle Routing Problems with?Simultaneous Pickup andt. MA-BCRCD finds new best known solutions for all 20 instances. It also performs better on average for all instances in comparison to the performance of MATE. The results and analysis provided in this study suggest that further improvements on this problem set are possible both in terms of solution作者: ESO 時(shí)間: 2025-3-24 05:11
Iterative Heuristic over?Periods for?the?Inventory Routing Problemds that has already been considered at an earlier iteration, thus accelerating the resolution. Results shown that our approach is competitive in terms of solution quality and execution time and can provide good solutions for the set of instances considered.作者: Manifest 時(shí)間: 2025-3-24 09:21
uf andere Branchen übertragen werden. Wir werden diese Methodiken zukünftig in unserem Fachbereich nutzen, um neue Wege auszuprobieren und den Horizont zu erweitern.“.Dr. J?rg H?ppner, Leiter Konzern-Markenstrat作者: 身體萌芽 時(shí)間: 2025-3-24 11:04
He Zheng,Jin-Kao Haouf andere Branchen übertragen werden. Wir werden diese Methodiken zukünftig in unserem Fachbereich nutzen, um neue Wege auszuprobieren und den Horizont zu erweitern.“.Dr. J?rg H?ppner, Leiter Konzern-Markenstrat作者: Affable 時(shí)間: 2025-3-24 15:09 作者: Heterodoxy 時(shí)間: 2025-3-24 21:49 作者: OWL 時(shí)間: 2025-3-25 01:01 作者: 國(guó)家明智 時(shí)間: 2025-3-25 04:02
Takafumi MatsuuraGlobalisierung pr?sentiert und ausgewertet. Die Autoren sind Praktiker aus namhaften Unternehmen, Verb?nden, Bildungsinstitutionen und Interessenverb?nden sowie renommierte Wissenschaftler..978-3-8349-3243-3978-3-8349-7158-6作者: 陳舊 時(shí)間: 2025-3-25 11:10 作者: 極力證明 時(shí)間: 2025-3-25 14:46
sversorgung gewonnen werden sollen, auf Augenh?he verkaufen zu k?nnen. Das Buch ist didaktisch sehr gut aufgebaut, lebt von realen Erkenntnissen und Erlebnissen, reizt den Leser zur Erarbeitung eigener Variationen der Themen, hilft mit Checklisten und fasst die Kernb978-3-8349-9199-7作者: exquisite 時(shí)間: 2025-3-25 19:37
itativen Charakter gekennzeichnet. Der Einsatz der Beobachtungsverfahren wurde hierbei gepr?gt durch ein eher exploratives, unstrukturiertes Vorgehen im natürlichen Setting. Daneben nahmen Beobachtungsverfahren auch im Behaviorismus eine zentrale Stelle ein. Die Beobachtung als Forschungsmethode ist作者: NEG 時(shí)間: 2025-3-25 23:24
Jean Philippe Gayon,Philippe Lacomme,Amine Oussamaizin, was sie treibt und was unverzichtbar ist für die glückliche Entwicklung regionaler und globaler Gesellschaftsneuordnungen. Wider den vorherrschenden Wirtschafts-, Markt-, Medien- und Politikdruck z?hlt und bleibt das, was beim Menschen fraglos als dessen ureigener Gesundheitserhalt, gewisserma作者: insolence 時(shí)間: 2025-3-26 01:42 作者: 糾纏,纏繞 時(shí)間: 2025-3-26 06:50 作者: 上釉彩 時(shí)間: 2025-3-26 08:42
unterstützen. Andere L?nder folgten mit zeitlicher Verz?gerung zum Ende des vorherigen Jahrhunderts den angloamerikanischen Entwicklungen und schenkten dem Qualit?tsmanagement im Gesundheitswesen verst?rkt Aufmerksamkeit. Seither sind zahlreiche Instrumente entwickelt worden, die im Rahmen des Qual作者: Intentional 時(shí)間: 2025-3-26 12:59
Katyanne Farias,Philippe Lacomme,Diego Perdig?o Martinorof. Dr. Rainer Lasch ist Inhaber des Lehrstuhls für BWL, insbesondere Logistik, an der Technischen Universit?t Dresden. Dipl.-Wirt.-Ing. Gregor Schulte war Mitarbeiter am Lehrstuhl für BWL, insbesondere Logistik, an der Technischen Universit?t Dresden..978-3-8349-9111-9作者: Lethargic 時(shí)間: 2025-3-26 20:42 作者: 染色體 時(shí)間: 2025-3-27 00:00
A Simulated Annealing Algorithm to?Learn an?RMP Preference Modeln by the DM. Here, we use Simulated Annealing (SA) to learn the parameters of the Ranking based on Multiple Reference Profiles (RMP) model and its simpler variant SRMP. Extensive experiments demonstrate that our proposal outperforms existing methods in terms of both calculation time and accuracy.作者: FICE 時(shí)間: 2025-3-27 04:01 作者: promote 時(shí)間: 2025-3-27 06:09
0302-9743 nce focuses on artificial intelligence, combinatorial optimization, computer science, graph theory, evolutionary algorithms, genetic algorithms, simulated annealing, optimization, optimization problems..978-3-031-62911-2978-3-031-62912-9Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: 最有利 時(shí)間: 2025-3-27 12:23 作者: Omniscient 時(shí)間: 2025-3-27 14:57
0302-9743 ing June 4–7, 2024...The 36 full papers presented together with 34 short papers were carefully reviewed and selected from 127 submissions. The conference focuses on artificial intelligence, combinatorial optimization, computer science, graph theory, evolutionary algorithms, genetic algorithms, simul作者: tackle 時(shí)間: 2025-3-27 21:06
Breakout Local Search for?Heaviest Subgraph Problemry to obtain the most appropriate degree of diversification. Computational experiments are performed on a number of large random graphs. The experimental evaluations show that the results obtained by BLS are comparable to, and in most cases superior to, those of the current state-of-the-art approaches.作者: 階層 時(shí)間: 2025-3-28 01:59
A Biased Random Key Genetic Algorithm for?Solving the?,-Neighbor p-Center Problem and the goal is to minimize this maximum distance. The proposed algorithm is compared with the best method found in the literature. The performance of the algorithm is evaluated over a large set of instances showing the robustness of the proposal.作者: Flu表流動(dòng) 時(shí)間: 2025-3-28 02:13 作者: 鍍金 時(shí)間: 2025-3-28 06:49
A Continuous-GRASP Random-Key Optimizertested on five NP-hard problems: Traveling salesman problem (TSP); Tree hub location problem in graphs (THLP); Steiner triple set covering problem (STCP); Node capacitated graph partitioning problem (NCGPP); and Job sequencing and tool switching problem (SSP).作者: hedonic 時(shí)間: 2025-3-28 11:29 作者: 聯(lián)合 時(shí)間: 2025-3-28 17:13
Breakout Local Search for?Heaviest Subgraph Problem problem with various practical applications. BLS explores the search space by alternating iteratively between local search phase and dedicated perturbation strategies. Focusing on the perturbation phase, the algorithm determines its jump magnitude and perturbation type according to the search histo作者: rheumatism 時(shí)間: 2025-3-28 19:01
A Biased Random Key Genetic Algorithm for?Solving the?,-Neighbor p-Center Problemdeveloped obtaining competitive solutions for the problem. The objective of the ANPC is to locate . facilities serving demand points and assign a number . of facilities to each demand point. The objective function is evaluated as the maximum distance to the farthest facility assigned to each client,作者: Exposition 時(shí)間: 2025-3-28 23:55
A Continuous-GRASP Random-Key Optimizer continuous GRASP, is an extension of the GRASP metaheuristic for optimization of a general objective function in the continuous unit hypercube. The novel approach extends CGRASP using random keys for encoding solutions of the optimization problem in the unit hypercube and a decoder for evaluating e作者: 精確 時(shí)間: 2025-3-29 05:25
Adaptive Ant Colony Optimization Using Node Clustering with?Simulated AnnealingSP), which is an .-hard combinatorial optimization problems. As the number of cities increases, finding the shortest path in TSP, considering all combinations, becomes challenging. The ant colony optimization?(ACO) has been proposed as a solution to TSP. However, the performance of the ACO heavily d作者: Isthmus 時(shí)間: 2025-3-29 08:38
Job-Shop Scheduling with Robot Synchronization for Transport Operationsure, we assume that a transport operation may involve several robots simultaneously, which requires resource synchronization over time. We formulate this problem as a Mixed Integer Linear Programming (MILP) formulation. Then we propose a GRASP-ELS meta-heuristic and a local search procedure where we作者: 莊嚴(yán) 時(shí)間: 2025-3-29 12:11 作者: deface 時(shí)間: 2025-3-29 16:03
Investigation of?the?Benefit of?Extracting Patterns from?Local Optima to?Solve a?Bi-objective VRPTWn relevant knowledge that can be used to guide the heuristic towards promising areas. Learning from the structure of solutions is challenging in combinatorial problems. Most of the time, local optima are considered for this task since they tend to contain more relevant structural information. If loc作者: AV-node 時(shí)間: 2025-3-29 21:55 作者: BILK 時(shí)間: 2025-3-30 02:24 作者: 形容詞詞尾 時(shí)間: 2025-3-30 06:54 作者: 使糾纏 時(shí)間: 2025-3-30 09:59
A Simulated Annealing Algorithm to?Learn an?RMP Preference Model preference models are characterized by preference parameters which can be learned through preference learning algorithms from holistic judgments given by the DM. Here, we use Simulated Annealing (SA) to learn the parameters of the Ranking based on Multiple Reference Profiles (RMP) model and its sim作者: Connotation 時(shí)間: 2025-3-30 16:09
Iterative Heuristic over?Periods for?the?Inventory Routing Problemto serve a set of customers over a finite time horizon, performing product deliveries to meet the demands of customers taking into account constraints regarding inventory levels authorized as well as production capacity. We propose a heuristic method based on an iterative approach that decomposes th作者: A保存的 時(shí)間: 2025-3-30 19:01
