[HTML][HTML] Genetic algorithm for asymmetric traveling salesman problem with imprecise travel times
J Majumdar, AK Bhunia - Journal of Computational and Applied …, 2011 - Elsevier
This paper presents a variant of the asymmetric traveling salesman problem (ATSP) in which
the traveling time between each pair of cities is represented by an interval of values …
the traveling time between each pair of cities is represented by an interval of values …
Bus routing fine-tuning for integrated network-based demand and bus bridging for a disrupted railway system
Unanticipated commuter railway disruptions inevitably tend to result in passenger bunching
and frustration with considerable delays. Bus bridging strategy is a timely response …
and frustration with considerable delays. Bus bridging strategy is a timely response …
Optimization research on energy-saving and life-cycle decarbonization retrofitting of existing school buildings: A case study of a school in Nanjing
Y Xu, C Yan, G Wang, J Shi, K Sheng, J Li, Y Jiang - Solar Energy, 2023 - Elsevier
Given the continuous urbanization, many old buildings urgently need retrofitting.
Considering the impact on student health, carbon peaking and carbon neutrality policies, the …
Considering the impact on student health, carbon peaking and carbon neutrality policies, the …
Maximizing the nurses' preferences in nurse scheduling problem: mathematical modeling and a meta-heuristic algorithm
The nurse scheduling problem (NSP) has received a great amount of attention in recent
years. In the NSP, the goal is to assign shifts to the nurses in order to satisfy the hospital's …
years. In the NSP, the goal is to assign shifts to the nurses in order to satisfy the hospital's …
[PDF][PDF] Recent advancements of nurse scheduling models and a potential path
Nurse scheduling problem (NSP) has been a subject that is being studied broadly by both
academician and practitioners, over the years. Nurse scheduling concepts are varied due to …
academician and practitioners, over the years. Nurse scheduling concepts are varied due to …
Fuzzy mathematical modeling approach for the nurse scheduling problem: a case study
H Jafari, S Bateni, P Daneshvar, S Bateni… - International journal of …, 2016 - Springer
The nurse scheduling problem (NSP) has received a great amount of attention in recent
years. In the NSP, the goal is to assign the shifts to the nurses in order to satisfy the …
years. In the NSP, the goal is to assign the shifts to the nurses in order to satisfy the …
[HTML][HTML] Uncertain programming model for uncertain optimal assignment problem
This paper employs uncertain programming to deal with uncertain optimal assignment
problem in which profit is uncertain. Within the framework of uncertain programming, it gives …
problem in which profit is uncertain. Within the framework of uncertain programming, it gives …
A three-stage optimization method for the classroom envelope in primary and secondary schools in China
Y Xu, C Yan, Y Pan, K Zhao, M Li, F Zhu… - Journal of Building …, 2022 - Elsevier
The design optimization of primary and secondary school classrooms should consider the
effects of energy, thermal comfort, and daylighting. This paper proposes a three-stage …
effects of energy, thermal comfort, and daylighting. This paper proposes a three-stage …
A tripartite equilibrium for carbon emission allowance allocation in the power-supply industry
J Xu, X Yang, Z Tao - Energy Policy, 2015 - Elsevier
In the past decades, there has been a worldwide multilateral efforts to reduce carbon
emissions. In particular, the “cap-and-trade” mechanism has been regarded as an effective …
emissions. In particular, the “cap-and-trade” mechanism has been regarded as an effective …
Joint QoS multicast routing and channel assignment in multiradio multichannel wireless mesh networks using intelligent computational methods
In this paper, the quality of service multicast routing and channel assignment (QoS-MRCA)
problem is investigated. It is proved to be a NP-hard problem. Previous work separates the …
problem is investigated. It is proved to be a NP-hard problem. Previous work separates the …