Considering the development of urban freight transport,this paper presents an operational strategy for freight transport based on the urban metro system.To improve the alignment between service capacity and transport ...Considering the development of urban freight transport,this paper presents an operational strategy for freight transport based on the urban metro system.To improve the alignment between service capacity and transport demand under passenger and freight co-transportation(PFCT),a mixed-integer nonlinear programming model(MINLP)is developed to simultaneously optimize the train timetable(TT)and rolling stock circulation plan(RSCP),with particular consideration of flexible train composition mode and skip-stop strategies.Moreover,by introducing allocation rules for passengers and freight,the tripartite interests of operators,passengers,and freight agents are synergistically considered in the proposed model.To facilitate the model solution,a variable neighborhood search(VNS)algorithm is designed for the generation of high-quality solutions in a reasonable computational time.Finally,based on a simplified example and empirical data from the Beijing Metro Yizhuang Line,several sets of numerical examples are implemented to validate the applicability and effectiveness of the model and the approach.展开更多
Trains are prone to delays and deviations from train operation plans during their operation because of internal or external disturbances. Delays may develop into operational conflicts between adjacent trains as a resu...Trains are prone to delays and deviations from train operation plans during their operation because of internal or external disturbances. Delays may develop into operational conflicts between adjacent trains as a result of delay propagation, which may disturb the arrangement of the train operation plan and threaten the operational safety of trains. Therefore, reliable conflict prediction results can be valuable references for dispatchers in making more efficient train operation adjustments when conflicts occur. In contrast to the traditional approach to conflict prediction that involves introducing random disturbances, this study addresses the issue of the fuzzification of time intervals in a train timetable based on historical statistics and the modeling of a high-speed railway train timetable based on the concept of a timed Petri net. To measure conflict prediction results more comprehensively, we divided conflicts into potential conflicts and certain conflicts and defined the judgment conditions for both. Two evaluation indexes, one for the deviation of a single train and one for the possibility of conflicts between adjacent train operations, were developed using a formalized computation method. Based on the temporal fuzzy reasoning method, with some adjustment, a new conflict prediction method is proposed, and the results of a simulation example for two scenarios are presented. The results prove that conflict prediction after fuzzy processing of the time intervals of a train timetable is more reliable and practical and can provide helpful information for use in train operation adjustment, train timetable improvement, and other purposes.展开更多
Unexpected delays in train operations can cause a cascade of negative consequences in a high-speed railway system.In such cases,train timetables need to be rescheduled.However,timely and efficient train timetable resc...Unexpected delays in train operations can cause a cascade of negative consequences in a high-speed railway system.In such cases,train timetables need to be rescheduled.However,timely and efficient train timetable rescheduling is still a challenging problem due to its modeling difficulties and low optimization efficiency.This paper presents a Transformer-based macroscopic regulation approach which consists of two stages including Transformer-based modeling and policy-based decisionmaking.Firstly,the relationship between various train schedules and operations is described by creating a macroscopic model with the Transformer,providing the better understanding of overall operation in the high-speed railway system.Then,a policy-based approach is used to solve a continuous decision problem after macro-modeling for fast convergence.Extensive experiments on various delay scenarios are conducted.The results demonstrate the effectiveness of the proposed method in comparison to other popular methods.展开更多
According to the pathological process of ischemic apoplexy, which involves its onset and development, this paper expounds the great significance of adopting various active and effective measures within the therapeutic...According to the pathological process of ischemic apoplexy, which involves its onset and development, this paper expounds the great significance of adopting various active and effective measures within the therapeutic timetable for favorable prognosis and improvement of apoplexy. The author’s viewpoints differ from the conventional thinking towards the management of apoplexy, stressing super early intervention with acupuncture.展开更多
The rapid growth of passenger flow in urban rail transit has led to great service pressures for metro companies in organizing train services to provide higher transportation capacities in order to satisfy passengers&#...The rapid growth of passenger flow in urban rail transit has led to great service pressures for metro companies in organizing train services to provide higher transportation capacities in order to satisfy passengers' travel demand, especially on those metro lines with insufficient rolling stock. In order to cope with high passenger flow service pressure, a mixed integer nonlinear programming(MINLP) model is proposed to optimize the line plan, timetable and rolling stock circulation simultaneously, to reduce the number of rolling stocks and increase the number of full-length services. A two-step algorithm strategy is proposed. In the first stage, the train timetable is optimized under the assumption that all the train services are the full-length services. In the second stage, the rolling stock plan is optimized based on the timetable optimized in the first stage. To ensure a feasible rolling stock circulation, certain full-length services are shortened to the short-length services due to the limited number of rolling stocks. Numerical experiments are performed based on the real-life data of Shanghai Metro Line 8. Results show that the proposed method can efficiently optimize the timetable and rolling stock circulation of the whole operation day. The optimized results are beneficial for both the service and the operational costs.展开更多
Purpose-This study aims to improve the passenger accessibility of passenger demands in the end-ofoperation period.Design/methodology/approach-A mixed integer nonlinear programming model for last train timetable optimi...Purpose-This study aims to improve the passenger accessibility of passenger demands in the end-ofoperation period.Design/methodology/approach-A mixed integer nonlinear programming model for last train timetable optimization of the metro was proposed considering the constraints such as the maximum headway,the minimum headway and the latest end-of-operation time.The objective of the model is to maximize the number of reachable passengers in the end-of-operation period.A solution method based on a preset train service is proposed,which significantly reduces the variables of deciding train services in the original model and reformulates it into a mixed integer linear programming model.Findings-The results of the case study of Wuhan Metro show that the solution method can obtain highquality solutions in a shorter time;and the shorter the time interval of passenger flow data,the more obvious the advantage of solution speed;after optimization,the number of passengers reaching the destination among the passengers who need to take the last train during the end-of-operation period can be increased by 10%.Originality/value-Existing research results only consider the passengers who take the last train.Compared with previous research,considering the overall passenger demand during the end-of-operation period can make more passengers arrive at their destination.Appropriately delaying the end-of-operation time can increase the proportion of passengers who can reach the destination in the metro network,but due to the decrease in passenger demand,postponing the end-of-operation time has a bottleneck in increasing the proportion of passengers who can reach the destination.展开更多
This paper presents a parallel composite local search algorithm based on multiple search neighborhoods to solve a special kind of timetable problem. The new algorithm can also effectively solve those problems that can...This paper presents a parallel composite local search algorithm based on multiple search neighborhoods to solve a special kind of timetable problem. The new algorithm can also effectively solve those problems that can be solved by general local search algorithms. Experimental results show that the new algorithm can generate better solutions than general local search algorithms.展开更多
Purpose–This paper aims to propose a train timetable rescheduling(TTR)approach from the perspective of multi-train tracking optimization based on the mutual spatiotemporal information in the high-speed railway signal...Purpose–This paper aims to propose a train timetable rescheduling(TTR)approach from the perspective of multi-train tracking optimization based on the mutual spatiotemporal information in the high-speed railway signaling system.Design/methodology/approach–Firstly,a single-train trajectory optimization(STTO)model is constructed based on train dynamics and operating conditions.The train kinematics parameters,including acceleration,speed and time at each position,are calculated to predict the arrival times in the train timetable.A STTO algorithm is developed to optimize a single-train time-efficient driving strategy.Then,a TTR approach based on multi-train tracking optimization(TTR-MTTO)is proposed with mutual information.The constraints of temporary speed restriction(TSR)and end of authority are decoupled to calculate the tracking trajectory of the backward tracking train.The multi-train trajectories at each position are optimized to generate a timeefficient train timetable.Findings–The numerical experiment is performed on the Beijing-Tianjin high-speed railway line and CR400AF.The STTO algorithm predicts the train’s planned arrival time to calculate the total train delay(TTD).As for the TSR scenario,the proposed TTR-MTTO can reduce TTD by 60.60%compared with the traditional TTR approach with dispatchers’experience.Moreover,TTR-MTTO can optimize a time-efficient train timetable to help dispatchers reschedule trains more reasonably.Originality/value–With the cooperative relationship and mutual information between train rescheduling and control,the proposed TTR-MTTO approach can automatically generate a time-efficient train timetable to reduce the total train delay and the work intensity of dispatchers.展开更多
This paper investigates the robust graph coloring problem with application to a kind of examination timetabling by using the matrix semi-tensor product, and presents a number of new results and algorithms. First, usin...This paper investigates the robust graph coloring problem with application to a kind of examination timetabling by using the matrix semi-tensor product, and presents a number of new results and algorithms. First, using the matrix semi-tensor product, the robust graph coloring is expressed into a kind of optimization problem taking in an algebraic form of matrices, based on which an algorithm is designed to find all the most robust coloring schemes for any simple graph. Second, an equivalent problem of robust graph coloring is studied, and a necessary and sufficient condition is proposed, from which a new algorithm to find all the most robust coloring schemes is established. Third, a kind of examination timetabling is discussed by using the obtained results, and a method to design a practicable timetabling scheme is presented. Finally, the effectiveness of the results/algorithms presented in this paper is shown by two illustrative examples.展开更多
The strong non-deterministic polynomial-hard( NP-hard)character of job shop scheduling problem( JSSP) has been acknowledged widely and it becomes stronger when attaches the nowait constraint,which widely exists in man...The strong non-deterministic polynomial-hard( NP-hard)character of job shop scheduling problem( JSSP) has been acknowledged widely and it becomes stronger when attaches the nowait constraint,which widely exists in many production processes,such as chemistry process, metallurgical process. However,compared with the massive research on traditional job shop problem,little attention has been paid on the no-wait constraint.Therefore,in this paper, we have dealt with this problem by decomposing it into two sub-problems, the timetabling and sequencing problems,in traditional frame work. A new efficient combined non-order timetabling method,coordinated with objective of total tardiness,is proposed for the timetabling problems. As for the sequencing one,we have presented a modified complete local search with memory combined by crossover operator and distance counting. The entire algorithm was tested on well-known benchmark problems and compared with several existing algorithms.Computational experiments showed that our proposed algorithm performed both effectively and efficiently.展开更多
The distributed event-triggered optimization problem for multiple nonholonomic robots has been studied to minimize the global battery energy consumption. Each robot possesses its own cost function which depends on the...The distributed event-triggered optimization problem for multiple nonholonomic robots has been studied to minimize the global battery energy consumption. Each robot possesses its own cost function which depends on the state of the hand position and represents battery energy consumption. By coordinate transformation, the dynamics of the hand positions can be formulated into two groups of first-order integrators. Then the distributed event-triggered optimization algorithm is designed such that the states of robots' hand positions exponentially converge to the optimizer of the global cost function.Meanwhile, the velocity and orientation of each robot are ensured to reach zero and a certain constant, respectively. Moreover, the inter-execution time is lower bounded and the Zeno behavior is therefore naturally avoided. Numerical simulations show the effectiveness of the proposed algorithm.展开更多
University timetabling problems are a yearly challenging task and are faced repeatedly each semester.The problems are considered nonpolynomial time(NP)and combinatorial optimization problems(COP),which means that they...University timetabling problems are a yearly challenging task and are faced repeatedly each semester.The problems are considered nonpolynomial time(NP)and combinatorial optimization problems(COP),which means that they can be solved through optimization algorithms to produce the aspired optimal timetable.Several techniques have been used to solve university timetabling problems,and most of them use optimization techniques.This paper provides a comprehensive review of the most recent studies dealing with concepts,methodologies,optimization,benchmarks,and open issues of university timetabling problems.The comprehensive review starts by presenting the essence of university timetabling as NP-COP,defining and clarifying the two formed classes of university timetabling:University Course Timetabling and University Examination Timetabling,illustrating the adopted algorithms for solving such a problem,elaborating the university timetabling constraints to be considered achieving the optimal timetable,and explaining how to analyze and measure the performance of the optimization algorithms by demonstrating the commonly used benchmark datasets for the evaluation.It is noted that meta-heuristic methodologies are widely used in the literature.Additionally,recently,multi-objective optimization has been increasingly used in solving such a problem that can identify robust university timetabling solutions.Finally,trends and future directions in university timetabling problems are provided.This paper provides good information for students,researchers,and specialists interested in this area of research.The challenges and possibilities for future research prospects are also explored.展开更多
This paper presents two optimization methods for solving the passenger train timetabling problem to minimize the total delay time in the single track railway networks. The goal of the train timetable problem is to det...This paper presents two optimization methods for solving the passenger train timetabling problem to minimize the total delay time in the single track railway networks. The goal of the train timetable problem is to determine departure and arrival times to or from each station in order to prevent collisions between trains and effective utilization of resources. The two proposed methods are based on integration of a simulation and an optimization method to simulate train traffic flow and generate near optimal train timetable under realistic con- straints including stops for track maintenance and praying. The first proposed method integrates a cellular automata （CA） simulation model with genetic algorithm optimiza- tion method. In the second proposed approach, a CA simulation model combines with dynamically dimensioned search optimization method. The proposed models are applied to hypothetical case study to demonstrate the merit of them. The Islamic Republic of Iran Railways （IRIR） data and regulations have been used to optimize train timetable. The results show the first method is more effi- cient than the second method to obtain near optimal train timetabling.展开更多
Job shop scheduling has become the basis and core of advanced manufacturing technology. Various differences exist between academic research and practical production. The majority of previous researches on job shop sch...Job shop scheduling has become the basis and core of advanced manufacturing technology. Various differences exist between academic research and practical production. The majority of previous researches on job shop scheduling problem (JSSP)describe the basic production environment, which have a single objective and limited constraints. However,a practical process of production is characterized by having multiple objectives,no-wait constraint,and limited storage. Thus this research focused on multiobjective,no-wait JSSP. To analyze the problem,it was further divided into two sub-problems, namely, sequencing and timetabling. Hybrid non-order strategy and modified complete local search with memory were used to solve each problem individually. A Pareto-based strategy for performing fitness assessment was presented in this study. Various experiments on benchmark problems proved the feasibility and effectiveness of the proposed algorithm.展开更多
基金supported by the Beijing Natural Science Foundation(9252012)the National Natural Science Foundation of China(72371015,72288101,72431002,and 72161010)Key Laboratory of Railway Industry on Plateau Railway Transportation Intelligent Management and Control(GYYSHZ2301)。
文摘Considering the development of urban freight transport,this paper presents an operational strategy for freight transport based on the urban metro system.To improve the alignment between service capacity and transport demand under passenger and freight co-transportation(PFCT),a mixed-integer nonlinear programming model(MINLP)is developed to simultaneously optimize the train timetable(TT)and rolling stock circulation plan(RSCP),with particular consideration of flexible train composition mode and skip-stop strategies.Moreover,by introducing allocation rules for passengers and freight,the tripartite interests of operators,passengers,and freight agents are synergistically considered in the proposed model.To facilitate the model solution,a variable neighborhood search(VNS)algorithm is designed for the generation of high-quality solutions in a reasonable computational time.Finally,based on a simplified example and empirical data from the Beijing Metro Yizhuang Line,several sets of numerical examples are implemented to validate the applicability and effectiveness of the model and the approach.
文摘Trains are prone to delays and deviations from train operation plans during their operation because of internal or external disturbances. Delays may develop into operational conflicts between adjacent trains as a result of delay propagation, which may disturb the arrangement of the train operation plan and threaten the operational safety of trains. Therefore, reliable conflict prediction results can be valuable references for dispatchers in making more efficient train operation adjustments when conflicts occur. In contrast to the traditional approach to conflict prediction that involves introducing random disturbances, this study addresses the issue of the fuzzification of time intervals in a train timetable based on historical statistics and the modeling of a high-speed railway train timetable based on the concept of a timed Petri net. To measure conflict prediction results more comprehensively, we divided conflicts into potential conflicts and certain conflicts and defined the judgment conditions for both. Two evaluation indexes, one for the deviation of a single train and one for the possibility of conflicts between adjacent train operations, were developed using a formalized computation method. Based on the temporal fuzzy reasoning method, with some adjustment, a new conflict prediction method is proposed, and the results of a simulation example for two scenarios are presented. The results prove that conflict prediction after fuzzy processing of the time intervals of a train timetable is more reliable and practical and can provide helpful information for use in train operation adjustment, train timetable improvement, and other purposes.
基金supported partially by the National Natural Science Foundation of China(61790573,61790575)the Center of National Railway Intelligent Transportation System Engineering and Technology(RITS2019KF03)+3 种基金China Academy of Railway Sciences Corporation LimitedChina Railway Project(N2019G020)China Railway Project(L2022X002)the Key Project of Science and Technology Research Plan of China Academy of Railway Sciences Group Co.Ltd.(2022YJ326)。
文摘Unexpected delays in train operations can cause a cascade of negative consequences in a high-speed railway system.In such cases,train timetables need to be rescheduled.However,timely and efficient train timetable rescheduling is still a challenging problem due to its modeling difficulties and low optimization efficiency.This paper presents a Transformer-based macroscopic regulation approach which consists of two stages including Transformer-based modeling and policy-based decisionmaking.Firstly,the relationship between various train schedules and operations is described by creating a macroscopic model with the Transformer,providing the better understanding of overall operation in the high-speed railway system.Then,a policy-based approach is used to solve a continuous decision problem after macro-modeling for fast convergence.Extensive experiments on various delay scenarios are conducted.The results demonstrate the effectiveness of the proposed method in comparison to other popular methods.
文摘According to the pathological process of ischemic apoplexy, which involves its onset and development, this paper expounds the great significance of adopting various active and effective measures within the therapeutic timetable for favorable prognosis and improvement of apoplexy. The author’s viewpoints differ from the conventional thinking towards the management of apoplexy, stressing super early intervention with acupuncture.
基金Sponsored by the National Key R&D Program of China (Grant No.2021YFB1600100)。
文摘The rapid growth of passenger flow in urban rail transit has led to great service pressures for metro companies in organizing train services to provide higher transportation capacities in order to satisfy passengers' travel demand, especially on those metro lines with insufficient rolling stock. In order to cope with high passenger flow service pressure, a mixed integer nonlinear programming(MINLP) model is proposed to optimize the line plan, timetable and rolling stock circulation simultaneously, to reduce the number of rolling stocks and increase the number of full-length services. A two-step algorithm strategy is proposed. In the first stage, the train timetable is optimized under the assumption that all the train services are the full-length services. In the second stage, the rolling stock plan is optimized based on the timetable optimized in the first stage. To ensure a feasible rolling stock circulation, certain full-length services are shortened to the short-length services due to the limited number of rolling stocks. Numerical experiments are performed based on the real-life data of Shanghai Metro Line 8. Results show that the proposed method can efficiently optimize the timetable and rolling stock circulation of the whole operation day. The optimized results are beneficial for both the service and the operational costs.
基金supported by Talents Funds for Basic Scientific Research Business Expenses of Central Colleges and Universities (Grant No.2021RC228)Special Funds for Basic Scientific Research Business Expenses of Central Colleges and Universities (Grant No.2021YJS103).
文摘Purpose-This study aims to improve the passenger accessibility of passenger demands in the end-ofoperation period.Design/methodology/approach-A mixed integer nonlinear programming model for last train timetable optimization of the metro was proposed considering the constraints such as the maximum headway,the minimum headway and the latest end-of-operation time.The objective of the model is to maximize the number of reachable passengers in the end-of-operation period.A solution method based on a preset train service is proposed,which significantly reduces the variables of deciding train services in the original model and reformulates it into a mixed integer linear programming model.Findings-The results of the case study of Wuhan Metro show that the solution method can obtain highquality solutions in a shorter time;and the shorter the time interval of passenger flow data,the more obvious the advantage of solution speed;after optimization,the number of passengers reaching the destination among the passengers who need to take the last train during the end-of-operation period can be increased by 10%.Originality/value-Existing research results only consider the passengers who take the last train.Compared with previous research,considering the overall passenger demand during the end-of-operation period can make more passengers arrive at their destination.Appropriately delaying the end-of-operation time can increase the proportion of passengers who can reach the destination in the metro network,but due to the decrease in passenger demand,postponing the end-of-operation time has a bottleneck in increasing the proportion of passengers who can reach the destination.
文摘This paper presents a parallel composite local search algorithm based on multiple search neighborhoods to solve a special kind of timetable problem. The new algorithm can also effectively solve those problems that can be solved by general local search algorithms. Experimental results show that the new algorithm can generate better solutions than general local search algorithms.
基金This research was jointly supported by the National Natural Science Foundation of China[Grant 62203468]the Young Elite Scientist Sponsorship Program by China Association for Science and Technology(CAST)[Grant 2022QNRC001]+1 种基金the Technological Research and Development Program of China Railway Corporation Limited[Grant K2021X001]by the Foundation of China Academy of Railway Sciences Corporation Limited[Grant 2021YJ043].On behalf all authors,the corresponding author states that there is no conflict of interest.
文摘Purpose–This paper aims to propose a train timetable rescheduling(TTR)approach from the perspective of multi-train tracking optimization based on the mutual spatiotemporal information in the high-speed railway signaling system.Design/methodology/approach–Firstly,a single-train trajectory optimization(STTO)model is constructed based on train dynamics and operating conditions.The train kinematics parameters,including acceleration,speed and time at each position,are calculated to predict the arrival times in the train timetable.A STTO algorithm is developed to optimize a single-train time-efficient driving strategy.Then,a TTR approach based on multi-train tracking optimization(TTR-MTTO)is proposed with mutual information.The constraints of temporary speed restriction(TSR)and end of authority are decoupled to calculate the tracking trajectory of the backward tracking train.The multi-train trajectories at each position are optimized to generate a timeefficient train timetable.Findings–The numerical experiment is performed on the Beijing-Tianjin high-speed railway line and CR400AF.The STTO algorithm predicts the train’s planned arrival time to calculate the total train delay(TTD).As for the TSR scenario,the proposed TTR-MTTO can reduce TTD by 60.60%compared with the traditional TTR approach with dispatchers’experience.Moreover,TTR-MTTO can optimize a time-efficient train timetable to help dispatchers reschedule trains more reasonably.Originality/value–With the cooperative relationship and mutual information between train rescheduling and control,the proposed TTR-MTTO approach can automatically generate a time-efficient train timetable to reduce the total train delay and the work intensity of dispatchers.
基金This work was supported by the National Natural Science Foundation of China （Nos. G61374065, G61034007, G61374002） the Fund for the Taishan Scholar Project of Shandong Province, the Natural Science Foundation of Shandong Province （No. ZR2010FM013） the Scientific Research and Development Project of Shandong Provincial Education Department （No. J11LA01 ）
文摘This paper investigates the robust graph coloring problem with application to a kind of examination timetabling by using the matrix semi-tensor product, and presents a number of new results and algorithms. First, using the matrix semi-tensor product, the robust graph coloring is expressed into a kind of optimization problem taking in an algebraic form of matrices, based on which an algorithm is designed to find all the most robust coloring schemes for any simple graph. Second, an equivalent problem of robust graph coloring is studied, and a necessary and sufficient condition is proposed, from which a new algorithm to find all the most robust coloring schemes is established. Third, a kind of examination timetabling is discussed by using the obtained results, and a method to design a practicable timetabling scheme is presented. Finally, the effectiveness of the results/algorithms presented in this paper is shown by two illustrative examples.
基金National Natural Science Foundations of China(Nos.61174040,61104178)Shanghai Commission of Science and Technology,China(No.12JC1403400)the Fundamental Research Funds for the Central Universities,China
文摘The strong non-deterministic polynomial-hard( NP-hard)character of job shop scheduling problem( JSSP) has been acknowledged widely and it becomes stronger when attaches the nowait constraint,which widely exists in many production processes,such as chemistry process, metallurgical process. However,compared with the massive research on traditional job shop problem,little attention has been paid on the no-wait constraint.Therefore,in this paper, we have dealt with this problem by decomposing it into two sub-problems, the timetabling and sequencing problems,in traditional frame work. A new efficient combined non-order timetabling method,coordinated with objective of total tardiness,is proposed for the timetabling problems. As for the sequencing one,we have presented a modified complete local search with memory combined by crossover operator and distance counting. The entire algorithm was tested on well-known benchmark problems and compared with several existing algorithms.Computational experiments showed that our proposed algorithm performed both effectively and efficiently.
基金supported by the National Natural Science Foundation of China(Grant No.11701138)the Natural Science Foundation of Hebei Province,China(Grant Nos.F2017202009 and F2018202075)
文摘The distributed event-triggered optimization problem for multiple nonholonomic robots has been studied to minimize the global battery energy consumption. Each robot possesses its own cost function which depends on the state of the hand position and represents battery energy consumption. By coordinate transformation, the dynamics of the hand positions can be formulated into two groups of first-order integrators. Then the distributed event-triggered optimization algorithm is designed such that the states of robots' hand positions exponentially converge to the optimizer of the global cost function.Meanwhile, the velocity and orientation of each robot are ensured to reach zero and a certain constant, respectively. Moreover, the inter-execution time is lower bounded and the Zeno behavior is therefore naturally avoided. Numerical simulations show the effectiveness of the proposed algorithm.
基金This research work was supported by the University Malaysia Sabah,Malaysia.
文摘University timetabling problems are a yearly challenging task and are faced repeatedly each semester.The problems are considered nonpolynomial time(NP)and combinatorial optimization problems(COP),which means that they can be solved through optimization algorithms to produce the aspired optimal timetable.Several techniques have been used to solve university timetabling problems,and most of them use optimization techniques.This paper provides a comprehensive review of the most recent studies dealing with concepts,methodologies,optimization,benchmarks,and open issues of university timetabling problems.The comprehensive review starts by presenting the essence of university timetabling as NP-COP,defining and clarifying the two formed classes of university timetabling:University Course Timetabling and University Examination Timetabling,illustrating the adopted algorithms for solving such a problem,elaborating the university timetabling constraints to be considered achieving the optimal timetable,and explaining how to analyze and measure the performance of the optimization algorithms by demonstrating the commonly used benchmark datasets for the evaluation.It is noted that meta-heuristic methodologies are widely used in the literature.Additionally,recently,multi-objective optimization has been increasingly used in solving such a problem that can identify robust university timetabling solutions.Finally,trends and future directions in university timetabling problems are provided.This paper provides good information for students,researchers,and specialists interested in this area of research.The challenges and possibilities for future research prospects are also explored.
文摘This paper presents two optimization methods for solving the passenger train timetabling problem to minimize the total delay time in the single track railway networks. The goal of the train timetable problem is to determine departure and arrival times to or from each station in order to prevent collisions between trains and effective utilization of resources. The two proposed methods are based on integration of a simulation and an optimization method to simulate train traffic flow and generate near optimal train timetable under realistic con- straints including stops for track maintenance and praying. The first proposed method integrates a cellular automata （CA） simulation model with genetic algorithm optimiza- tion method. In the second proposed approach, a CA simulation model combines with dynamically dimensioned search optimization method. The proposed models are applied to hypothetical case study to demonstrate the merit of them. The Islamic Republic of Iran Railways （IRIR） data and regulations have been used to optimize train timetable. The results show the first method is more effi- cient than the second method to obtain near optimal train timetabling.
基金National Natural Science Foundations of China(Nos.61174040,61573144,11304200)Shanghai Commission of Science and Technology,China(No.12JC1403400)+1 种基金Shanghai Municipal Education Commission for Training Young Teachers,China(No.ZZSDJ15031)Shanghai Teaching and Reforming Experimental Undergraduate Majors Construction Program,China
文摘Job shop scheduling has become the basis and core of advanced manufacturing technology. Various differences exist between academic research and practical production. The majority of previous researches on job shop scheduling problem (JSSP)describe the basic production environment, which have a single objective and limited constraints. However,a practical process of production is characterized by having multiple objectives,no-wait constraint,and limited storage. Thus this research focused on multiobjective,no-wait JSSP. To analyze the problem,it was further divided into two sub-problems, namely, sequencing and timetabling. Hybrid non-order strategy and modified complete local search with memory were used to solve each problem individually. A Pareto-based strategy for performing fitness assessment was presented in this study. Various experiments on benchmark problems proved the feasibility and effectiveness of the proposed algorithm.
