Zobrazeno 1 - 10
of 37
pro vyhledávání: '"Alan Crispin"'
Autor:
Olawale Titiloye, Alan Crispin
Publikováno v:
PLoS ONE, Vol 7, Iss 11, p e50060 (2012)
Quantum annealing is a combinatorial optimization technique inspired by quantum mechanics. Here we show that a spin model for the k-coloring of large dense random graphs can be field tuned so that its acceptance ratio diverges during Monte Carlo quan
Externí odkaz:
https://doaj.org/article/5a78b5bb75a44807b65fe3398e7b0b8c
Autor:
Alan Crispin, Alex Syrichas
Publikováno v:
Computers & Operations Research. 87:52-62
Quantum Annealing was previously applied to the vehicle routing problem and the results were promising. For all benchmark instances in the study, optimal results were obtained. However, 100% success rate was not achieved in every case, and tuning the
Publikováno v:
Advances in Intelligent Systems and Computing ISBN: 9783030295158
IntelliSys (1)
IntelliSys (1)
In this paper, a greedy randomized heuristic is used to solve a service technician routing and scheduling problem with time windows. Time window constraints occur in many sectors such as telecommunications, maintenance, call centres, warehouses and h
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::80ecacace4e1b86f4ea4a65bcb74c503
https://doi.org/10.1007/978-3-030-29516-5_86
https://doi.org/10.1007/978-3-030-29516-5_86
Publikováno v:
Advances in Intelligent Systems and Computing ISBN: 9783030295158
IntelliSys (1)
IntelliSys (1)
This paper discusses the occurrence of dependency relationships within NP hard personnel scheduling problems. These dependencies, commonly referred to as precedence constraints, arise in a number of industries including but not limited to: maintenanc
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::7f7af158541bfb00c3f9ddaa8a18bef5
https://doi.org/10.1007/978-3-030-29516-5_85
https://doi.org/10.1007/978-3-030-29516-5_85
Publikováno v:
GECCO (Companion)
Many combinatorial optimization problems involve scheduling or ordering work that will ultimately be completed by a company's employees. If solution quality is measured by a simple weighted sum of the constraint violations for each employee, an optim
Publikováno v:
FUZZ-IEEE
Fuzzy Semantic Similarity Measures are algorithms that are able to compare two or more short texts that contain human perception based words and return a numeric measure of similarity of meaning between them. Such similarity is computed using a weigh
Publikováno v:
FUZZ-IEEE
Measurement of the semantic and syntactic similarity of human utterances is essential in developing language that is understandable when machines engage in dialogue with users. However, human language is complex and the semantic meaning of an utteran
Publikováno v:
Combinatorial Optimization and Applications ISBN: 9783319711461
COCOA (2)
COCOA (2)
In 2016 the UK government imposed a new contract on junior doctors working for the country’s National Health Service. This new contract significantly changed the way in which hospitals and health trusts create rosters, introducing new constraints a
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::eef37f1bd5030b1548f51bcc7acfb371
https://e-space.mmu.ac.uk/619524/
https://e-space.mmu.ac.uk/619524/
Publikováno v:
2017 Intelligent Systems Conference (IntelliSys).
This paper aims to provide a review of technician and task scheduling problems. A technician and task scheduling problem requires the creation of timetables for employees in order to serve customers, each having skill requirements. Optimised scheduli
Publikováno v:
FUZZ-IEEE
This paper examines the suitability of applying fuzzy semantic similarity measures (FSSM) to the task of detecting potential future events through the use of a group of prototypical event tweets. FSSM are ideal measures to be used to analyse the sema