This page has only limited features, please log in for full access.

Unclaimed
Trung Hieu Tran
Laboratory for Urban Complexity and Sustainability, University of Nottingham, Nottingham NG7 2RB, UK

Basic Info

Basic Info is private.

Honors and Awards

The user has no records in this section


Career Timeline

The user has no records in this section.


Short Biography

The user biography is not available.
Following
Followers
Co Authors
The list of users this user is following is empty.
Following: 0 users

Feed

Journal article
Published: 16 October 2019 in Sustainability
Reads 0
Downloads 0

We develop a mixed-integer non-linear programming model for firms’ decarbonisation investment decision-making towards a sustainable environment. Our model seeks the optimal investment for a firm to achieve maximum profit under constraints derived from its environmental protection awareness and the government’s taxation policy. We use an uncertainty theory to formulate the relationship of a firm’s environmental protection awareness and its investment budget levels. Governments’ taxation policy is modelled by a step-wise linear function, where reduced carbon dioxide emission can help the firm reduce taxation. A linearisation is proposed to solve the non-linear problem efficiently. A case study for a sector of electronic component manufacturers in Nottingham, the United Kingdom, demonstrates the practical implementation of the proposed model. Several large-sized instances, which were randomly generated, were utilised to evaluate the the efficiency of model in terms of computational time. Our model can be used to explore budget options to obtain higher profits under a particular taxation policy.

ACS Style

Trung-Hieu Tran; Yong Mao; Peer-Olaf Siebers. Optimising Decarbonisation Investment for Firms towards Environmental Sustainability. Sustainability 2019, 11, 5718 .

AMA Style

Trung-Hieu Tran, Yong Mao, Peer-Olaf Siebers. Optimising Decarbonisation Investment for Firms towards Environmental Sustainability. Sustainability. 2019; 11 (20):5718.

Chicago/Turabian Style

Trung-Hieu Tran; Yong Mao; Peer-Olaf Siebers. 2019. "Optimising Decarbonisation Investment for Firms towards Environmental Sustainability." Sustainability 11, no. 20: 5718.

Journal article
Published: 01 June 2019 in Omega
Reads 0
Downloads 0
ACS Style

Trung Hieu Tran; Yong Mao; Paul Nathanail; Peer-Olaf Siebers; Darren Robinson. Integrating slacks-based measure of efficiency and super-efficiency in data envelopment analysis. Omega 2019, 85, 156 -165.

AMA Style

Trung Hieu Tran, Yong Mao, Paul Nathanail, Peer-Olaf Siebers, Darren Robinson. Integrating slacks-based measure of efficiency and super-efficiency in data envelopment analysis. Omega. 2019; 85 ():156-165.

Chicago/Turabian Style

Trung Hieu Tran; Yong Mao; Paul Nathanail; Peer-Olaf Siebers; Darren Robinson. 2019. "Integrating slacks-based measure of efficiency and super-efficiency in data envelopment analysis." Omega 85, no. : 156-165.

Journal article
Published: 01 January 2019 in Journal of Industrial & Management Optimization
Reads 0
Downloads 0
ACS Style

Kien Ming Ng; Trung Hieu Tran. A parallel water flow algorithm with local search for solving the quadratic assignment problem. Journal of Industrial & Management Optimization 2019, 15, 235 -259.

AMA Style

Kien Ming Ng, Trung Hieu Tran. A parallel water flow algorithm with local search for solving the quadratic assignment problem. Journal of Industrial & Management Optimization. 2019; 15 (1):235-259.

Chicago/Turabian Style

Kien Ming Ng; Trung Hieu Tran. 2019. "A parallel water flow algorithm with local search for solving the quadratic assignment problem." Journal of Industrial & Management Optimization 15, no. 1: 235-259.

Original research
Published: 24 September 2018 in Annals of Operations Research
Reads 0
Downloads 0

In this paper, we have formulated a mixed-integer non-linear programming model for alternative-fuel station location problem in which each station can fail with a site-specific probability. The model aims to maximise the total expected traffic volume that can be refuelled by the unreliable alternative-fuel stations. Based on the linearisation techniques, i.e., probability chains and piecewise-linear functions, we linearise the non-linearity of compound probability terms in the non-linear model to solve this problem efficiently. An efficient Tabu search algorithm is also developed to solve the large-size instances. In addition, we extend the model to deal with reliable multi-period alternative-fuel station network design. Computational experiments, carried out on the well-known benchmark instances where the probability of station failures is uniformly generated, show that the proposed models and algorithm can obtain the optimal solutions within a reasonable computation time. Compared to a standard station location model that disregards the potential for station failures, our model designs more reliable alternative-fuel station network under risk of station failures. A sensitivity analysis of failure probabilities in the station network design is investigated to demonstrate the robustness of our model and study how variability in the probability of station failure affects solution robustness.

