Zobrazeno 1 - 10
of 175
pro vyhledávání: '"Antonio Sforza"'
Publikováno v:
Transportation Research Procedia. 52:51-58
In this work we focus on the flying sidekick traveling salesman problem (FS-TSP). The FS-TSP arises in the last-mile distribution context and it is a variant of the TSP aimed at determining the distribution plan of a driver-operated truck assisted by
Publikováno v:
INFORMS Journal on Computing.
The simple pattern minimality problem (SPMP) represents a central problem in the logical analysis of data and association rules mining, and it finds applications in several fields as logic synthesis, reliability analysis, and automated reasoning. It
Publikováno v:
Mathematical Optimization Theory and Operations Research ISBN: 9783030499877
MOTOR
MOTOR
Nowadays vehicles are highly customizable products. Indeed, they can be equipped with a great number of options directly chosen by the customers. This situation provides several harness design problems to automotive companies, where by harness we mea
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::3cc93d8a4b72e1630d23ba65d57502cc
http://hdl.handle.net/11588/828658
http://hdl.handle.net/11588/828658
In the two-dimensional (2D) cutting (2DC) problem, a large rectangular sheet has to be dissected into smaller rectangular pieces with the aim of maximizing the total profit associated with the extracted pieces. When the number of copies of each piece
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::a6259565c54c8a0d595d02f4f6dfd0a3
http://hdl.handle.net/11588/766509
http://hdl.handle.net/11588/766509
This paper addresses the Inventory Routing Problem with Pickups and Deliveries (IRP-PD). A single commodity has to be picked up from several origins and distributed to several destinations. The commodity is made available at the supplier depot and at
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::9cda075c2f51d3c0c2b4cde5ea60d847
http://hdl.handle.net/11588/766540
http://hdl.handle.net/11588/766540
Publikováno v:
Soft Computing. 23:2947-2957
The minimum routing cost tree problem arises when we need to find the tree minimizing the minimum travel/communication cost, i.e., the tree which presents the minimal difference with the same cost computed on the whole network. This paper provides th
Publikováno v:
Soft Computing. 23:2959-2967
We address a general fault-tolerant version of the k-median problem on a network. Unlike the original k-median, the objective is to find k nodes (medians or facilities) of a network, assign each non-median node (customer) to $$r_j$$ distinct medians,
This book collects selected contributions from the international conference “Optimization and Decision Science” (ODS2020), which was held online on November 19, 2020, and organized by AIRO, the Italian Operations Research Society. The book offer
Publikováno v:
GEOmedia, Vol 12, Iss 5 (2008)
Acoustic pollution evaluation along a highway with land datas and GIS During last few years noise pollution has become a relevant problem in urban and sub-urban areas. This is caused by industrial development and the progressive extension of the ur
Externí odkaz:
https://doaj.org/article/1159de21eb9d4e73bc31b150286487d5
Publikováno v:
2019 6th International Conference on Frontiers of Industrial Engineering (ICFIE).
In this paper, we addressed the issue of maintenance workforce allocation (WA) for a human-automation interaction (HAI) in dynamic situations. We performed in parallel a traditional method for workload analysis and a mental workload assessment for th