With the continuous improvement of China's economic level, the demand for talents is gradually increasing. College graduates are facing great employment difficulties. Some colleges and universities carry out schoo...With the continuous improvement of China's economic level, the demand for talents is gradually increasing. College graduates are facing great employment difficulties. Some colleges and universities carry out school-enterprise cooperation and pay attention to cultivating students' practical ability. Some schools also start with the construction of their own employment guidance team to ensure students' professionalism in receiving employment guidance education. The employment guidance class is helpful to cultivate the students' innovative consciousness and make the employment market in our country have a better development prospect. Therefore, based on the current employment situation of college students and the difficulties and problems existing in the construction of college employment guidance team, this paper puts forward practical and effective strategies for the school to cultivate students' innovative ideas. In order to make the employment guidance curriculum education in colleges and universities have better teaching effect, improve teachers' professionalism and professionalism in a timely manner, and provide correct theoretical and practical guidance for the employment of college students. By earnestly implementing the relevant national employment policies, every college graduate can be guaranteed to find a job of his own choosing.展开更多
This paper extends the single-task n-Vehicle Exploration Problem to Multitask n-Vehicle Exploration Problem （MTNVEP）, by combining n-Vehicle Exploration Problem with Job Scheduling Problem. At first, the authors pro...This paper extends the single-task n-Vehicle Exploration Problem to Multitask n-Vehicle Exploration Problem （MTNVEP）, by combining n-Vehicle Exploration Problem with Job Scheduling Problem. At first, the authors prove that MTNVEP is NP-hard for fixed number of tasks, and it is strongly NP-hard for general number of tasks. Then they propose an improved accurate algorithm with computing time O（n3n）, which is better than O（n!） as n becomes sufficiently large. Moreover, four heuristic algorithms are proposed. Effectiveness of the heuristic algorithms is illustrated by experiments at last.展开更多
The research of efficient computation focus on special structures of NP-hard problem instances and request providing reasonable computing cost of instances in polynomial time. Based on the theory of combinatorial opti...The research of efficient computation focus on special structures of NP-hard problem instances and request providing reasonable computing cost of instances in polynomial time. Based on the theory of combinatorial optimization, by studying the clusters partition and the clusters complexity measurement in Nvehicle exploration problem, we build a frame of efficient computation and provide an application of tractability for NP-hard problem. Three N-vehicle examples show that when we use efficient computation mechanism on N-vehicle, through polynomial steps of tractability analysis, decision makers can get the computing cost of searching optimal solution before practical calculation.展开更多
Finding the accurate solution for N-vehicle exploration problem is NP-hard in strong sense.In this paper,authors build a linear mixed integer programming model for N-vehicle exploration problem based on its properties...Finding the accurate solution for N-vehicle exploration problem is NP-hard in strong sense.In this paper,authors build a linear mixed integer programming model for N-vehicle exploration problem based on its properties.The model is then proved equivalent to the original problem.Given the model,one can apply the already existed methods and algorithms for mixed integer linear programming on N-vehicle exploration problem,which helps to enrich methods for solving N-vehicle exploration problem.展开更多
We discuss a variant of the multi-task n-vehicle exploration problem. Instead of requiring an optimal permutation of vehicles in every group, the new problem requires all vehicles in a group to arrive at the same dest...We discuss a variant of the multi-task n-vehicle exploration problem. Instead of requiring an optimal permutation of vehicles in every group, the new problem requires all vehicles in a group to arrive at the same destination. Given n tasks with assigned consume-time and profit, it may also be viewed as a maximization of every processor＇s average profit. Further, we propose a new kind of partition problem in fractional form and analyze its computational complexity. By regarding fractional partition as a special case, we prove that the average profit maximization problem is NP-hard when the number of processors is fixed and it is strongly NP- hard in general. At last, a pseudo-polynomial time algorithm for the average profit maximization problem and the fractional partition problem is presented, using the idea of the pseudo-polynomial time algorithm for the classical partition problem.展开更多
The N-vehicle exploration problem(NVEP)is a nonlinear discrete scheduling problem,and the complexity status remains open.To our knowledge,there is no literature until now employing mixed integer linear programming(MIL...The N-vehicle exploration problem(NVEP)is a nonlinear discrete scheduling problem,and the complexity status remains open.To our knowledge,there is no literature until now employing mixed integer linear programming(MILP)technology to solve this problem except for Wang(J Oper Res Soc China 3(4):489–498,2015).However,they did not give numerical experiments since their model existed strictly inequalities and the number of constraints was up to O(n3),which was inefficient to solve practical problems.This paper establishes a more concise MILP model,where the number of constraints is just O(n2).Therefore,the existing efficient MILP algorithms can be used to solve NVEP.Secondly,we provide some properties of N-vehicle problem and give three methods for cutting plane construction,which can increase the solving speed significantly.Finally,a numerical experiment is provided to verify the effectiveness and robustness for different instances and scales of acceleration techniques.展开更多
文摘With the continuous improvement of China's economic level, the demand for talents is gradually increasing. College graduates are facing great employment difficulties. Some colleges and universities carry out school-enterprise cooperation and pay attention to cultivating students' practical ability. Some schools also start with the construction of their own employment guidance team to ensure students' professionalism in receiving employment guidance education. The employment guidance class is helpful to cultivate the students' innovative consciousness and make the employment market in our country have a better development prospect. Therefore, based on the current employment situation of college students and the difficulties and problems existing in the construction of college employment guidance team, this paper puts forward practical and effective strategies for the school to cultivate students' innovative ideas. In order to make the employment guidance curriculum education in colleges and universities have better teaching effect, improve teachers' professionalism and professionalism in a timely manner, and provide correct theoretical and practical guidance for the employment of college students. By earnestly implementing the relevant national employment policies, every college graduate can be guaranteed to find a job of his own choosing.
基金partly supported by Daqing Oilfield Company Project of PetroCHINA under Grant No.dqc- 2010-xdgl-ky-002Key Laboratory of Management,Decision and Information Systems,Chinese Academy of Sciences
文摘This paper extends the single-task n-Vehicle Exploration Problem to Multitask n-Vehicle Exploration Problem （MTNVEP）, by combining n-Vehicle Exploration Problem with Job Scheduling Problem. At first, the authors prove that MTNVEP is NP-hard for fixed number of tasks, and it is strongly NP-hard for general number of tasks. Then they propose an improved accurate algorithm with computing time O（n3n）, which is better than O（n!） as n becomes sufficiently large. Moreover, four heuristic algorithms are proposed. Effectiveness of the heuristic algorithms is illustrated by experiments at last.
基金Supported by Key Laboratory of Management,Decision and Information Systems,Chinese Academy of Science
文摘The research of efficient computation focus on special structures of NP-hard problem instances and request providing reasonable computing cost of instances in polynomial time. Based on the theory of combinatorial optimization, by studying the clusters partition and the clusters complexity measurement in Nvehicle exploration problem, we build a frame of efficient computation and provide an application of tractability for NP-hard problem. Three N-vehicle examples show that when we use efficient computation mechanism on N-vehicle, through polynomial steps of tractability analysis, decision makers can get the computing cost of searching optimal solution before practical calculation.
文摘Finding the accurate solution for N-vehicle exploration problem is NP-hard in strong sense.In this paper,authors build a linear mixed integer programming model for N-vehicle exploration problem based on its properties.The model is then proved equivalent to the original problem.Given the model,one can apply the already existed methods and algorithms for mixed integer linear programming on N-vehicle exploration problem,which helps to enrich methods for solving N-vehicle exploration problem.
基金Supported by Daqing oilfield company Project of PetroCHINA under Grant (dqc-2010-xdgl-ky-002)Key Laboratory of Management, Decision and Information Systems, Chinese Academy of SciencesBeijing Research Center of Urban System Engineering
文摘We discuss a variant of the multi-task n-vehicle exploration problem. Instead of requiring an optimal permutation of vehicles in every group, the new problem requires all vehicles in a group to arrive at the same destination. Given n tasks with assigned consume-time and profit, it may also be viewed as a maximization of every processor＇s average profit. Further, we propose a new kind of partition problem in fractional form and analyze its computational complexity. By regarding fractional partition as a special case, we prove that the average profit maximization problem is NP-hard when the number of processors is fixed and it is strongly NP- hard in general. At last, a pseudo-polynomial time algorithm for the average profit maximization problem and the fractional partition problem is presented, using the idea of the pseudo-polynomial time algorithm for the classical partition problem.
基金This work was supported by Key Laboratory of Management,Decision and Information Systems,Chinese Academy of Science.
文摘The N-vehicle exploration problem(NVEP)is a nonlinear discrete scheduling problem,and the complexity status remains open.To our knowledge,there is no literature until now employing mixed integer linear programming(MILP)technology to solve this problem except for Wang(J Oper Res Soc China 3(4):489–498,2015).However,they did not give numerical experiments since their model existed strictly inequalities and the number of constraints was up to O(n3),which was inefficient to solve practical problems.This paper establishes a more concise MILP model,where the number of constraints is just O(n2).Therefore,the existing efficient MILP algorithms can be used to solve NVEP.Secondly,we provide some properties of N-vehicle problem and give three methods for cutting plane construction,which can increase the solving speed significantly.Finally,a numerical experiment is provided to verify the effectiveness and robustness for different instances and scales of acceleration techniques.