ACS Style

Trung Hieu Tran; Thu Ba T. Nguyen. Alternative-fuel station network design under impact of station failures. Annals of Operations Research 2018, 279, 151 -186.

AMA Style

Trung Hieu Tran, Thu Ba T. Nguyen. Alternative-fuel station network design under impact of station failures. Annals of Operations Research. 2018; 279 (1-2):151-186.

Chicago/Turabian Style

Trung Hieu Tran; Thu Ba T. Nguyen. 2018. "Alternative-fuel station network design under impact of station failures." Annals of Operations Research 279, no. 1-2: 151-186.

Journal article
Published: 01 August 2018 in European Journal of Operational Research
Reads 0
Downloads 0
ACS Style

Trung Hieu Tran; Gábor Nagy; Thu Ba T. Nguyen; Niaz A. Wassan. An efficient heuristic algorithm for the alternative-fuel station location problem. European Journal of Operational Research 2018, 269, 159 -170.

AMA Style

Trung Hieu Tran, Gábor Nagy, Thu Ba T. Nguyen, Niaz A. Wassan. An efficient heuristic algorithm for the alternative-fuel station location problem. European Journal of Operational Research. 2018; 269 (1):159-170.

Chicago/Turabian Style

Trung Hieu Tran; Gábor Nagy; Thu Ba T. Nguyen; Niaz A. Wassan. 2018. "An efficient heuristic algorithm for the alternative-fuel station location problem." European Journal of Operational Research 269, no. 1: 159-170.

Journal article
Published: 01 July 2018 in European Journal of Operational Research
Reads 0
Downloads 0
ACS Style

Trung Hieu Tran; Simon French; Rhys Ashman; Edward Kent. Linepack planning models for gas transmission network under uncertainty. European Journal of Operational Research 2018, 268, 688 -702.

AMA Style

Trung Hieu Tran, Simon French, Rhys Ashman, Edward Kent. Linepack planning models for gas transmission network under uncertainty. European Journal of Operational Research. 2018; 268 (2):688-702.

Chicago/Turabian Style

Trung Hieu Tran; Simon French; Rhys Ashman; Edward Kent. 2018. "Linepack planning models for gas transmission network under uncertainty." European Journal of Operational Research 268, no. 2: 688-702.

Journal article
Published: 01 March 2018 in Applied Mathematical Modelling
Reads 0
Downloads 0
ACS Style

Trung Hieu Tran; Simon French; Rhys Ashman; Edward Kent. Impact of compressor failures on gas transmission network capability. Applied Mathematical Modelling 2018, 55, 741 -757.

AMA Style

Trung Hieu Tran, Simon French, Rhys Ashman, Edward Kent. Impact of compressor failures on gas transmission network capability. Applied Mathematical Modelling. 2018; 55 ():741-757.

Chicago/Turabian Style

Trung Hieu Tran; Simon French; Rhys Ashman; Edward Kent. 2018. "Impact of compressor failures on gas transmission network capability." Applied Mathematical Modelling 55, no. : 741-757.

Journal article
Published: 01 November 2017 in European Journal of Operational Research
Reads 0
Downloads 0
ACS Style

Trung Hieu Tran; Maria Paola Scaparra; Jesse R. O’Hanley. A hypergraph multi-exchange heuristic for the single-source capacitated facility location problem. European Journal of Operational Research 2017, 263, 173 -187.

AMA Style

Trung Hieu Tran, Maria Paola Scaparra, Jesse R. O’Hanley. A hypergraph multi-exchange heuristic for the single-source capacitated facility location problem. European Journal of Operational Research. 2017; 263 (1):173-187.

Chicago/Turabian Style

Trung Hieu Tran; Maria Paola Scaparra; Jesse R. O’Hanley. 2017. "A hypergraph multi-exchange heuristic for the single-source capacitated facility location problem." European Journal of Operational Research 263, no. 1: 173-187.

Journal article
Published: 01 February 2017 in Transportation Science
Reads 0
Downloads 0

