An Incentive Dynamic Programming Method for the Optimization of Scholarship Assignment
Scholarship assignment is an operations management problem confronting university administrators, which is traditionally solved based on administrators’ personal experiences. This paper proposes an incentive method inspired by dynamic programming to replace the traditional decision-making process in...
Saved in:
| Main Authors: | , , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Wiley
2018-01-01
|
| Series: | Discrete Dynamics in Nature and Society |
| Online Access: | http://dx.doi.org/10.1155/2018/5206131 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1849687028180975616 |
|---|---|
| author | Di Huang Yu Gu Hans Wang Zhiyuan Liu Jun Chen |
| author_facet | Di Huang Yu Gu Hans Wang Zhiyuan Liu Jun Chen |
| author_sort | Di Huang |
| collection | DOAJ |
| description | Scholarship assignment is an operations management problem confronting university administrators, which is traditionally solved based on administrators’ personal experiences. This paper proposes an incentive method inspired by dynamic programming to replace the traditional decision-making process in the scholarship assignment. The objective is to find the optimal scholarship assignment scheme with the highest equity while accounting for both the practical constraints and the equity requirement. Moreover, with the proposed method, the scholarship assignment avoids time- and energy-consuming application processes conducted by students. A solution algorithm is used to find feasible assignment schemes by iteratively solving a series of knapsack subproblems based on dynamic programming and adjusting the monetary value of a unit score. The optimal assignment scheme can then be screened out by applying the Gini coefficient for quantifying the equity of each feasible scheme. A numerical case is investigated to illustrate the applicability of the proposed method and solution algorithm. The results indicate that the proposed method is an efficient tool to assign scholarships to students with consideration of the equity. |
| format | Article |
| id | doaj-art-019f9535351d420eab178ba6ebf95e4d |
| institution | DOAJ |
| issn | 1026-0226 1607-887X |
| language | English |
| publishDate | 2018-01-01 |
| publisher | Wiley |
| record_format | Article |
| series | Discrete Dynamics in Nature and Society |
| spelling | doaj-art-019f9535351d420eab178ba6ebf95e4d2025-08-20T03:22:28ZengWileyDiscrete Dynamics in Nature and Society1026-02261607-887X2018-01-01201810.1155/2018/52061315206131An Incentive Dynamic Programming Method for the Optimization of Scholarship AssignmentDi Huang0Yu Gu1Hans Wang2Zhiyuan Liu3Jun Chen4Jiangsu Key Laboratory of Urban ITS, Jiangsu Province Collaborative Innovation Center of Modern Urban Traffic Technologies, School of Transportation, Southeast University, ChinaJiangsu Key Laboratory of Urban ITS, Jiangsu Province Collaborative Innovation Center of Modern Urban Traffic Technologies, School of Transportation, Southeast University, ChinaDepartment of Logistics & Maritime Studies, The Hong Kong Polytechnic University, Kowloon, Hong KongJiangsu Key Laboratory of Urban ITS, Jiangsu Province Collaborative Innovation Center of Modern Urban Traffic Technologies, School of Transportation, Southeast University, ChinaJiangsu Key Laboratory of Urban ITS, Jiangsu Province Collaborative Innovation Center of Modern Urban Traffic Technologies, School of Transportation, Southeast University, ChinaScholarship assignment is an operations management problem confronting university administrators, which is traditionally solved based on administrators’ personal experiences. This paper proposes an incentive method inspired by dynamic programming to replace the traditional decision-making process in the scholarship assignment. The objective is to find the optimal scholarship assignment scheme with the highest equity while accounting for both the practical constraints and the equity requirement. Moreover, with the proposed method, the scholarship assignment avoids time- and energy-consuming application processes conducted by students. A solution algorithm is used to find feasible assignment schemes by iteratively solving a series of knapsack subproblems based on dynamic programming and adjusting the monetary value of a unit score. The optimal assignment scheme can then be screened out by applying the Gini coefficient for quantifying the equity of each feasible scheme. A numerical case is investigated to illustrate the applicability of the proposed method and solution algorithm. The results indicate that the proposed method is an efficient tool to assign scholarships to students with consideration of the equity.http://dx.doi.org/10.1155/2018/5206131 |
| spellingShingle | Di Huang Yu Gu Hans Wang Zhiyuan Liu Jun Chen An Incentive Dynamic Programming Method for the Optimization of Scholarship Assignment Discrete Dynamics in Nature and Society |
| title | An Incentive Dynamic Programming Method for the Optimization of Scholarship Assignment |
| title_full | An Incentive Dynamic Programming Method for the Optimization of Scholarship Assignment |
| title_fullStr | An Incentive Dynamic Programming Method for the Optimization of Scholarship Assignment |
| title_full_unstemmed | An Incentive Dynamic Programming Method for the Optimization of Scholarship Assignment |
| title_short | An Incentive Dynamic Programming Method for the Optimization of Scholarship Assignment |
| title_sort | incentive dynamic programming method for the optimization of scholarship assignment |
| url | http://dx.doi.org/10.1155/2018/5206131 |
| work_keys_str_mv | AT dihuang anincentivedynamicprogrammingmethodfortheoptimizationofscholarshipassignment AT yugu anincentivedynamicprogrammingmethodfortheoptimizationofscholarshipassignment AT hanswang anincentivedynamicprogrammingmethodfortheoptimizationofscholarshipassignment AT zhiyuanliu anincentivedynamicprogrammingmethodfortheoptimizationofscholarshipassignment AT junchen anincentivedynamicprogrammingmethodfortheoptimizationofscholarshipassignment AT dihuang incentivedynamicprogrammingmethodfortheoptimizationofscholarshipassignment AT yugu incentivedynamicprogrammingmethodfortheoptimizationofscholarshipassignment AT hanswang incentivedynamicprogrammingmethodfortheoptimizationofscholarshipassignment AT zhiyuanliu incentivedynamicprogrammingmethodfortheoptimizationofscholarshipassignment AT junchen incentivedynamicprogrammingmethodfortheoptimizationofscholarshipassignment |