Zobrazeno 1 - 10
of 83
pro vyhledávání: '"Leandro C. Coelho"'
Autor:
Lucas Zimmermann, Leandro C. Coelho, Werner Kraus, Rodrigo Castelan Carlson, Luiz Alberto Koehler
Publikováno v:
IEEE Access, Vol 9, Pp 143284-143294 (2021)
We propose an optimal actuation of operational commands for regularizing bus headways. Assuming that a transit headway control system manages the bus operation by issuing reference arrival times at the next station for a bus, the problem is how to im
Externí odkaz:
https://doaj.org/article/8545b8591bb14d77a940d85023a1036b
Autor:
Renata Turkeš, Kenneth Sörensen, Lars Magnus Hvattum, Eva Barrena, Hayet Chentli, Leandro C. Coelho, Iman Dayarian, Axel Grimault, Anders N. Gullhav, Çağatay Iris, Merve Keskin, Alexander Kiefer, Richard Martin Lusby, Geraldo Regis Mauri, Marcela Monroy-Licht, Sophie N. Parragh, Juan-Pablo Riquelme-Rodríguez, Alberto Santini, Vínicius Gandra Martins Santos, Charles Thomas
Publikováno v:
Data in Brief, Vol 33, Iss , Pp 106568- (2020)
Meta-analysis, a systematic statistical examination that combines the results of several independent studies, has the potential of obtaining problem- and implementation-independent knowledge and understanding of metaheuristic algorithms, but has not
Externí odkaz:
https://doaj.org/article/da0294a4b47d419492d992e89ba1b917
Publikováno v:
Industrial Management & Data Systems. 122:2145-2150
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::2cc63d8aabb252d28d77d725c7ba0c03
https://doi.org/10.1108/imds-10-2022-813
https://doi.org/10.1108/imds-10-2022-813
Publikováno v:
TOP. 31:165-193
We consider a generalization of the selective traveling salesman problem (STSP) in which the benefit of visiting a location changes over time. This new problem, called the selective travelling salesman problem with time-dependent profits (STSP-TDP),
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::ad1ee3ec8db50ec144f59c571b1a5ac1
https://doi.org/10.1007/s11750-022-00632-6
https://doi.org/10.1007/s11750-022-00632-6
Autor:
Roberto Cantu-Funes, Leandro C. Coelho
Publikováno v:
Engineering Optimization. 55:841-855
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::54b9f8e674ddad626b387d055cc8f1d6
https://doi.org/10.1080/0305215x.2022.2044030
https://doi.org/10.1080/0305215x.2022.2044030
Publikováno v:
International Journal of Production Research. 61:49-64
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::f4a117aad2c8d3428cad73afa0272d1d
https://doi.org/10.1080/00207543.2021.1998696
https://doi.org/10.1080/00207543.2021.1998696
Publikováno v:
International Journal of Production Research. 60:6104-6123
This study investigates the unrelated parallel machine scheduling problem with release dates to minimise the makespan. The solution to this problem finds wide applications in manufacturing and logi...
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::0ba36fa32ea583675d9746f97bce1654
https://doi.org/10.1080/00207543.2021.1983224
https://doi.org/10.1080/00207543.2021.1983224
Publikováno v:
European Journal of Operational Research. 292:1066-1084
In the Quadratic Assignment Problem (QAP), facilities are assigned to sites in order to minimize interactions between pairs of facilities. Although easy to define, it is among the hardest problems in combinatorial optimization, due to its non-linear
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::7b27a55f73c390f40a6dc8db65580f09
https://doi.org/10.1016/j.ejor.2020.11.035
https://doi.org/10.1016/j.ejor.2020.11.035
Publikováno v:
International Journal of Production Research. 61:114-130
In this paper, we propose and assess the accuracy of new fuel consumption estimation models for vehicle routing. Based on real-world data consisting of instantaneous fuel consumption, time-varying ...
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::ded910e9c327e357cec4b5d8641c083b
https://doi.org/10.1080/00207543.2021.1948133
https://doi.org/10.1080/00207543.2021.1948133
Publikováno v:
Transportation Research Part B: Methodological. 149:204-229
In combinatorial auctions for the procurement of transportation services, each carrier has to determine the set of profitable contracts to bid on and the associated ask prices. This is known as the Bid Construction Problem (BCP). Our paper addresses
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::d8c1ec367a791079573b0a45402a7752
https://doi.org/10.1016/j.trb.2021.04.010
https://doi.org/10.1016/j.trb.2021.04.010