用户登录 English
师资队伍栏目图
师资队伍大图
hewen 姓 名: 何文
系 别: 信息管理与电子商务系
职 称: 助理教授
办 公 室: 工商管理学院B312
办公电话: 86-731-88822899
移动电话:  
E-mail: hewen123@hnu.edu.cn

个人简介

何文博士,先后获得南开大学学士、中国人民大学硕士以及香港中文大学博士学位。现任湖南大学工商管理学院助理教授,硕士生导师,讲授运营管理、运筹学等本科及研究生课程。研究兴趣在物流与供应链管理、收益管理、航空货运、网络物流平台等领域。 曾发表学术论文在Transportation Science、European Journal of Operational Research、International Journal of Production Research 等国际学术期刊。现主持一项国家自然科学基金青年项目。曾担任European Journal of Operational Research、Transportation Reserach Part E、Asia-Pacific Journal of Operational Research 等期刊匿名审稿人。

教育背景

2010.08-2014.08    香港中文大学    决策科学与企业经济   博士

2007.09-2010.07    中国人民大学    运筹学与控制论   硕士

2003.09-2007.07    南开大学    数学与应用数学   学士 

职业经历

2014.09-至今    湖南大学工商管理学院   助理教授 

讲授课程

运筹学、运营管理、运营管理与电子商务经典导读

研究领域

物流与供应链管理、收益管理、航空货运、网络物流平台

研究成果

1论文

1) Gang ChenWen He*Lawrence C. LeungTian LanYingying HanAssigning licenced technicians to maintenance tasks at aircraft maintenance base: A bi-objective approach and a Chinese airline applicationInternational Journal of Production Research2017(corresponding author)

Abstract: Assigning technicians to maintenance tasks at an aircraft maintenance base is challenging and needs to consider technician licenses, fairness, and such operational constraints as hangar capacity and work shifts. We formulate the problem as a bi-objective optimization model, which minimizes total cost while simultaneously achieving fairness in workload allocation among different technicians. A tabu-based heuristic algorithm is developed to obtain Pareto efficient solutions. The algorithm is shown to be effective through comparison with CPLEX. A case study from a major Chinese airline demonstrates that our optimization-based approach is applicable and beneficial to the practice. Managerial issues on maintenance workforce management are examined as well. The results show that training technicians and upgrading their licenses may not be better off, and increasing the number of technicians has both favorable and unfavorable effects.

2) Jiayan XuYinbo FengWen He*Procurement auctions with ex post cooperation between capacity constrained biddersEuropean Journal of Operational Research,2017(corresponding author)

Abstract: The use of procurement auctions is a common practice for firms to procure goods and services. In this paper, we consider a first-price sealed-bid procurement auction consisting of two bidders with limited capacities. Each bidder is not able to complete the auctioned project on its own due to its capacity constraint. Upon the auction ends, the winning bidder has the option of cooperating with the losing bidder to fulfill the project. We investigate how the ex post cooperation affects bidders’ bidding strategies and equilibrium profits as well as the competition intensity of the auction. Surprisingly, we find that a bidder’s profit at equilibrium may decrease in its capacity level and increase in its unit cost. This is because a bidder’s larger capacity or smaller unit cost would lower the other bidder’s cost to complete the project due to the presence of cooperation, and thus intensify the competition between bidders. We also find that the winning bid price may become higher or lower (depending on bidders’ characteristics) when bidders have the option of ex post cooperation. Further, it is shown that the bidder with a cost advantage may be hurt by the ex post cooperation.

3) Lawrence C. LeungGang ChenYer Van HuiWen HeAn airfreight forwarder's shipment bidding and logistics planningTransportation Science201650(1)275-287

Abstract: Today many web-based logistics platforms exist, enabling logistics agents worldwide to interact and form collaborations in an effective manner. In particular, some advanced e-platforms support online bidding of shipments. This paper integrates shipment bidding with logistics decisions. First, we formulate the shipment bidding and logistics planning model as a 0-1 mixed integer program, which addresses only buyout bids. Based on the properties of the model, we design a two-echelon solution procedure to search for the optimal shipment portfolio and the corresponding logistics requirements. We then extend the model to include placing either a buyout bid or an alternative bid for a new shipment with an estimated probability of success. The general model is formulated as a two-stage mixed 0-1 stochastic integer program, which allows forwarders to acquire some new jobs right away while placing alternative bids on others. The model is solved by modifying the two-echelon procedure. An illustrative example is included to highlight the significance of integrating shipment bidding with shipment logistics planning. Managerial issues are explored based on this example.

4) Wen He, Jinwu Gao*, Hidden Markov Bayesian game with application to Chinese education gameJournal of Uncertainty Analysis and Applications2016, 4(4): 1-12

Abstract: In real game situations, players are often not perfectly informed about true states but can observe signals, and decision-making may involve several periods. In order to formulate such situations, this paper uses a hidden Markov model to describe the state process, thus introducing a repeated game with hidden Markovian states, called hidden Markov Bayesian game. For the new model, a notion of Nash equilibrium is presented and an algorithm is developed to facilitate obtaining the equilibrium quickly. An analysis of the Chinese education game shows that the observed signals play an important role in analyzing players’ behavior. 

5) Yong Wang*Wen HeYer Van HuiLawrence C. LeungA two-echelon neighborhood search algorithm for a forwarder's job assignment in a multi-agent logistics networkAsia-Pacific Journal of Operational Research201532(3)1-18 

Abstract: Freight forwarders plan shipping logistics for client shipments based on available trans- port networks where logistics agents move commodities from origins to destinations. Forwarders typically have the option of assigning shipments to in-house agents or to sub-contracting agents. When making such assignment decisions, consolidation of shipments is a plausible cost-saving consideration. In this paper, we consider assignments of shipments to agents as well as shipment routing choices on a network. We formulate the problem as a nonlinear program where unit costs charged by agents are described as nonlinear functions. The special case with piecewise constant unit costs is formulated as a mixed integer program. We then develop a two-echelon heuristic algorithm to solve the nonlinear program. The upper echelon of the heuristic assigns shipments to suitable agents by adopting a set of neighborhood policies, while the lower echelon improves the routing plan by consolidating jobs along (sub) paths. The feasibility and validity of the heuristic are examined based on randomly generated instances. Computational results show that the heuristic is able to obtain good solutions in manageable computation time.

6) Wen HeJinwu Gao*A non-optimal consumption model with habit formation over the life cycleInformation-An International Interdisciplinary Journal201215(8)3249-3254 

Abstract: This paper argues that individual's consumption is not only determined by the financial wealth and expected income, but also determined by the past consumption or habits. To introduce habits parameters into the classic life cycle model, it is suggested that individual's real consumption is between the optimal consumption and the former consumption without changing the utility function. Then the habits parameters' effect on the lifetime consumption and wealth is examined. The result also shows that habits may cause precautionary saving, and consumption may track the income.

 

2研究项目

主持[1] 国家自然科学基金青年项目,柔性资源下中间商的收益管理存量控制模型研究,2018/01-2020/12,项目负责人。

EMBA MBA MPAcc EDP
X

TOP