Search results

The purpose of this paper is to focus on the reference model of a grid-like supply network that enables formulation of delivery routing and scheduling problems in the context of the periodic vehicle routing problem.

The conditions for seamless (collision-free) synchronization of periodically executed local transport processes presented in this paper guarantee cyclic execution of supply processes, thereby preventing traffic flow congestion.

Systems that satisfy this characteristic, cyclic deliveries executed along supply chains are given and what is sought is the number of vehicles needed to operate the local transport processes in order to ensure delivery from and to specific loading/unloading points on given dates. Determination of sufficient conditions guaranteeing the existence of feasible solutions that satisfy these constraints makes it possible to solve the considered class of problems online.

The computer experiments reported in this paper show the possibilities of practical application of the proposed approach in the construction of decision support systems for food supply chain management.

The aim of the present work is to develop a methodology for the synthesis of regularly structured supply networks that would ensure fixed cyclic execution of local transport processes. The proposed methodology, which implements sufficient conditions for the synchronization of local cyclic processes, allows one to develop a method for rapid prototyping of supply processes that satisfies the time windows constraints given.

This study aims to investigate a locating-routing-allocating problems and the supply chain, including factories distributor candidate locations and retailers. The purpose of this paper is to minimize system costs and delivery time to retailers so that routing is done and the location of the distributors is located.

The problem gets closer to reality by adding some special conditions and constraints. Retail service start times have hard and soft time windows, and each customer has a demand for simultaneous delivery and pickups. System costs include the cost of transportation, non-compliance with the soft time window, construction of a distributor, purchase or rental of a vehicle and production costs. The conceptual model of the problem is first defined and modeled and then solved in small dimensions by general algebraic modeling system (GAMS) software and non-dominated sorting genetic algorithm II (NSGAII) and multiple objective particle swarm optimization (MOPSO) algorithms.

According to the solution of the mathematical model, the average error of the two proposed algorithms in comparison with the exact solution is less than 0.7%. Also, the algorithms’ performance in terms of deviation from the GAMS exact solution, is quite acceptable and for the largest problem (N = 100) is 0.4%. Accordingly, it is concluded that NSGAII is superior to MOSPSO.

In this study, since the model is bi-objective, the priorities of decision makers in choosing the optimal solution have not been considered and each of the objective functions has been given equal importance according to the weighting methods. Also, the model has not been compared and analyzed in deterministic and robust modes. This is because all variables, except the one that represents the uncertainty of traffic modes, are deterministic and the random nature of the demand in each graph is not considered.

The results of the proposed model are valuable for any group of decision makers who care optimizing the production pattern at any level. The use of a heterogeneous fleet of delivery vehicles and application of stochastic optimization methods in defining the time windows, show how effective the distribution networks are in reducing operating costs.

This study fills the gaps in the relationship between location and routing decisions in a practical way, considering the real constraints of a distribution network, based on a multi-objective model in a three-echelon supply chain. The model is able to optimize the uncertainty in the performance of vehicles to select the refueling strategy or different traffic situations and bring it closer to the state of certainty. Moreover, two modified algorithms of NSGA-II and multiple objective particle swarm optimization (MOPSO) are provided to solve the model while the results are compared with the exact general algebraic modeling system (GAMS) method for the small- and medium-sized problems.

This paper aims to introduce vehicular network platform, routing and broadcasting methods and vehicular positioning enhancement technology, which are three aspects of the applications of intelligent computing in vehicular networks. From this paper, the role of intelligent algorithm in the field of transportation and the vehicular networks can be understood.

In this paper, the authors introduce three different methods in three layers of vehicle networking, which are data cleaning based on machine learning, routing algorithm based on epidemic model and cooperative localization algorithm based on the connect vehicles.

In Section 2, a novel classification-based framework is proposed to efficiently assess the data quality and screen out the abnormal vehicles in database. In Section 3, the authors can find when traffic conditions varied from free flow to congestion, the number of message copies increased dramatically and the reachability also improved. The error of vehicle positioning is reduced by 35.39% based on the CV-IMM-EKF in Section 4. Finally, it can be concluded that the intelligent computing in the vehicle network system is effective, and it will improve the development of the car networking system.

This paper reviews the research of intelligent algorithms in three related areas of vehicle networking. In the field of vehicle networking, these research results are conducive to promoting data processing and algorithm optimization, and it may lay the foundation for the new methods.

With the development of the modern economy, vehicles are no longer a luxury for people, which greatly facilitate people’s daily life, but at the same time bring traffic congestion. How to relieve traffic congestion and improve its capacity is a hot research area. This paper aims to propose a new simulation framework for crowd transportations to ease traffic congestion.

This paper establishes related simulation models such as vehicles, traffic lights and advisers. Then the paper describes their relationships, gives their interaction mechanism and solidifies the above into a software implementation framework.

This paper proposes a simulation framework for crowd transportations.

In this framework, traffic lights are used as a control method to control the road network and road conditions are used as an Affecter to influence individual behavior. The vehicle passing rate is defined by the correlation between endowment and the start time of the traffic lights. In this framework, members are related, dynamically adjusted according to road conditions and dynamically optimized member decisions. The optimal path is dynamic and real-time adjustments are made for each step forward. It is different from the traditional optimal path in which there is only one fixed one and it is different from the macroscopic optimal path that does not exist.

