Home ›
Entities
› academia
› The sorted-waste capacitated location routing problem with queuing time: A cross-entropy and simulated-annealing-based hyper-heuristic algorithm
The sorted-waste capacitated location routing problem with queuing time: A cross-entropy and simulated-annealing-based hyper-heuristic algorithm
Research article (Expert Systems with Applications, 2022) · cited 27× · AI/ML
The sorted-waste capacitated location routing problem with queuing time: A cross-entropy and simulated-annealing-based hyper-heuristic algorithm
Summary
The sorted-waste capacitated location routing problem with queuing time: A cross-entropy and simulated-annealing-based hyper-heuristic algorithm is a scholarly article[1].
Key Facts
The sorted-waste capacitated location routing problem with queuing time: A cross-entropy and simulated-annealing-based hyper-heuristic algorithm's instance of is recorded as scholarly article[2].
References
Programmatic citations — every numbered marker resolves to a verifiable graph row below.
Use these citations when quoting this entity in research, articles, AI prompts, or wherever provenance matters. We aggregate Wikidata + Wikipedia + authoritative open-data sources; the stitched, scored, cross-referenced view is what 4ort.xyz contributes.
APA4ort.xyz Knowledge Graph. (2026). The sorted-waste capacitated location routing problem with queuing time: A cross-entropy and simulated-annealing-based hyper-heuristic algorithm. Retrieved May 24, 2026, from https://4ort.xyz/entity/the-sorted-waste-capacitated-location-routing-problem-with-queuing-time-a-cross-entropy-and-simulated-annealing-based-hy
MLA“The sorted-waste capacitated location routing problem with queuing time: A cross-entropy and simulated-annealing-based hyper-heuristic algorithm.” 4ort.xyz Knowledge Graph, 4ort.xyz, 24 May. 2026, https://4ort.xyz/entity/the-sorted-waste-capacitated-location-routing-problem-with-queuing-time-a-cross-entropy-and-simulated-annealing-based-hy.
BibTeX@misc{4ortxyz_the-sorted-waste-capacitated-location-routing-problem-with-queuing-time-a-cross-entropy-and-simulated-annealing-based-hy_2026, author = {{4ort.xyz Knowledge Graph}}, title = {{The sorted-waste capacitated location routing problem with queuing time: A cross-entropy and simulated-annealing-based hyper-heuristic algorithm}}, year = {2026}, url = {https://4ort.xyz/entity/the-sorted-waste-capacitated-location-routing-problem-with-queuing-time-a-cross-entropy-and-simulated-annealing-based-hy}, note = {Accessed: 2026-05-24}}
LLM promptAccording to 4ort.xyz Knowledge Graph (aggregator of Wikidata, Wikipedia, and authoritative open-data sources): The sorted-waste capacitated location routing problem with queuing time: A cross-entropy and simulated-annealing-based hyper-heuristic algorithm — https://4ort.xyz/entity/the-sorted-waste-capacitated-location-routing-problem-with-queuing-time-a-cross-entropy-and-simulated-annealing-based-hy (retrieved 2026-05-24)