In this paper, we investigate unreliability in hub location planning. A mixed integer nonlinear programming model is formulated for optimally locating p uncapacitated hubs, each of which can fail with a site-specific probability. The objective is to determine the location of hubs and the assignment of demand nodes to hubs to minimize expected demand weighted travel cost plus a penalty if all hubs fail. A linear version of the model is developed using a specialized flow network called a probability lattice to evaluate compound probability terms. A tabu search algorithm is proposed to find optimal to near optimal solutions for large problem instances. A parallel computing strategy is integrated into the tabu search process to improve performance. Experimental results carried out on several benchmark instances show the efficiency of our linearized model and heuristic algorithm. Compared with a standard hub median model that disregards the potential for hub failures, our model produces solutions that serve larger numbers of customers and at lower cost per customer.

ACS Style

Trung Hieu Tran; Jesse R. O’Hanley; M. Paola Scaparra. Reliable Hub Network Design: Formulation and Solution Techniques. Transportation Science 2017, 51, 358 -375.

AMA Style

Trung Hieu Tran, Jesse R. O’Hanley, M. Paola Scaparra. Reliable Hub Network Design: Formulation and Solution Techniques. Transportation Science. 2017; 51 (1):358-375.

Chicago/Turabian Style

Trung Hieu Tran; Jesse R. O’Hanley; M. Paola Scaparra. 2017. "Reliable Hub Network Design: Formulation and Solution Techniques." Transportation Science 51, no. 1: 358-375.

Original articles
Published: 01 April 2013 in Engineering Optimization
Reads 0
Downloads 0

In this article, the multi-objective flexible flow shop scheduling problem with limited intermediate buffers is addressed. The objectives considered in this problem consist of minimizing the completion time of jobs and minimizing the total tardiness time of jobs. A hybrid water flow algorithm for solving this problem is proposed. Landscape analysis is performed to determine the weights of objective functions, which guide the exploration of feasible regions and movement towards the optimal Pareto solution set. Local and global neighbourhood structures are integrated in the erosion process of the algorithm, while evaporation and precipitation processes are included to enhance the solution exploitation capability of the algorithm in unexplored neighbouring regions. An improvement process is used to reinforce the final Pareto solution set obtained. The performance of the proposed algorithm is tested with benchmark and randomly generated instances. The computational results and comparisons demonstrate the effectiveness and efficiency of the proposed algorithm.

ACS Style

Trung Hieu Tran; Kien Ming Ng. A hybrid water flow algorithm for multi-objective flexible flow shop scheduling problems. Engineering Optimization 2013, 45, 483 -502.

AMA Style

Trung Hieu Tran, Kien Ming Ng. A hybrid water flow algorithm for multi-objective flexible flow shop scheduling problems. Engineering Optimization. 2013; 45 (4):483-502.

Chicago/Turabian Style

Trung Hieu Tran; Kien Ming Ng. 2013. "A hybrid water flow algorithm for multi-objective flexible flow shop scheduling problems." Engineering Optimization 45, no. 4: 483-502.

Journal article
Published: 11 November 2010 in Journal of Scheduling
Reads 0
Downloads 0

We investigate the flexible flow shop scheduling problem with limited or unlimited intermediate buffers. A common objective of the problem is to find a production schedule that minimizes the completion time of jobs. Other objectives that we also consider are minimizing the total weighted flow time of jobs and minimizing the total weighted tardiness time of jobs. We propose a water-flow algorithm to solve this scheduling problem. The algorithm is inspired by the hydrological cycle in meteorology and the erosion phenomenon in nature. In the algorithm, we combine the amount of precipitation and its falling force to form a flexible erosion capability. This helps the erosion process of the algorithm to focus on exploiting promising regions strongly. To initiate the algorithm, we use a constructive procedure to obtain a seed permutation. We also use an improvement procedure for constructing a complete schedule from a permutation that represents the sequence of jobs in the first stage of the scheduling problem. To evaluate the proposed algorithm, we use benchmark instances taken from the literature and randomly generated instances of the scheduling problem. The computational results demonstrate the efficacy of the algorithm. We have also obtained several improved solutions for the benchmark instances using the proposed algorithm. We further illustrate the algorithm’s capability for solving problems in practical applications by applying it to a maltose syrup production problem.

ACS Style

Trung Hieu Tran; Kien Ming Ng. A water-flow algorithm for flexible flow shop scheduling with intermediate buffers. Journal of Scheduling 2010, 14, 483 -500.

AMA Style

Trung Hieu Tran, Kien Ming Ng. A water-flow algorithm for flexible flow shop scheduling with intermediate buffers. Journal of Scheduling. 2010; 14 (5):483-500.

Chicago/Turabian Style

Trung Hieu Tran; Kien Ming Ng. 2010. "A water-flow algorithm for flexible flow shop scheduling with intermediate buffers." Journal of Scheduling 14, no. 5: 483-500.