The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
In order to propose a novel discrete differential evolution algorithm for stochastic vehicle routing problems (SVRP), the two bit wise operators of the computer language are introduced. In the algorithm, the individuals are represented as natural numbers, and new mutation and revised operators are developed for this representation. Computational simulations and comparisons based on Benchmark Problem...
In real life optimization problems, it is very important to have high quality solutions (optimal). But when uncertainty becomes part of the optimization problem, solutions should be optimal and robust to the uncertain environmental changes. This paper focuses on finding robust optimal solution for the vehicle routing problem with stochastic demands VRPSD. In this case when the uncertainty of the customers...
Motivated by an industry project with a small package shipping company in France, we study a vehicle routing problem with stochastic travel and service times that considers the influence of driver familiarity with routes and customers on routing efficiency. Our approach forgoes any fixing of delivery areas thus maintaining routing flexibility. Driver specific travel and service times give drivers...
In this paper, we propose a mathematical model for a dynamic vehicle routing problem (VRP) to minimize unmet demand with stochastic demands and real-time vehicle control in large-scale emergencies. In this context, we consider that one depot may not supply all demand nodes with sufficient medicine that they need in limited time. The problem involves multiple vehicles with various capacities and instantaneous...
An improved vehicle coordination strategy for vehicle routing problem (VRP) based on SWEEP was proposed in order to solving single-depot VRP with stochastic demands. In this strategy, the vehicle routing that customers were not served by basic vehicle (BV) is re-optimized using SWEEP rules, then these customers are severed by SWEEP vehicle (SV) in order that the total serve time will be less and the...
Assigning and scheduling vehicle routes in stochastic traffic network is a crucial management problem. Vehicle routing problem (VRP) is a combinational optimization problem, it belongs to the NP-hard problem theoretically. VRP with time windows and capacity constraint in stochastic traffic network was studied considering the state of traffic network changing randomly under the action of external factors...
This paper deals with the optimization of vehicle routing problem in which multiple depots, multiple customers, and multiple products are considered. Since the total traveling time is not always restrictive as a time window constraint, the objective regarded in this paper comprises not only the cost due to the total traveling distance, but also the cost due to the total traveling time. We propose...
In this paper, a simulation optimization method for campus bus routing, which allows the vehicle divert from its current destination, is given. Vehicle routing that can divert a vehicle away from its fixed route in response to a new customer request is beneficial to campus bus routing for its efficiency in quick response and saving cost especially when the density of customer requests is low. A simulation...
As part of solutions to the technical problem of logistics distribution, vehicle routing problem (VRP) is getting more and more attention in academics and enterprises, it belongs to the NP-hard problem theoretically. VRP with time windows and capacity constraint in stochastic traffic network was studied based on travel time reliability . Firstly, travel time was expressed as a random variable according...
The Vehicle Routing Problem (VRP) is of considerable economic significance in logistic systems as it manages the distribution of goods to make an efficient transportation system. Considering a practical application, this paper solves a vehicle routing problem with stochastic demand (VRPSD) in which the customer demand has been modeled as a stochastic variable as opposed to conventional VRP. To deal...
The reuse of end-of-use products is always an important issue. To optimize the closed-loop logistics system for reusing end-of-use products, an integrated optimization model for stochastic dynamic location-routing-inventory problem is presented in this paper. A two-phase heuristic algorithm is also proposed to solve the model. And the validity of the model and algorithm is demonstrated by an example.
The standard simulated algorithm has been applied into vehicle routing problem, and it has the common defects of slow convergence and easily being trapped into local minima. In this paper, a new stochastic approach called the simulated annealing genetic algorithm is proposed to solve stochastic vehicle routing problems and the solution is then compared with that from simulated algorithm. Results from...
In recent years there has been growing interest in algorithms inspired by the observation of natural phenomena to define computational procedures which can solve complex problems. In this paper, through an analysis of the constructive procedure of the solution in the ant colony system (ACS), a vehicle routing problem (VRP) is examined and a hybrid ant colony system coupled with a stochastic local...
This paper describes a new approach aiming at optimizing and improving the efficiency of the medical emergency services. The purpose is to optimize the use of human and material resources by assigning the appropriate doctor to each patient and as a result reduce costs and time reactivity. In order to do so, we tackled the problem as a dynamic vehicle routing problem within a time frame. We have developed...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.