Zobrazeno 1 - 10
of 34
pro vyhledávání: '"Daniele Pretolani"'
Autor:
Daniele Pretolani
Publikováno v:
Journal of Sustainable Development of Energy, Water and Environment Systems, Vol 8, Iss 4, Pp 654-677 (2020)
The goal of this work is to apply Multiple Criteria Decision Analysis tools, both theoretical and practical, to analyse, support and possibly enhance composite indexes, in particular those related to sustainability assessment. In this context, the Su
Externí odkaz:
https://doaj.org/article/028a5d8235fb470fb6fa8835d9358be6
Publikováno v:
Advances in Transdisciplinary Engineering ISBN: 9781643683843
Picking operations inside a warehouse are the major share of the total costs of retailing operations. Optimization and harmonization of operations is therefore crucial in the economy of a successful business. In this paper we consider the case of a l
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::bcb0e485d090b36483f8d83917f40c1f
https://hdl.handle.net/11380/1301011
https://hdl.handle.net/11380/1301011
Publikováno v:
ICEIS (1)
In this paper, we present a decision support system (DSS) developed for a global service provider (GSP), which solves a real-world supplier selection problem. The GSP operates in the Italian market of facility management, supplying customers with a v
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::b16bc1d48fb119bf885901ea9ee2b3fe
https://hdl.handle.net/11380/1243695
https://hdl.handle.net/11380/1243695
Publikováno v:
Pretolani, D, Nielsen, L R, Andersen, K A & Ehrgott, M 2009, ' Time-adaptive and history-adaptive multicriterion routing in stochastic, time-dependent networks ', Operations Research Letters, vol. 37, no. 3, pp. 201-205 . https://doi.org/10.1016/j.orl.2009.02.001
We compare two different models for multicriterion routing in stochastic time-dependent networks: the classic "time-adaptive'' model and the more flexible "history-adaptive'' one. We point out several properties of the sets of efficient solutions fou
Publikováno v:
Operations Research Letters. 36:688-691
We consider a shortest path problem, where the travel times on the arcs may vary with time and waiting at any node is allowed. Simple adaptations of the Dijkstra algorithm may fail to solve the problem, when discontinuities exist. We propose a new Di
Publikováno v:
Discrete Applied Mathematics. 156(17):3248-3266
When piling a set of items in a single stack, one often does not pay attention to the order. Real-life experience suggests that, whenever a specific item is suddenly requested, we need to dig very deep into the stack to extract it.In this paper we in
Publikováno v:
Aarhus University
Nielsen, L R, Pretolani, D & Andersen, K A 2006, ' Finding the K shortest hyperpaths using reoptimization ', Operations Research Letters, vol. 34, no. 2, pp. 155-164 . https://doi.org/10.1016/j.orl.2005.04.008
Nielsen, L R, Pretolani, D & Andersen, K A 2006, ' Finding the K shortest hyperpaths using reoptimization ', Operations Research Letters, vol. 34, no. 2, pp. 155-164 . https://doi.org/10.1016/j.orl.2005.04.008
The shortest hyperpath problem is an extension of the classical shortest path problem and has applications in many different areas. Recently, algorithms for finding the K shortest hyperpaths in a directed hypergraph have been developed by Andersen, N
Publikováno v:
Discrete Applied Mathematics. 117(1-3):1-13
We give a partial characterization of graphs of bandwidth two, whose structure has been exploited to a very limited extent so far. Our results are used to derive a new linear-time recognition algorithm which is much simpler to describe than the previ
Publikováno v:
Nielsen, L R, Andersen, K A & Pretolani, D D 2014, ' Ranking paths in stochastic time-dependent networks ', European Journal of Operational Research, vol. 236, no. 3, pp. 903-914 . https://doi.org/10.1016/j.ejor.2013.10.022
In this paper we address optimal routing problems in networks where travel times are both stochastic and time-dependent. In these networks, the best route choice is not necessarily a path, but rather a time-adaptive strategy that assigns successors t
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::9f9d6c6a77df579004c3a4e8d23f6e3a
https://pure.au.dk/portal/da/publications/ranking-paths-in-stochastic-timedependent-networks(0f1ee7c8-1ac8-4390-977b-37476331ee7c).html
https://pure.au.dk/portal/da/publications/ranking-paths-in-stochastic-timedependent-networks(0f1ee7c8-1ac8-4390-977b-37476331ee7c).html
Autor:
Daniele Pretolani
The ultimate goal of proportional apportionment methods is the minimization of disproportionality, i.e., unequal distribution of political representation among voters, or citizens. The Gini index is a well known tool for measuring inequality. In this
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::ee16778f8bfed84654fe8f136e38e717
https://hdl.handle.net/11380/1061475
https://hdl.handle.net/11380/1061475