This paper analyzes two external costs often associated with port development, cost to fisheries from marine dredge disposal and damages from air pollution, using estimates of development and operation for a proposed (but since cancelled) container port as a case study. For dredge disposal, a bio-economic model was used to assess short- and long-term and indirect (joodweb) damages to fisheries from marine disposal of clean sediments. In the case of air pollution, estimates of annual activity levels and emission coefficients are used to estimate incremental annual emissions of three key pollutants (NOx, HC and CO) for trucks, trains, yard vehicles, and vessels. These estimates allow for phasing in of strict new air pollution regulations. For both external costs, sensitivity analyses are used to reflect uncertainty. Estimates of shadow values in year 2002 dollars amount from $0.094 per cubic yard to $0.169 per cubic yard of clean dredged material for the selected disposal site and from $0.0584 per mile (jor current control standards) to $ 0. 0023 per mile (after phasing in of new regulations) for air pollution from heavy trucks.

Basic safety message (BSM) is a core subset of standard protocols for connected vehicle system to transmit related safety information via vehicle-to-vehicle (V2V) and vehicle-to-infrastructure (V2I). Although some safety prototypes of connected vehicle have been proposed with effective strategies, few of them are fully evaluated in terms of the significance of BSM messages on performance of safety applications when in emergency.

To address this problem, a data fusion method is proposed to capture the vehicle crash risk by extracting critical information from raw BSMs data, such as driver volition, vehicle speed, hard accelerations and braking. Thereafter, a classification model based on information-entropy and variable precision rough set (VPRS) is used for assessing the instantaneous driving safety by fusing the BSMs data from field test, and predicting the vehicle crash risk level with the driver emergency maneuvers in the next short term.

The findings and implications are discussed for developing an improved warning and driving assistant system by using BSMs messages.

The findings of this study are relevant to incorporation of alerts, warnings and control assists in V2V applications of connected vehicles. Such applications can help drivers identify situations where surrounding drivers are volatile, and they may avoid dangers by taking defensive actions.

The purpose of this paper is to introduce a three-echelon multimodal transportation problem applied to a humanitarian logistic case study that occurred in Mexico.

This study develops a methodology combining a transshipment problem and an adaptation of the multidepot heterogeneous fleet vehicle routing problem to construct a mathematical model that incorporates the use of land-based vehicles and drones. The model was applied to the case study of the Earthquake on September 19, 2017, in Mexico, using the Gurobi optimization solver.

The results ratified the relevance of the study, showing an inverse relationship between transportation costs and delivery time; on the flip side, the model performed in a shorter CPU time with medium and small instances than with large instances.

While the size of the instances limits the use of the model for big-scale problems, this approach manages to provide a good representation of a transportation network during a natural disaster using drones in the last-mile deliveries.

The present study contributes to a model that combines a vehicle routing problem with transshipment, multiple depots and a heterogeneous fleet including land-based vehicles and drones. There are multiple models present in the literature for these types of problems that incorporate the use of these transportation modes; however, to the best of the authors’ knowledge, there are still no proposals similar to this study.

This paper aims to use active fine lane management methods to solve the problem of congestion in a weaving area and provide theoretical and technical support for traffic control under the environment of intelligent connected vehicles (ICVs) in the future.

By analyzing the traffic capacities and traffic behaviors of domestic and foreign weaving areas and combining them with field investigation, the paper proposes the active and fine lane management methods for ICVs to optimal driving behavior in a weaving area. The VISSIM simulation of traffic flow vehicle driving behavior in weaving areas of urban expressways was performed using research data. The influence of lane-changing in advance on the weaving area was evaluated and a conflict avoidance area was established in the weaving area. The active fine lane management methods applied to a weaving area were verified for different scenarios.

The results of the study indicate that ICVs complete their lane changes before they reach a weaving area, their time in the weaving area does not exceed the specified time and the delay of vehicles that pass through the weaving area decreases.

Based on the vehicle group behavior, this paper conducts a simulation study on the active traffic management control-oriented to ICVs. The research results can optimize the management of lanes, improve the traffic capacity of a weaving area and mitigate traffic congestion on expressways.

The purpose of this paper is to investigate US noncombatant evacuation operations (NEO) in South Korea and devise planning and management procedures that improve the efficiency of those missions.

It formulates a time-staged network model of the South Korean noncombatant evacuation system as a mixed integer linear program to determine an optimal flow configuration that minimizes the time required to complete an evacuation. This solution considers the capacity and resource constraints of multiple transportation modes and effectively allocates the limited assets across a time-staged network to create a feasible evacuation plan. That solution is post-processed and a vehicle routing procedure then produces a high resolution schedule for each individual asset throughout the entire duration of the NEO.

This work makes a clear improvement in the decision-making and resource allocation methodology currently used in a NEO on the Korea peninsula. It immediately provides previously unidentifiable information regarding the scope and requirements of a particular evacuation scenario and then produces an executable schedule for assets to facilitate mission accomplishment.

The significance of this work is not relegated only to evacuation operations on the Korean peninsula; there are numerous other NEO and natural disaster related scenarios that can benefit from this approach.