Dingwei Wang
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Dingwei Wang has a total of 18 co-authors. Here are the top co-authors by number of shared publications:
- Hongfeng Wang
College of Information Science and Engineering, Northeastern University, Shenyang 110819, China
3 shared publications - Chengyao Wang
Genome Institute, the First Affiliated Hospital of Xi'an Jiaotong University, Xi'an 710061, China
1 shared publication - Chunguang Chang
School of Management, Shenyang Jianzhu University, China
1 shared publication - Dazhi Wang
College of Information Science and Engineering Northeastern University Shenyang China
1 shared publication - Jianjiang Cui
Northeastern University, Shenyang, P.R. China
1 shared publication - Kai Leung Yung
Department of Industrial and Systems Engineering, The Hong Kong Polytechnic University, Hong Kong, China
1 shared publication
Latest Publications
- Open Access
- 20 April 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 8, 95390-95402
An Evolutionary Game Study of the Behavioral Management of Bid Evaluations in Reserve Auctions
Winner determination in current auctions is often performed separately by two groups: the technical expert group and the business expert group. In general, there is a strong negative correlation between technical and business attributes, and it will cause antagonistic feelings and noncooperative behaviors between the two groups under the premise of bounded rationality. First, this paper constructs a game model between the management department and experts and analyzes the conditions for achieving stable equilibrium solutions. Then, we analyze the evolutionary paths and the influencing factors of relevant behaviors based on evolutionary game theory, which reveals the influence from the individual to groups. Finally, to systematically and quantitatively study bid evaluation behaviors, a simulation system based on MATLAB GUI shows the influences on the evolutionary results as the initial conditions and decision parameters change. The study makes positive contributions to the management of bidding evaluations to improve the fairness of the bid evaluation mechanism.
- 20 April 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 8, 95390-95402
Open AccessAn Evolutionary Game Study of the Behavioral Management of Bid Evaluations in Reserve Auctions
Winner determination in current auctions is often performed separately by two groups: the technical expert group and the business expert group. In general, there is a strong negative correlation between technical and business attributes, and it will cause antagonistic feelings and noncooperative behaviors between the two groups under the premise of bounded rationality. First, this paper constructs a game model between the management department and experts and analyzes the conditions for achieving stable equilibrium solutions. Then, we analyze the evolutionary paths and the influencing factors of relevant behaviors based on evolutionary game theory, which reveals the influence from the individual to groups. Finally, to systematically and quantitatively study bid evaluation behaviors, a simulation system based on MATLAB GUI shows the influences on the evolutionary results as the initial conditions and decision parameters change. The study makes positive contributions to the management of bidding evaluations to improve the fairness of the bid evaluation mechanism.
- 1 June 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 2, 3770-3775
An auction-and-negotiation based procurement strategy for multiple splitable items
To solve the mismatch problem of supply and demand when purchasing multiple splitable items, a new procurement strategy is proposed based on the mechanism of auction and negotiation in this paper. In the proposed strategy, a candidate set of winning bidders is firstly determined by maximizing the expected procurement savings, and then their negotiation order is achieved according to the maximal negotiation benefits, and finally the negotiation termination condition of winning bidders is given in order to match the relationship of each item’s supply and demand. Numerical experiments show that the proposed procurement mechanism can deal with this splitable multi-item procurement problem effectively.
- 1 June 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 2, 3770-3775
An auction-and-negotiation based procurement strategy for multiple splitable items
To solve the mismatch problem of supply and demand when purchasing multiple splitable items, a new procurement strategy is proposed based on the mechanism of auction and negotiation in this paper. In the proposed strategy, a candidate set of winning bidders is firstly determined by maximizing the expected procurement savings, and then their negotiation order is achieved according to the maximal negotiation benefits, and finally the negotiation termination condition of winning bidders is given in order to match the relationship of each item’s supply and demand. Numerical experiments show that the proposed procurement mechanism can deal with this splitable multi-item procurement problem effectively.
- 1 July 2008
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 19489439,p. 2387-2391
An adaptive version of parallel MPSO with OpenMP for Uncapacitated Facility Location problem
As a consequence of globalization, facilitypsilas location selection has become a markedly complicated problem. This problem is one of the most difficult combinatorial NP-hard optimization problems. Historically, this kind of problems have been usually solved by linear programming or metaheuristics methods such as genetic algorithms (GA), simulated annealing (SA), particle swarm optimization (PSO) and tabu searches with optima or near-optima. In this paper, an adaptive parallel multi-population particle swarm optimization (MPSO) algorithm with OpenMP is presented for the Uncapacitated Facility Location problem (UFLP), The linear inertia weight was introduced which made an ideal balance between the capability of global exploration and the capability of local exploitation. The aim of this paper is to implement an adaptive version of parallel MPSO method augmented with OpenMP directives and then applied it to the several benchmark suites offered by OR library. It is shown that dramatic improvement in terns of CPU times is achieved with competitive results by using a parallel programming model in a multi-core desktop.
- 1 July 2008
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 19489439,p. 2387-2391
An adaptive version of parallel MPSO with OpenMP for Uncapacitated Facility Location problem
As a consequence of globalization, facilitypsilas location selection has become a markedly complicated problem. This problem is one of the most difficult combinatorial NP-hard optimization problems. Historically, this kind of problems have been usually solved by linear programming or metaheuristics methods such as genetic algorithms (GA), simulated annealing (SA), particle swarm optimization (PSO) and tabu searches with optima or near-optima. In this paper, an adaptive parallel multi-population particle swarm optimization (MPSO) algorithm with OpenMP is presented for the Uncapacitated Facility Location problem (UFLP), The linear inertia weight was introduced which made an ideal balance between the capability of global exploration and the capability of local exploitation. The aim of this paper is to implement an adaptive version of parallel MPSO method augmented with OpenMP directives and then applied it to the several benchmark suites offered by OR library. It is shown that dramatic improvement in terns of CPU times is achieved with competitive results by using a parallel programming model in a multi-core desktop.
- 1 January 2006
- Published by Springer Nature
- p. 836-844
An Improved Primal-Dual Genetic Algorithm for Optimization in Dynamic Environments
- 1 January 2006
- Published by Springer Nature
- p. 836-844
An Improved Primal-Dual Genetic Algorithm for Optimization in Dynamic Environments
- 22 February 2005
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 4, 2128-2133
Research on case adaptation techniques in case-based reasoning
With the purpose to improve the validity of case adaptation in CBR (case-based reasoning), firstly, the main case adaptation approaches in CBR are summarized. Then, taking the rough set theory as the start, the applicable qualifications of main case adaptation types are proposed and proved. Furthermore, the case adaptation algorithms are designed, and a general framework of case adaptation is proposed. Finally, the adaptation technique is taken into application, and the instances of dynamic scheduling problem in steel making are solved. The simulation result is verified that the technique is valid and flexible in solving complex case adaptation problems.
- 22 February 2005
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 4, 2128-2133
Research on case adaptation techniques in case-based reasoning
With the purpose to improve the validity of case adaptation in CBR (case-based reasoning), firstly, the main case adaptation approaches in CBR are summarized. Then, taking the rough set theory as the start, the applicable qualifications of main case adaptation types are proposed and proved. Furthermore, the case adaptation algorithms are designed, and a general framework of case adaptation is proposed. Finally, the adaptation technique is taken into application, and the instances of dynamic scheduling problem in steel making are solved. The simulation result is verified that the technique is valid and flexible in solving complex case adaptation problems.
- 1 July 1999
- Published by Elsevier in IFAC Proceedings Volumes
- Vol. 32 (2) , 225-230
A simulation study of kanban and CONWIP production control systems in a cold rolling plant
- 1 July 1999
- Published by Elsevier in IFAC Proceedings Volumes
- Vol. 32 (2) , 225-230
A simulation study of kanban and CONWIP production control systems in a cold rolling plant
- 1 July 1999
- Published by Elsevier in IFAC Proceedings Volumes
- Vol. 32 (2) , 313-317
Run-based heuristic for scheduling grouped jobs in parallel machines
- 1 July 1999
- Published by Elsevier in IFAC Proceedings Volumes
- Vol. 32 (2) , 313-317
Run-based heuristic for scheduling grouped jobs in parallel machines
- Open Access
- 1 September 1998
- Published by Elsevier in IFAC Proceedings Volumes
- Vol. 31 (25) , 169-172
The Study and Development of Production Synchronized Scheduling System of Minimizing the Cost Flow on Steelmaking-Hot Rolling
- 1 September 1998
- Published by Elsevier in IFAC Proceedings Volumes
- Vol. 31 (25) , 169-172
Open AccessThe Study and Development of Production Synchronized Scheduling System of Minimizing the Cost Flow on Steelmaking-Hot Rolling
- 1 January 1990
- Published by Elsevier
- p. 171-175
A HUMAN–COMPUTER INTERACTION APPROACH FOR PARAMETER ESTIMATION OF MULTI-FUEL BOILERS
- 1 January 1990
- Published by Elsevier
- p. 171-175
A HUMAN–COMPUTER INTERACTION APPROACH FOR PARAMETER ESTIMATION OF MULTI-FUEL BOILERS