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.
This paper deals with a dial-a-ride problem with time windows applied to a demand responsive transport service. An evolutionary approach as well as new original representation and variation operators are proposed and detailed. Such mechanisms are used with three state-of-the-art multi-objective evolutionary algorithms: NSGA-II, IBEA and SPEA2. After introducing the general problem, the solution encoding...
A particular three-layer capacitated location-routing problem is investigated in which there exist two echelons of facilities to be located. A Lagrangian relaxation is used to separate the problem and obtain lower bound. Subgradient optimization is used to improve the lower bound and feedback information among the sub problems. Genetic algorithm and other heuristics are used to solve subproblems....
The Vehicle Routing Problem (VRP) is a NP complete problem and is also a hot topic in the operational research. But traditional methods might suffer from slow convergence and the curse of large sizes, heuristics-based swarm intelligence can be an efficient alternative. Particle swarm optimization (PSO) is known to effectively solve engineering optimization problems. In this paper, the PSO in solving...
Considering the specialties of logistics distribution under electronic commerce, the traditional multi-depot vehicle scheduling model is modified in order to reduce the distribution cost; objective function is modified based on minimum expense. At the same time, in order to improve the distribution service quality and market competition, add maximum work time, many vehicle types, and maximum running...
With the rapid development of electronic commerce and logistics distribution, multi-depot vehicle routing problem with backhauls (MDVRPB) as influencing electronic commerce more step development, has been paid more attentions. According to the characteristics of model, hybrid heuristic algorithm is used to get the optimization solution. First of all, use hybrid coding so as to simplify the problem;...
Open vehicle route problem of logistics distribution is the important step optimizing logistics distribution. According to the traditional genetic algorithm shortcomings of slowly convergent speed, weakly partial searching ability and easily premature, therefore, hybrid genetic algorithm is used to get the optimization solution, namely, use dualistic coding so as to simplify the problem and improve...
The intelligent optimization algorithm PBIL is applied to VRP. Faced to the concrete problem that the objective function is to minimize the cost and meet the time restriction. And the probability statistics for the road traffic status distributed in working hours is considered to decide the routing. The probability matrix of PBIL algorithm is modified with the quick velocity update strategy of particle...
Vehicle route problem of logistics distribution is the important step optimizing logistics distribution. According to the traditional genetic algorithm shortcomings of slowly convergent speed, weakly partial searching ability and easily premature, therefore, hybrid genetic algorithm is used to get the optimization solution, namely, use dualistic coding so as to simplify the problem and improve the...
Most path planning algorithms existed have disadvantages in space representation, constraints handling or computation efficiency. Combining particle swarm optimization with path planning problem for unmanned aerial vehicles (UAVs), a new path planner for aerial vehicles based on modified PSO algorithm is presented. Path planning problem is modeled as a 5-element array. Incorporating constraints into...
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.