To adapt to the unique demand-supply features of accessory parking lots at passenger transport hubs,a mixed parking demand assignment method based on regression modeling is proposed.First,an optimal model aiming to mi...To adapt to the unique demand-supply features of accessory parking lots at passenger transport hubs,a mixed parking demand assignment method based on regression modeling is proposed.First,an optimal model aiming to minimize total time expenditure is constructed.It incorporates parking search time,walking time,and departure time,focusing on short-term parking features.Then,the information dimensions that the parking lot can obtain are evaluated,and three assignment strategies based on three types of regression models-linear regression(LR),extreme gradient boosting(XGBoost),and multilayer perceptron(MLP)-are proposed.A parking process simulation model is built using the traffic simulation package SUMO to facilitate data collection,model training,and case studies.Finally,the performance of the three strategies is com-pared,revealing that the XGBoost-based strategy performs the best in case parking lots,which reduces time expendi-ture by 29.3%and 37.2%,respectively,compared with the MLP-based strategy and LR-based strategy.This method offers diverse options for practical parking manage-ment.展开更多
笔者在中国文化背景下对生活定向测验(Life Orientation Test ;LOT)与其修订版(LOT-R)的维度进行验证.采用主成分分析结合平行分析保留主成分数目,同时采用验证性因素分析比较不同模型对生活定向测验及其修订版反应数据的拟合.大多数测...笔者在中国文化背景下对生活定向测验(Life Orientation Test ;LOT)与其修订版(LOT-R)的维度进行验证.采用主成分分析结合平行分析保留主成分数目,同时采用验证性因素分析比较不同模型对生活定向测验及其修订版反应数据的拟合.大多数测验形式都呈现出两个维度,违背了测验编制者假定的单维性,与西方大多数研究者的结果一致,但是得到的两个维度是有实质意义的还是由于项目形式造成的则很难确定.在传统的因素分析框架下很难解决生活定向测验的维度争议,未来的研究应该从项目反应的理想点过程出发对该测验的维度进行探索和验证.展开更多
In this paper we shall extend the paper [1] to a separate Taylor's Theorem with respect to a lot of centers, namely Newton's Theorem Of a lot of centers. From it we obtain the analogous results in the paper [2...In this paper we shall extend the paper [1] to a separate Taylor's Theorem with respect to a lot of centers, namely Newton's Theorem Of a lot of centers. From it we obtain the analogous results in the paper [2]. namely an interpolation formula of the difference of higher order. Finally we give their applications.展开更多
In flexible job-shop batch scheduling problem, the optimal lot-size of different process is not always the same because of different processing time and set-up time. Even for the same process of the same workpiece, th...In flexible job-shop batch scheduling problem, the optimal lot-size of different process is not always the same because of different processing time and set-up time. Even for the same process of the same workpiece, the choice of machine also affects the optimal lot-size. In addition, different choices of lot-size between the constrained processes will impact the manufacture efficiency. Considering that each process has its own appropriate lot-size, we put forward the concept of scheduling with lot-splitting based on process and set up the scheduling model of lot-splitting to critical path process as the core. The model could update the set of batch process and machine selection strategy dynamically to determine processing route and arrange proper lot-size for different processes, to achieve the purpose of optimizing the makespan and reducing the processing batches effectively. The experiment results show that, comparing with lot-splitting scheduling scheme based on workpiece, this model optimizes the makespan and improves the utilization efficiency of the machine. It also greatly decreases the machined batches （42%） and reduces the complexity of shop scheduling production management.展开更多
The capacitated lot sizing and scheduling problem that involves indetermining the production amounts and release dates for several items over a given planning horizonare given to meet dynamic order demand without incu...The capacitated lot sizing and scheduling problem that involves indetermining the production amounts and release dates for several items over a given planning horizonare given to meet dynamic order demand without incurring backloggings. The problem consideringovertime capacity is studied. The mathematical model is presented, and a genetic algorithm (GA)approach is developed to solve the problem. The initial solutions are generated after usingheuristic method. Capacity balancing procedure is employed to stipulate the feasibility of thesolutions. In addition, a technique based on Tabu search (TS) is inserted into the genetic algorithmdeal with the scheduled overtime and help the convergence of algorithm. Computational simulation isconducted to test the efficiency of the proposed hybrid approach, which turns out to improve boththe solution quality and execution speed.展开更多
Studies show that supply chain cooperation improves supply chain performance. However, it remains a challenge to develop and implement the realistic supply chain cooperation scheme. We investigate a two-echelon supply...Studies show that supply chain cooperation improves supply chain performance. However, it remains a challenge to develop and implement the realistic supply chain cooperation scheme. We investigate a two-echelon supply chain planning problem with capacity acquisition decision under asymmetric cost and demand information. A simple negotiation-based coordination mechanism is developed to synchronize production/order strategies of a supplier and a buyer. The coordination scheme shows how the supplier and the buyer modify their production and order policy in order to find a joint economic lot sizing plan, which saves the overall supply chain cost. The allocation of the cooperation benefit is determined by negotiation. Due to the complexity of the multiple periods, multiple level supply chain lot sizing with capacity decision, a heuristic algorithm is developed to find coordination solutions. Finally, the results of the numerical study indicate the performance of supply chain coordination scheme.展开更多
In order to solve the problem that the drivers can't find the optimal parking lot timely,a reservation based optimal parking lot recommendation model in Internet of Vehicle(IoV) environment is designed.Based on th...In order to solve the problem that the drivers can't find the optimal parking lot timely,a reservation based optimal parking lot recommendation model in Internet of Vehicle(IoV) environment is designed.Based on the users oriented parking information recommendation system,the model considers subjective demands of drivers comprehensively,makes a deeply analysis of the evaluation indicators.This recommendation model uses a phased selection method to calculate the optimal objective parking lot.The first stage is screening which based on the users' subjective parking demands;the second stage is processing the candidate parking lots through multiple attribute decision making.Simulation experiments show that this model can effectively solve the problems encountered in the process of finding optimal parking lot,save the driver's parking time and parking costs and also improve the overall utilization of parking facilities to ease the traffic congestion caused by vehicles parked patrol.展开更多
Unlike a traditional flowshop problem where a job is assumed to be indivisible, in the lot-streaming flowshop problem, a job is allowed to overlap its operations between successive machines by splitting it into a numb...Unlike a traditional flowshop problem where a job is assumed to be indivisible, in the lot-streaming flowshop problem, a job is allowed to overlap its operations between successive machines by splitting it into a number of smaller sub-lots and moving the completed portion of the sub-lots to downstream machine. In this way, the production is accelerated. This paper presents a discrete artificial bee colony （DABC） algorithm for a lot-streaming flowshop scheduling problem with total flowtime criterion. Unlike the basic ABC algorithm, the proposed DABC algorithm represents a solution as a discrete job permutation. An efficient initialization scheme based on the extended Nawaz-Enscore-Ham heuristic is utilized to produce an initial population with a certain level of quality and diversity. Employed and onlooker bees generate new solutions in their neighborhood, whereas scout bees generate new solutions by performing insert operator and swap operator to the best solution found so far. Moreover, a simple but effective local search is embedded in the algorithm to enhance local exploitation capability. A comparative experiment is carried out with the existing discrete particle swarm optimization, hybrid genetic algorithm, threshold accepting, simulated annealing and ant colony optimization algorithms based on a total of 160 randomly generated instances. The experimental results show that the proposed DABC algorithm is quite effective for the lot-streaming flowshop with total flowtime criterion in terms of searching quality, robustness and effectiveness. This research provides the references to the optimization research on lot-streaming flowshop.展开更多
基金The National Natural Science Foundation of China(No.52302388)the Natural Science Foundation of Jiangsu Province(No.BK20230853).
文摘To adapt to the unique demand-supply features of accessory parking lots at passenger transport hubs,a mixed parking demand assignment method based on regression modeling is proposed.First,an optimal model aiming to minimize total time expenditure is constructed.It incorporates parking search time,walking time,and departure time,focusing on short-term parking features.Then,the information dimensions that the parking lot can obtain are evaluated,and three assignment strategies based on three types of regression models-linear regression(LR),extreme gradient boosting(XGBoost),and multilayer perceptron(MLP)-are proposed.A parking process simulation model is built using the traffic simulation package SUMO to facilitate data collection,model training,and case studies.Finally,the performance of the three strategies is com-pared,revealing that the XGBoost-based strategy performs the best in case parking lots,which reduces time expendi-ture by 29.3%and 37.2%,respectively,compared with the MLP-based strategy and LR-based strategy.This method offers diverse options for practical parking manage-ment.
文摘笔者在中国文化背景下对生活定向测验(Life Orientation Test ;LOT)与其修订版(LOT-R)的维度进行验证.采用主成分分析结合平行分析保留主成分数目,同时采用验证性因素分析比较不同模型对生活定向测验及其修订版反应数据的拟合.大多数测验形式都呈现出两个维度,违背了测验编制者假定的单维性,与西方大多数研究者的结果一致,但是得到的两个维度是有实质意义的还是由于项目形式造成的则很难确定.在传统的因素分析框架下很难解决生活定向测验的维度争议,未来的研究应该从项目反应的理想点过程出发对该测验的维度进行探索和验证.
文摘In this paper we shall extend the paper [1] to a separate Taylor's Theorem with respect to a lot of centers, namely Newton's Theorem Of a lot of centers. From it we obtain the analogous results in the paper [2]. namely an interpolation formula of the difference of higher order. Finally we give their applications.
基金Supported by National Key Technology R&D Program(No.2013BAJ06B)
文摘In flexible job-shop batch scheduling problem, the optimal lot-size of different process is not always the same because of different processing time and set-up time. Even for the same process of the same workpiece, the choice of machine also affects the optimal lot-size. In addition, different choices of lot-size between the constrained processes will impact the manufacture efficiency. Considering that each process has its own appropriate lot-size, we put forward the concept of scheduling with lot-splitting based on process and set up the scheduling model of lot-splitting to critical path process as the core. The model could update the set of batch process and machine selection strategy dynamically to determine processing route and arrange proper lot-size for different processes, to achieve the purpose of optimizing the makespan and reducing the processing batches effectively. The experiment results show that, comparing with lot-splitting scheduling scheme based on workpiece, this model optimizes the makespan and improves the utilization efficiency of the machine. It also greatly decreases the machined batches （42%） and reduces the complexity of shop scheduling production management.
基金This project is supported by National Natural Science Foundation of China (No.70071017, No.60074011) the Open-lab of Manufacturing System Engineering, Xi'an Jiaotong University, China.
文摘The capacitated lot sizing and scheduling problem that involves indetermining the production amounts and release dates for several items over a given planning horizonare given to meet dynamic order demand without incurring backloggings. The problem consideringovertime capacity is studied. The mathematical model is presented, and a genetic algorithm (GA)approach is developed to solve the problem. The initial solutions are generated after usingheuristic method. Capacity balancing procedure is employed to stipulate the feasibility of thesolutions. In addition, a technique based on Tabu search (TS) is inserted into the genetic algorithmdeal with the scheduled overtime and help the convergence of algorithm. Computational simulation isconducted to test the efficiency of the proposed hybrid approach, which turns out to improve boththe solution quality and execution speed.
基金supported by the National Natural Science Foundation of China (70701008)
文摘Studies show that supply chain cooperation improves supply chain performance. However, it remains a challenge to develop and implement the realistic supply chain cooperation scheme. We investigate a two-echelon supply chain planning problem with capacity acquisition decision under asymmetric cost and demand information. A simple negotiation-based coordination mechanism is developed to synchronize production/order strategies of a supplier and a buyer. The coordination scheme shows how the supplier and the buyer modify their production and order policy in order to find a joint economic lot sizing plan, which saves the overall supply chain cost. The allocation of the cooperation benefit is determined by negotiation. Due to the complexity of the multiple periods, multiple level supply chain lot sizing with capacity decision, a heuristic algorithm is developed to find coordination solutions. Finally, the results of the numerical study indicate the performance of supply chain coordination scheme.
基金partially supported by the National Natural Science Foundation of China under Grants No.60903176the Provincial Natural Science Foundation of Shandong under Grants No.ZR2012FM010,No.ZR2010FQ028+1 种基金the Program for Youth science and technology starfund of Jinan No.TNK1108the Sub-Project of the National Key Technology R&D Program No.2012BAF12B07-3
文摘In order to solve the problem that the drivers can't find the optimal parking lot timely,a reservation based optimal parking lot recommendation model in Internet of Vehicle(IoV) environment is designed.Based on the users oriented parking information recommendation system,the model considers subjective demands of drivers comprehensively,makes a deeply analysis of the evaluation indicators.This recommendation model uses a phased selection method to calculate the optimal objective parking lot.The first stage is screening which based on the users' subjective parking demands;the second stage is processing the candidate parking lots through multiple attribute decision making.Simulation experiments show that this model can effectively solve the problems encountered in the process of finding optimal parking lot,save the driver's parking time and parking costs and also improve the overall utilization of parking facilities to ease the traffic congestion caused by vehicles parked patrol.
基金supported by National Natural Science Foundation of China (Grant Nos. 60973085, 61174187)National Hi-tech Research and Development Program of China (863 Program, Grant No. 2009AA044601)New Century Excellent Talents in University of China (Grant No. NCET-08-0232)
文摘Unlike a traditional flowshop problem where a job is assumed to be indivisible, in the lot-streaming flowshop problem, a job is allowed to overlap its operations between successive machines by splitting it into a number of smaller sub-lots and moving the completed portion of the sub-lots to downstream machine. In this way, the production is accelerated. This paper presents a discrete artificial bee colony （DABC） algorithm for a lot-streaming flowshop scheduling problem with total flowtime criterion. Unlike the basic ABC algorithm, the proposed DABC algorithm represents a solution as a discrete job permutation. An efficient initialization scheme based on the extended Nawaz-Enscore-Ham heuristic is utilized to produce an initial population with a certain level of quality and diversity. Employed and onlooker bees generate new solutions in their neighborhood, whereas scout bees generate new solutions by performing insert operator and swap operator to the best solution found so far. Moreover, a simple but effective local search is embedded in the algorithm to enhance local exploitation capability. A comparative experiment is carried out with the existing discrete particle swarm optimization, hybrid genetic algorithm, threshold accepting, simulated annealing and ant colony optimization algorithms based on a total of 160 randomly generated instances. The experimental results show that the proposed DABC algorithm is quite effective for the lot-streaming flowshop with total flowtime criterion in terms of searching quality, robustness and effectiveness. This research provides the references to the optimization research on lot-streaming flowshop.
