The common phenomenon of uneven headway in bus service is explored based on the automatic vehicle location （AVL） data of Route 2 in Yichun City of Jiangxi province from 6：00 to 9：00 in the morning. The headway reg...The common phenomenon of uneven headway in bus service is explored based on the automatic vehicle location （AVL） data of Route 2 in Yichun City of Jiangxi province from 6：00 to 9：00 in the morning. The headway regularity of two stages 6： 00--7：00 and 7： 00--9：00 is comparatively analyzed, and it is found that both the traffic conditions and the passenger demand affect headway regularity. A bus arrival model, which assumes that the dwell time of a bus is linear in headway, is built to probe the effect of scheduled headway, and the model is simulated by Matlab. The simulation results reveal that the departure intervals and fluctuations affect headway regularity. Longer intervals and less fluctuation mean higher regularity of headway. And, the fluctuation has a more obvious influence on headway regularity than the interval. Controlling the fluctuations of scheduled headway can effectively raise the regularity of headway and improve the level of public transport service.展开更多
Based on the gap acceptance theory, the mixed traffic flow composed of r representative types of vehicles 1, 2,…, r vehicles is analyzed with probability theory. Capacity model of the minor mixed traffic flow ...Based on the gap acceptance theory, the mixed traffic flow composed of r representative types of vehicles 1, 2,…, r vehicles is analyzed with probability theory. Capacity model of the minor mixed traffic flow crossing m major lanes with M3 distributed headway on the unsignalized intersection is set up, and it is an extension of capacity model for one minor lane vehicle type crossing one major lane traffic flow.展开更多
To reduce vehicle emissions in road networks, a new signal coordination algorithm based on approximate dynamic programming （ADP） is developed for two intersections. Taking the Jetta car as an experimental vehicle, f...To reduce vehicle emissions in road networks, a new signal coordination algorithm based on approximate dynamic programming （ADP） is developed for two intersections. Taking the Jetta car as an experimental vehicle, field tests are conducted in Changchun Street of Changchun city and vehicle emission factors in complete stop and uniform speed states are collected. Queue lengths and signal light colors of approach lanes are selected as state variables, and green switch plans are selected as decision variables of the system. Then the calculation model of the optimization index during the planning horizon is developed based on the basis function method of the ADP. The temporal-difference algorithm is employed to update the weighting factor vector of the approximate function. Simulations are conducted in Matlab and the results show that the established algorithm outperforms the conventional coordination algorithm in reducing vehicle emissions by 8.2%. Sensitive analysis of the planning horizon length on the evaluation index is also conducted and the statistical results show that the optimal length of the planning horizon is directly proportional to the traffic load.展开更多
A real-life milk run system designing problem of an engine manufacturer adopted JIT(just-in-time)production is studied.In the process of milk run system planning and design,the supply base is identified and a supplier...A real-life milk run system designing problem of an engine manufacturer adopted JIT(just-in-time)production is studied.In the process of milk run system planning and design,the supply base is identified and a supplier site map is plotted for an arrangement of routes on which parts are periodically collected in a JIT manner from many scattered suppliers.With unit load designing,vehicle choosing and fleet sizing,pickup routing,vehicle assigning and scheduling problems are studied.Among these problems,a CVRP problem is identified and formulated as the key optimization in designing this milk run system,and it is solved through an optimization process.This tactical planning and optimization process gives a good solution to the real problem,and may shed light on the planning of similar systems.展开更多
Considering that the vehicle routing problem （VRP） with many extended features is widely used in actual life, such as multi-depot, heterogeneous types of vehicles, customer service priority and time windows etc., a ...Considering that the vehicle routing problem （VRP） with many extended features is widely used in actual life, such as multi-depot, heterogeneous types of vehicles, customer service priority and time windows etc., a mathematical model for multi-depot heterogeneous vehicle routing problem with soft time windows （MDHVRPSTW） is established. An improved ant colony optimization （IACO） is proposed for solving this model. First, MDHVRPSTW is transferred into different groups according to the nearest principle, and then the initial route is constructed by the scanning algorithm （SA）. Secondly, genetic operators are introduced, and crossover probability and mutation probability are adaptively adjusted in order to improve the global search ability of the algorithm. Moreover, the smooth mechanism is used to improve the performance of the ant colony optimization （ACO）. Finally, the 3-opt strategy is used to improve the local search ability. The proposed IACO was tested on three new instances that were generated randomly. The experimental results show that IACO is superior to the other three existing algorithms in terms of convergence speed and solution quality. Thus, the proposed method is effective and feasible, and the proposed model is meaningful.展开更多
Dynamic exclusive pickup and delivery problem with time windows (DE-PDPTW), aspecial dynamic vehicle scheduling problem, is proposed. Its mathematical description is given andits static properties are analyzed, and th...Dynamic exclusive pickup and delivery problem with time windows (DE-PDPTW), aspecial dynamic vehicle scheduling problem, is proposed. Its mathematical description is given andits static properties are analyzed, and then the problem is simplified asthe asymmetrical travelingsalesman problem with time windows. The rolling horizon scheduling algorithm (RHSA) to solve thisdynamic problem is proposed. By the rolling of time horizon, the RHSA can adapt to the problem'sdynamic change and reduce the computation time by dealing with only part of the customers in eachrolling time horizon. Then, its three factors, the current customer window, the scheduling of thecurrent customer window and the rolling strategy, are analyzed. The test results demonstrate theeffectiveness of the RHSA to solve the dynamic vehicle scheduling problem.展开更多
基金The National Basic Research Program of China(973 Program)(No.2012CB725402)the National Natural Science Foundation of China(No.50978057)Program of Scientific Innovation Research of College Graduate in Jiangsu Province(No.CXLX12_0108)
文摘The common phenomenon of uneven headway in bus service is explored based on the automatic vehicle location （AVL） data of Route 2 in Yichun City of Jiangxi province from 6：00 to 9：00 in the morning. The headway regularity of two stages 6： 00--7：00 and 7： 00--9：00 is comparatively analyzed, and it is found that both the traffic conditions and the passenger demand affect headway regularity. A bus arrival model, which assumes that the dwell time of a bus is linear in headway, is built to probe the effect of scheduled headway, and the model is simulated by Matlab. The simulation results reveal that the departure intervals and fluctuations affect headway regularity. Longer intervals and less fluctuation mean higher regularity of headway. And, the fluctuation has a more obvious influence on headway regularity than the interval. Controlling the fluctuations of scheduled headway can effectively raise the regularity of headway and improve the level of public transport service.
文摘Based on the gap acceptance theory, the mixed traffic flow composed of r representative types of vehicles 1, 2,…, r vehicles is analyzed with probability theory. Capacity model of the minor mixed traffic flow crossing m major lanes with M3 distributed headway on the unsignalized intersection is set up, and it is an extension of capacity model for one minor lane vehicle type crossing one major lane traffic flow.
基金The National High Technology Research and Development Program of China (863 Program ) (No. 2011AA110304 )the National Natural Science Foundation of China (No. 50908100)
文摘To reduce vehicle emissions in road networks, a new signal coordination algorithm based on approximate dynamic programming （ADP） is developed for two intersections. Taking the Jetta car as an experimental vehicle, field tests are conducted in Changchun Street of Changchun city and vehicle emission factors in complete stop and uniform speed states are collected. Queue lengths and signal light colors of approach lanes are selected as state variables, and green switch plans are selected as decision variables of the system. Then the calculation model of the optimization index during the planning horizon is developed based on the basis function method of the ADP. The temporal-difference algorithm is employed to update the weighting factor vector of the approximate function. Simulations are conducted in Matlab and the results show that the established algorithm outperforms the conventional coordination algorithm in reducing vehicle emissions by 8.2%. Sensitive analysis of the planning horizon length on the evaluation index is also conducted and the statistical results show that the optimal length of the planning horizon is directly proportional to the traffic load.
基金The National Key Technology R&D Program of China during the 11th Five-Year Plan Period(No.2006BAH02A06)
文摘A real-life milk run system designing problem of an engine manufacturer adopted JIT(just-in-time)production is studied.In the process of milk run system planning and design,the supply base is identified and a supplier site map is plotted for an arrangement of routes on which parts are periodically collected in a JIT manner from many scattered suppliers.With unit load designing,vehicle choosing and fleet sizing,pickup routing,vehicle assigning and scheduling problems are studied.Among these problems,a CVRP problem is identified and formulated as the key optimization in designing this milk run system,and it is solved through an optimization process.This tactical planning and optimization process gives a good solution to the real problem,and may shed light on the planning of similar systems.
基金The National Natural Science Foundation of China(No.61074147)the Natural Science Foundation of Guangdong Province(No.S2011010005059)+2 种基金the Foundation of Enterprise-University-Research Institute Cooperation from Guangdong Province and Ministry of Education of China(No.2012B091000171,2011B090400460)the Science and Technology Program of Guangdong Province(No.2012B050600028)the Science and Technology Program of Huadu District,Guangzhou(No.HD14ZD001)
文摘Considering that the vehicle routing problem （VRP） with many extended features is widely used in actual life, such as multi-depot, heterogeneous types of vehicles, customer service priority and time windows etc., a mathematical model for multi-depot heterogeneous vehicle routing problem with soft time windows （MDHVRPSTW） is established. An improved ant colony optimization （IACO） is proposed for solving this model. First, MDHVRPSTW is transferred into different groups according to the nearest principle, and then the initial route is constructed by the scanning algorithm （SA）. Secondly, genetic operators are introduced, and crossover probability and mutation probability are adaptively adjusted in order to improve the global search ability of the algorithm. Moreover, the smooth mechanism is used to improve the performance of the ant colony optimization （ACO）. Finally, the 3-opt strategy is used to improve the local search ability. The proposed IACO was tested on three new instances that were generated randomly. The experimental results show that IACO is superior to the other three existing algorithms in terms of convergence speed and solution quality. Thus, the proposed method is effective and feasible, and the proposed model is meaningful.
文摘Dynamic exclusive pickup and delivery problem with time windows (DE-PDPTW), aspecial dynamic vehicle scheduling problem, is proposed. Its mathematical description is given andits static properties are analyzed, and then the problem is simplified asthe asymmetrical travelingsalesman problem with time windows. The rolling horizon scheduling algorithm (RHSA) to solve thisdynamic problem is proposed. By the rolling of time horizon, the RHSA can adapt to the problem'sdynamic change and reduce the computation time by dealing with only part of the customers in eachrolling time horizon. Then, its three factors, the current customer window, the scheduling of thecurrent customer window and the rolling strategy, are analyzed. The test results demonstrate theeffectiveness of the RHSA to solve the dynamic vehicle scheduling problem.
