Zobrazeno 1 - 10
of 177
pro vyhledávání: '"Bassem Jarboui"'
Publikováno v:
International Journal of Industrial Engineering Computations, Vol 9, Iss 2, Pp 195-204 (2017)
This article discusses the ecological vehicle routing problem with a stop at a refueling station titled Green-Vehicle Routing Problem. In this problem, the refueling stations and the limit of fuel tank capacity are considered for the construction of
Externí odkaz:
https://doaj.org/article/a969758089df402a8831f9747145b960
Publikováno v:
Optimization Letters.
Publikováno v:
Yugoslav Journal of Operations Research. 32:45-59
This paper deals with the permutation flowshop scheduling problem with time lags constraints to minimize the total weighted tardiness criterion by using the Branch and Bound algorithm. A new lower bound was developed for the flowshop scheduling probl
Publikováno v:
International Transactions in Operational Research.
Publikováno v:
Metaheuristics for Machine Learning ISBN: 9789811938870
The parking problem has become one of the major issues in urban transportation planning and traffic management research. The present paper deals with the dynamic assignment problem of the parking slots (places). The objectives are to provide a global
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::8c8609c1d9bca22145d675a1c5cf25d5
https://doi.org/10.1007/978-981-19-3888-7_8
https://doi.org/10.1007/978-981-19-3888-7_8
Publikováno v:
Pattern Recognition. 137:109269
Publikováno v:
Yugoslav Journal of Operations Research, Vol 31, Iss 3, Pp 299-318 (2021)
In this work we deal with a generalized variant of the multi-vehicle covering tour problem (m-CTP). The m-CTP consists of minimizing the total routing cost and satisfying the entire demand of all customers, without the restriction of visiting them al
Autor:
Bassem Jarboui, Saber Ibrahim
Publikováno v:
Optimization Letters. 16:137-151
One of the practical application in cellular manufacturing systems is the cell formation problem (CFP). Its main idea is to group machines into cells and parts into part families in a way that the number of exceptional elements and the number of void
Publikováno v:
Optimization Letters. 16:191-210
In the field of automatic programming (AP), the solution of a problem is a program, which is usually represented by an AP-tree. A tree is built using functional and terminal nodes. For solving AP problems, we propose a new neighborhood structure that
Autor:
Souhir Elleuch, Bassem Jarboui
Publikováno v:
Intelligent Systems Design and Applications ISBN: 9783030963071
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::40f7a6353e5b5c0b08a58416a92a7878
https://doi.org/10.1007/978-3-030-96308-8_115
https://doi.org/10.1007/978-3-030-96308-8_115