Zobrazeno 1 - 10
of 35
pro vyhledávání: '"Olli Bräysy"'
Publikováno v:
European Journal of Transport and Infrastructure Research, Vol 7, Iss 2 (2007)
A well-structured supply chain is of key importance in achieving efficient operations amongst the suppliers, manufacturers, distribution facilities and distribution channels that constitute the supply chain. The changing economic and political enviro
Externí odkaz:
https://doaj.org/article/78a3aa6307994b2c8e67798a935fe1f3
Publikováno v:
Computational Methods in Applied Sciences ISBN: 9783319544892
Computational Methods and Models for Transport
Computational Methods and Models for Transport
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::123d223588799764c11038627ef5ef0a
https://doi.org/10.1007/978-3-319-54490-8
https://doi.org/10.1007/978-3-319-54490-8
This volume addresses challenges and solutions in transport and mobility of people and goods with respect to environment, safety, security and socio–economics issues, exploring advanced computational research work and the latest innovations in tran
Publikováno v:
Computational Methods and Models for Transport ISBN: 9783319544892
Bräysy, O, Dullaert, W & Porkka, P P 2018, A simple metaheuristic for the fleetsize and mix problem with TimeWindows . in Computational Methods and Models for Transport : New Challenges for the Greening of Transport Systems . vol. 45, Computational Methods in Applied Sciences, vol. 45, Springer Netherland, pp. 57-70 . https://doi.org/10.1007/978-3-319-54490-8_4
Computational Methods and Models for Transport: New Challenges for the Greening of Transport Systems, 45, 57-70
Bräysy, O, Dullaert, W & Porkka, P P 2018, A simple metaheuristic for the fleetsize and mix problem with TimeWindows . in Computational Methods and Models for Transport : New Challenges for the Greening of Transport Systems . vol. 45, Computational Methods in Applied Sciences, vol. 45, Springer Netherland, pp. 57-70 . https://doi.org/10.1007/978-3-319-54490-8_4
Computational Methods and Models for Transport: New Challenges for the Greening of Transport Systems, 45, 57-70
This paper presents a powerful new single-parameter metaheuristic to solve the Fleet Size and Mix Vehicle Routing Problem with Time Windows. The key idea of the new metaheuristic is to perform a random number of random-sized jumps in random order thr
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::be3d98c66f8c9a3cf45462c39fca96a9
https://doi.org/10.1007/978-3-319-54490-8_4
https://doi.org/10.1007/978-3-319-54490-8_4
Publikováno v:
Li, G, Braysy, O M P, Jiang, L, Wu, Z & Wang, Y 2013, ' Finding Time Series Discord Based on Bit Representation Clustering ', Knowledge-Based Systems, vol. 54, pp. 243-254 . https://doi.org/10.1016/j.knosys.2013.09.015
Knowledge-Based Systems, 54, 243-254. Elsevier
Knowledge-Based Systems, 54, 243-254. Elsevier
The problem of finding time series discord has attracted much attention recently due to its numerous applications and several algorithms have been suggested. However, most of them suffer from high computation cost and cannot satisfy the requirement o
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::62b28e356f0a9899538ecbfb5f2b9076
https://doi.org/10.1016/j.knosys.2013.09.015
https://doi.org/10.1016/j.knosys.2013.09.015
Publikováno v:
Computers & operations research
Computers and Operations Research, 37(4), 724-737. Elsevier Limited
Nagata, Y, Bräysy, O & Dullaert, W 2010, ' A penalty-based edge assembly memetic algorithm for the vehicle routing problem with time windows ', Computers and Operations Research, vol. 37, no. 4, pp. 724-737 . https://doi.org/10.1016/j.cor.2009.06.022
Computers and Operations Research, 37(4), 724-737. Elsevier Limited
Nagata, Y, Bräysy, O & Dullaert, W 2010, ' A penalty-based edge assembly memetic algorithm for the vehicle routing problem with time windows ', Computers and Operations Research, vol. 37, no. 4, pp. 724-737 . https://doi.org/10.1016/j.cor.2009.06.022
In this paper, we present an effective memetic algorithm for the vehicle routing problem with time windows (VRPTW). The paper builds upon an existing edge assembly crossover (EAX) developed for the capacitated VRP. The adjustments of the EAX operator
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::d7c680f16f622a35f4c73634ce8192b6
https://doi.org/10.1016/j.cor.2009.06.022
https://doi.org/10.1016/j.cor.2009.06.022
Publikováno v:
Computers & Operations Research. 37:443-455
This paper presents a hybrid evolution strategy (ES) for solving the open vehicle routing problem (OVRP), which is a well-known combinatorial optimization problem that addresses the service of a set of customers using a homogeneous fleet of non-depot
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::c34ea7d48598d3c9900f6b1fa0afb9ec
https://doi.org/10.1016/j.cor.2008.11.003
https://doi.org/10.1016/j.cor.2008.11.003
Publikováno v:
Bräysy, O, Nakari, P, Dullaert, W & Neittaanmäki, P 2009, ' An optimization approach for communal home meal delivery service : A case study ', Journal of computational and applied mathematics, vol. 232, no. 1, pp. 46-53 . https://doi.org/10.1016/j.cam.2008.10.038
Journal of computational and applied mathematics, 232(1), 46-53. Elsevier
Journal of computational and applied mathematics
Journal of computational and applied mathematics, 232(1), 46-53. Elsevier
Journal of computational and applied mathematics
This paper is the first to discuss the communal home meal delivery problem. The problem can be modelled as a multiple travelling salesman problem with time windows, that is closely related to the well-studied vehicle routing problem with time windows
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::e1ccdf7d58b5512ad931228ce2988783
https://doi.org/10.1016/j.cam.2008.10.038
https://doi.org/10.1016/j.cam.2008.10.038
Autor:
Yuichi Nagata, Olli Bräysy
Publikováno v:
Networks. 54:205-215
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::befe218e5e2d528a51aed3fec5f3cb67
https://doi.org/10.1002/net.20333
https://doi.org/10.1002/net.20333
Autor:
Olli Bräysy, David Mester
Publikováno v:
Computers & Operations Research. 34:2964-2975
We present an adaptation of the active-guided evolution strategies metaheuristic for the capacitated vehicle routing problem. The capacitated vehicle routing problem is a classical problem in operations research in which a set of minimum total cost r
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::c21bff2dc302190513d34aaee45c3753
https://doi.org/10.1016/j.cor.2005.11.006
https://doi.org/10.1016/j.cor.2005.11.006