Zobrazeno 1 - 10
of 71
pro vyhledávání: '"I-Ming Chao"'
Autor:
Shou-Cheng Hsiung1 melvinisstrong@gmail.com, I-Ming Chao2 iming@isu.edu.tw, Hsiang-Chen Hsu2 hchsu@isu.edu.tw
Publikováno v:
International Journal of Organizational Innovation. Apr2022, Vol. 14 Issue 4, p415-430. 16p.
Publikováno v:
Journal of Industry-University Collaboration, Vol 1, Iss 3, Pp 118-131 (2019)
Purpose – The purpose of this paper is to analyze the trends of global automobile industry toward energy saving and smart application. The automobile industry has its own special supply, safety and reliability system. It combined with the legislati
Externí odkaz:
https://doaj.org/article/433d9ee55f9f4f1a903a88f909169cab
Publikováno v:
Advances in Technology Innovation (2020)
Whale Optimization Algorithm (WOA) is a new kind of swarm-based optimization algorithm that mimics the foraging behavior of humpback whales. WOA models the particular hunting behavior with three stages: encircling prey, bubble-net attacking, and sear
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::758bb87ca9bc1fdf299bc1985b1c61d5
https://doi.org/10.46604/aiti.2020.4167
https://doi.org/10.46604/aiti.2020.4167
Publikováno v:
Journal of Industry-University Collaboration. 1:118-131
Purpose The purpose of this paper is to analyze the trends of global automobile industry toward energy saving and smart application. The automobile industry has its own special supply, safety and reliability system. It combined with the legislations
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::1238cecedbc781fa9a4f89e42a667f53
https://doi.org/10.1108/jiuc-04-2019-0009
https://doi.org/10.1108/jiuc-04-2019-0009
Autor:
I-Ming Chao, Nai-Chieh Wei
Publikováno v:
Computers & Industrial Engineering. 61:824-830
This paper presents a type E simple assembly line balancing problem (SALBP-E) that combines models SALBP-1 and SALBP-2. Furthermore, this study develops a solution procedure for the proposed model. The proposed model provides a better understanding o
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::a28638525a8a60ddca580a4974950266
https://doi.org/10.1016/j.cie.2011.05.015
https://doi.org/10.1016/j.cie.2011.05.015
Autor:
I-Ming Chao
Publikováno v:
Computers & Operations Research. 29:33-51
A solution construction method and a tabu search improvement heuristic coupled with the deviation concept found in deterministic annealing is developed to solve the truck and trailer routing problem. We test our tabu search method on 21 problems that
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::986de45082047eaf7a07e1641d819b7c
https://doi.org/10.1016/s0305-0548(00)00056-3
https://doi.org/10.1016/s0305-0548(00)00056-3
Publikováno v:
INFOR: Information Systems and Operational Research. 37:319-336
In the site-dependent vehicle routing problem, a fleet of heterogeneous vehicles services a set of customers. Typically, there are several vehicle types (for example, small-, medium-, and large-cap...
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::a478f1964937fb184c7ddcb15b40b322
https://doi.org/10.1080/03155986.1999.11732387
https://doi.org/10.1080/03155986.1999.11732387
This paper combines the branch-and-bound method and the petri net to solve the two-sided assembly line balancing problem, thus facilitating effective branching and pruning of tasks. By integrating features of the petri net, such as reachability graph
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::3b6a98d73e4c9d1e98ac4711095b4299
This paper combines the branch-and-bound method and the petri net to solve the two-sided assembly line balancing problem, thus facilitating effective branching and pruning of tasks. By integrating features of the petri net, such as reachability graph
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::934f02547c01967d93ee06b1f21da430
Publikováno v:
European Journal of Operational Research. 88:475-489
In the orienteering problem, start and end points are specified along with other locations which have associated scores. Given a fixed amount of time, the goal is to determine a path from the start point to the end point through a subset of locations
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::c6cc876577d1077b939be02a14b16e0b
https://doi.org/10.1016/0377-2217(95)00035-6
https://doi.org/10.1016/0377-2217(95)00035-6