The Vehicle Routing Problem of Logistics park distribution (VRPLPD) is an extension of the vehicle routing problem, which deals with simultaneous distribution of goods to customers. With the increasing importance of logistics activities, it is of great theoretical and practical significance to determine efficient and effective vehicle routes for simultaneous delivery activities. The study attem...

To solve the problem of vehicle routing problem under capacity limitation, this paper puts forward a novel method of logistics distribution route optimization based on genetic algorithm and ant colony optimization algorithm (GA-ACO). On the first stage, improved genetic algorithm with a good global optimization searching ability is used to find the feasible routes quickly. On the second stage, ...

Let a graph G = (V;E) be given. In the path center problem we want to find a path P in G such that the maximum weighted distance of P to every vertex in V is minimized. In this paper a genetic algorithm and ahybrid of genetic and ant colony algorithms are presented for the path center problem. Some test problems are examined to compare the algorithms. The results show that for almost all exampl...

In an era where people in the world are concerned about environmental issues, companies must reduce distribution costs while minimizing pollution generated during process. For today’s multi-depot problem, a mixed-integer programming model is proposed this paper to minimize all incurred entire transportation process, considering impact of time-varying speed, loading, and waiting time on costs. T...

Internet Traffic has grown exponentially over last few years due to provision of multiple class services through Internet backbone. With the explosive use of Internet, contemporary Internet routers are susceptible to overloads and their services deteriorate drastically and often cause denial of services. In this paper, an analysis is made how forecasting technique, routing algorithm and Genetic...

The Two-Echelon Routing Problem constitutes a class of combinatorial optimization problems with applications in many different fields such as city logistic planning, intermodal transportation, postal and parcel delivery distribution systems and so on. This thesis contains: a survey of the main contributions related to the two-echelon routing, focusing on the Two-Echelon Location Routing Problem...

Hazardous materials routing and scheduling decisions involve the determination of the minimum cost and/or risk routes for servicing the demand of a given set of customers. This paper addresses the bicriterion routing and scheduling problem arising in hazardous materials distribution planning. Under the assumption that the cost and risk attributes of each arc of the underlying transportation net...

3D network analysis for indoor provides strong decision support for users in searching optimal routes on applications such as emergency services, transportation, security and visitor guiding. Genetic algorithm is used to solve non-linear problems with complicated constraints. Therefore, the implementation of genetic algorithm into route finding algorithms is needed. This paper explains the dema...