Given the challenges of manufacturing resource sharing and competition in the modern manufacturing industry,the coordinated scheduling problem of parallel machine production and transportation is investigated.The prob...Given the challenges of manufacturing resource sharing and competition in the modern manufacturing industry,the coordinated scheduling problem of parallel machine production and transportation is investigated.The problem takes into account the coordination of production and transportation before production as well as the disparities in machine spatial position and performance.A non-cooperative game model is established,considering the competition and self-interest behavior of jobs from different customers for machine resources.The job from different customers is mapped to the players in the game model,the corresponding optional processing machine and location are mapped to the strategy set,and the makespan of the job is mapped to the payoff.Then the solution of the scheduling model is transformed into the Nash equilibrium of the non-cooperative game model.A Nash equilibrium solution algorithm based on the genetic algorithm(NEGA)is designed,and the effective solution of approximate Nash equilibrium for the game model is realized.The fitness function,single-point crossover operator,and mutation operator are derived from the non-cooperative game model’s characteristics and the definition of Nash equilibrium.Rules are also designed to avoid the generation of invalid offspring chromosomes.The effectiveness of the proposed algorithm is demonstrated through numerical experiments of various sizes.Compared with other algorithms such as heuristic algorithms(FCFS,SPT,and LPT),the simulated annealing algorithm(SA),and the particle swarm optimization algorithm(PSO),experimental results show that the proposed NE-GA algorithm has obvious performance advantages.展开更多
A two-agent production and transportation coordinated scheduling problem in a single-machine environment is suggested to compete for one machine from different downstream production links or various consumers.The jobs...A two-agent production and transportation coordinated scheduling problem in a single-machine environment is suggested to compete for one machine from different downstream production links or various consumers.The jobs of two agents compete for the processing position on a machine,and after the pro-cessed,they compete for the transport position on a transport vehicle to be trans-ported to two agents.The two agents have different objective functions.The objective function of the first agent is the sum of the makespan and the total trans-portation time,whereas the objective function of the second agent is the sum of the total completion time and the total transportation time.Given the competition between two agents for machine resources and transportation resources,a non-cooperative game model with agents as game players is established.The job pro-cessing position and transportation position corresponding to the two agents are mapped as strategies,and the corresponding objective function is the utility func-tion.To solve the game model,an approximate Nash equilibrium solution algo-rithm based on an improved genetic algorithm(NE-IGA)is proposed.The genetic operation based on processing sequence and transportation sequence,as well as the fitness function based on Nash equilibrium definition,are designed based on the features of the two-agent production and transportation coordination scheduling problem.The effectiveness of the proposed algorithm is demonstrated through numerical experiments of various sizes.When compared to heuristic rules such as the Longest Processing Time first(LPT)and the Shortest Processing Time first(SPT),the objective function values of the two agents are reduced by 4.3%and 2.6% on average.展开更多
The amount of perishable products transported via the existing intermodal freight networks has significantly increased over the last years. Perishable products tend to decay due to a wide range of external factors. Su...The amount of perishable products transported via the existing intermodal freight networks has significantly increased over the last years. Perishable products tend to decay due to a wide range of external factors. Supply chain operations mismanagement causes waste of substantial volumes of perishable products every year. The heretofore proposed mathematical models optimize certain supply chain processes and reduce decay of perishable products, but primarily deal with local production, inventory, distribution, and retailing of perishable products. However, significant quantities of perishable products are delivered from different continents, which shall increase the total transportation time and decay potential of perishable products as compared to local deliveries. This paper proposes a novel optimization model to design the intermodal freight network for both local and long-haul deliveries of perishable products. The objective of the model aims to minimize the total cost associated with transportation and decay of perishable products. A set of piecewise approximations are applied to linearize the non-linear decay function for each perishable product type. CPLEX is used to solve the problem. Comprehensive numerical experiments are conducted using the intermodal freight network for import of the seafood perishable products to the United States to draw important managerial insights. Results demonstrate that increasing product decay cost may significantly change the design of intermodal freight network for transport of perishable products, cause modal shifts and affect the total transportation time and associated costs.展开更多
In this paper,a new algorithm relaxation-strategy-based modification branchand-bound algorithm is developed for a type of solving the minimum cost transportationproduction problem with concave production costs.The maj...In this paper,a new algorithm relaxation-strategy-based modification branchand-bound algorithm is developed for a type of solving the minimum cost transportationproduction problem with concave production costs.The major improvement of the proposed new method is that modification algorithm reinforces the bounding operation using a Lagrangian relaxation,which is a concave minimization but obtains a tighter bound than the usual linear programming relaxation.Some computational results are included.Computation results indicate that the algorithm can solve fairly large scale problems.展开更多
This study reviews productivity growth in the five major transportation industries in the United States (airline, truck, rail, pipeline, and water) and the pooled transportation industry from 2004 to 2011. We measure ...This study reviews productivity growth in the five major transportation industries in the United States (airline, truck, rail, pipeline, and water) and the pooled transportation industry from 2004 to 2011. We measure the average productivity for these eight years by state in each transportation industry and the annual average productivity by transportation industry. The major findings are that the U.S. transportation industry shows strong and positive productivity growth except that in the years of the global financial crisis in 2007, 2008, and 2010, and among the five transportation industries, the rail and water sectors show the highest productivity growth in 2011.展开更多
ZTE Corporation (ZTE),a leading global provider of telecommunications equipment and network solutions,shined at the Mobile World Congress (MWC) 2009 by rolling out its next generation intelligent Converged Transport
Phosphatidylglycerol (PG) an important membrane phospholipid required for the synthesis of diphos-phatidylglycerol (DPG) commonly known as cardiolipin (CL) was identified in the fraction of endo-plasmic reticulum (ER)...Phosphatidylglycerol (PG) an important membrane phospholipid required for the synthesis of diphos-phatidylglycerol (DPG) commonly known as cardiolipin (CL) was identified in the fraction of endo-plasmic reticulum (ER)-derived transport vesicles which had no affinity for Golgi. The vesicles were produced in the presence of Brefeldin A (BFA), the agent known to inhibit ER-Golgi transport, and found to display affinity to mitochondria. The analysis revealed that their cargo was not containing proteins that are transported to Golgi, and that their membrane was free of phosphatidylinositol (PI) and ceramides (Cer). The incubation of PG-containing transport vesicles with mitochondria afforded incorporation of their membrane into the Outer Mito-chondrial Membrane (OMM) and formation of lyso-phosphatidylglycerol (LPG). In turn, upon further incubation with fresh transport active cytosol, the mitochondrial LPG was converted to PG. The results of analysis of the OMM, Inner Mitochondrial Mem-brane (IMM) and Inner Mitochondrial Space Components (IMSC) strongly suggest that PG-containing transport vesicles deliver nuclear DNA translation products to the IMSC and thus facilitate CL synthesis in the IMM. In summary, our studies provide evidence that ER-generated PG-enriched transport vesicles represent the general pathway for restitution of mitochondrial membranes and the delivery of nuclear DNA translation products that generate CL, and thus sustain the mitochondrial matrix CL-dependent metabolic reactions.展开更多
Contamination between batches in multi-products pipeline transport is studied. The influences of convection and diffusion on the contamination are studied in detail. Diffusion equations, which are mainly controlled by...Contamination between batches in multi-products pipeline transport is studied. The influences of convection and diffusion on the contamination are studied in detail. Diffusion equations, which are mainly controlled by convection, are developed under turbulent pipe flow. The diffusion equation is separated into a pure convection equation and a pure diffusion equation which are solved by characteristics method and finite difference method respectively to obtain numerical solutions. The results of numerical computation explain the forming and developing of contamination very well.展开更多
This study uses a simulation-based approach to investigate the impact of delivery delays due to constraints on transport capacity, transit speed, and routing efficiencies on an economy with various levels of interdepe...This study uses a simulation-based approach to investigate the impact of delivery delays due to constraints on transport capacity, transit speed, and routing efficiencies on an economy with various levels of interdependency among firms. The simulation uses object-oriented programming to create specialized production, consumption, and transportation classes. A set of objects from each class is distributed randomly on a 2D plane. A road network is then established between fixed objects using Prim’s MST (Minimum Spanning Tree) algorithm, followed by construction of an all-pair shortest path matrix using the Floyd Warshall algorithm. A genetic algorithm-based vehicle routing problem solver employs the all-pair shortest path matrix to best plan multiple pickup and delivery orders. Production units utilize economic order quantities (EOQ) and reorder points (ROP) to manage inventory levels. Hicksian and Marshallian demand functions are utilized by consumption units to maximize personal utility. The transport capacity, transit speed, routing efficiency, and level of interdependence serve as 4 factors in the simulation, each assigned 3 distinct levels. Federov’s exchange algorithm is used to generate an orthogonal array to reduce the number of combination replays from 3<sup>4</sup> to just 9. The simulation results of a 9-run orthogonal array on an economy with 6 mining facilities, 12 industries, 8 market centers, and 8 transport hubs show that the level of firm interdependence, followed by transit speed, has the most significant impact on economic productivity. The principal component analysis (PCA) indicates that interdependence and transit speed can explain 90.27% of the variance in the data. According to the findings of this research, a dependable and efficient regional transportation network among various types of industries is critical for regional economic development.展开更多
基金supported in part by the Project of Liaoning BaiQianWan Talents ProgramunderGrand No.2021921089the Science Research Foundation of EducationalDepartment of Liaoning Province under Grand No.LJKQZ2021057 and WJGD2020001the Key Program of Social Science Planning Foundation of Liaoning Province under Grant L21AGL017.
文摘Given the challenges of manufacturing resource sharing and competition in the modern manufacturing industry,the coordinated scheduling problem of parallel machine production and transportation is investigated.The problem takes into account the coordination of production and transportation before production as well as the disparities in machine spatial position and performance.A non-cooperative game model is established,considering the competition and self-interest behavior of jobs from different customers for machine resources.The job from different customers is mapped to the players in the game model,the corresponding optional processing machine and location are mapped to the strategy set,and the makespan of the job is mapped to the payoff.Then the solution of the scheduling model is transformed into the Nash equilibrium of the non-cooperative game model.A Nash equilibrium solution algorithm based on the genetic algorithm(NEGA)is designed,and the effective solution of approximate Nash equilibrium for the game model is realized.The fitness function,single-point crossover operator,and mutation operator are derived from the non-cooperative game model’s characteristics and the definition of Nash equilibrium.Rules are also designed to avoid the generation of invalid offspring chromosomes.The effectiveness of the proposed algorithm is demonstrated through numerical experiments of various sizes.Compared with other algorithms such as heuristic algorithms(FCFS,SPT,and LPT),the simulated annealing algorithm(SA),and the particle swarm optimization algorithm(PSO),experimental results show that the proposed NE-GA algorithm has obvious performance advantages.
基金This work was supported in part by the Project of Liaoning BaiQianWan Talents Program under Grand No.2021921089the Science Research Foundation of Educational Department of Liaoning Province under Grand No.LJKQZ2021057 and WJGD2020001+2 种基金the Key Program of Social Science Planning Foundation of Liaoning Province under Grant L21AGL017the special project of SUT on serving local economic and social development decision-making under Grant FWDFGD2021019the“Double First-Class”Construction Project in Liaoning Province under Grant ZDZRGD2020037.
文摘A two-agent production and transportation coordinated scheduling problem in a single-machine environment is suggested to compete for one machine from different downstream production links or various consumers.The jobs of two agents compete for the processing position on a machine,and after the pro-cessed,they compete for the transport position on a transport vehicle to be trans-ported to two agents.The two agents have different objective functions.The objective function of the first agent is the sum of the makespan and the total trans-portation time,whereas the objective function of the second agent is the sum of the total completion time and the total transportation time.Given the competition between two agents for machine resources and transportation resources,a non-cooperative game model with agents as game players is established.The job pro-cessing position and transportation position corresponding to the two agents are mapped as strategies,and the corresponding objective function is the utility func-tion.To solve the game model,an approximate Nash equilibrium solution algo-rithm based on an improved genetic algorithm(NE-IGA)is proposed.The genetic operation based on processing sequence and transportation sequence,as well as the fitness function based on Nash equilibrium definition,are designed based on the features of the two-agent production and transportation coordination scheduling problem.The effectiveness of the proposed algorithm is demonstrated through numerical experiments of various sizes.When compared to heuristic rules such as the Longest Processing Time first(LPT)and the Shortest Processing Time first(SPT),the objective function values of the two agents are reduced by 4.3%and 2.6% on average.
文摘The amount of perishable products transported via the existing intermodal freight networks has significantly increased over the last years. Perishable products tend to decay due to a wide range of external factors. Supply chain operations mismanagement causes waste of substantial volumes of perishable products every year. The heretofore proposed mathematical models optimize certain supply chain processes and reduce decay of perishable products, but primarily deal with local production, inventory, distribution, and retailing of perishable products. However, significant quantities of perishable products are delivered from different continents, which shall increase the total transportation time and decay potential of perishable products as compared to local deliveries. This paper proposes a novel optimization model to design the intermodal freight network for both local and long-haul deliveries of perishable products. The objective of the model aims to minimize the total cost associated with transportation and decay of perishable products. A set of piecewise approximations are applied to linearize the non-linear decay function for each perishable product type. CPLEX is used to solve the problem. Comprehensive numerical experiments are conducted using the intermodal freight network for import of the seafood perishable products to the United States to draw important managerial insights. Results demonstrate that increasing product decay cost may significantly change the design of intermodal freight network for transport of perishable products, cause modal shifts and affect the total transportation time and associated costs.
基金Foundation item: Supported by the National Natural Science Foundation of China(10726016) Supported by the Hubei Province Natural Science Foundation Project(T200809 D200613002)
文摘In this paper,a new algorithm relaxation-strategy-based modification branchand-bound algorithm is developed for a type of solving the minimum cost transportationproduction problem with concave production costs.The major improvement of the proposed new method is that modification algorithm reinforces the bounding operation using a Lagrangian relaxation,which is a concave minimization but obtains a tighter bound than the usual linear programming relaxation.Some computational results are included.Computation results indicate that the algorithm can solve fairly large scale problems.
文摘This study reviews productivity growth in the five major transportation industries in the United States (airline, truck, rail, pipeline, and water) and the pooled transportation industry from 2004 to 2011. We measure the average productivity for these eight years by state in each transportation industry and the annual average productivity by transportation industry. The major findings are that the U.S. transportation industry shows strong and positive productivity growth except that in the years of the global financial crisis in 2007, 2008, and 2010, and among the five transportation industries, the rail and water sectors show the highest productivity growth in 2011.
文摘ZTE Corporation (ZTE),a leading global provider of telecommunications equipment and network solutions,shined at the Mobile World Congress (MWC) 2009 by rolling out its next generation intelligent Converged Transport
文摘Phosphatidylglycerol (PG) an important membrane phospholipid required for the synthesis of diphos-phatidylglycerol (DPG) commonly known as cardiolipin (CL) was identified in the fraction of endo-plasmic reticulum (ER)-derived transport vesicles which had no affinity for Golgi. The vesicles were produced in the presence of Brefeldin A (BFA), the agent known to inhibit ER-Golgi transport, and found to display affinity to mitochondria. The analysis revealed that their cargo was not containing proteins that are transported to Golgi, and that their membrane was free of phosphatidylinositol (PI) and ceramides (Cer). The incubation of PG-containing transport vesicles with mitochondria afforded incorporation of their membrane into the Outer Mito-chondrial Membrane (OMM) and formation of lyso-phosphatidylglycerol (LPG). In turn, upon further incubation with fresh transport active cytosol, the mitochondrial LPG was converted to PG. The results of analysis of the OMM, Inner Mitochondrial Mem-brane (IMM) and Inner Mitochondrial Space Components (IMSC) strongly suggest that PG-containing transport vesicles deliver nuclear DNA translation products to the IMSC and thus facilitate CL synthesis in the IMM. In summary, our studies provide evidence that ER-generated PG-enriched transport vesicles represent the general pathway for restitution of mitochondrial membranes and the delivery of nuclear DNA translation products that generate CL, and thus sustain the mitochondrial matrix CL-dependent metabolic reactions.
文摘Contamination between batches in multi-products pipeline transport is studied. The influences of convection and diffusion on the contamination are studied in detail. Diffusion equations, which are mainly controlled by convection, are developed under turbulent pipe flow. The diffusion equation is separated into a pure convection equation and a pure diffusion equation which are solved by characteristics method and finite difference method respectively to obtain numerical solutions. The results of numerical computation explain the forming and developing of contamination very well.
文摘This study uses a simulation-based approach to investigate the impact of delivery delays due to constraints on transport capacity, transit speed, and routing efficiencies on an economy with various levels of interdependency among firms. The simulation uses object-oriented programming to create specialized production, consumption, and transportation classes. A set of objects from each class is distributed randomly on a 2D plane. A road network is then established between fixed objects using Prim’s MST (Minimum Spanning Tree) algorithm, followed by construction of an all-pair shortest path matrix using the Floyd Warshall algorithm. A genetic algorithm-based vehicle routing problem solver employs the all-pair shortest path matrix to best plan multiple pickup and delivery orders. Production units utilize economic order quantities (EOQ) and reorder points (ROP) to manage inventory levels. Hicksian and Marshallian demand functions are utilized by consumption units to maximize personal utility. The transport capacity, transit speed, routing efficiency, and level of interdependence serve as 4 factors in the simulation, each assigned 3 distinct levels. Federov’s exchange algorithm is used to generate an orthogonal array to reduce the number of combination replays from 3<sup>4</sup> to just 9. The simulation results of a 9-run orthogonal array on an economy with 6 mining facilities, 12 industries, 8 market centers, and 8 transport hubs show that the level of firm interdependence, followed by transit speed, has the most significant impact on economic productivity. The principal component analysis (PCA) indicates that interdependence and transit speed can explain 90.27% of the variance in the data. According to the findings of this research, a dependable and efficient regional transportation network among various types of industries is critical for regional economic development.