Optimizing Routes with Safety and Environmental Criteria in Transportation Management in Spain

Author(s):  
Javier Faulin ◽  
Fernando Lera-López ◽  
Angel A. Juan

The object of logistic management is to optimise the whole value chain of the distribution of goods and merchandise. One of the main aspects of such an analysis is the optimisation of vehicle routes to deliver final products to customers. There are many algorithms to optimise the related vehicle routing problem. The objective function of that problem usually involves distance, cost, number of vehicles, or profits. This study also takes safety and environmental costs into account. Thus, the authors develop variants to traditional heuristic algorithms, in which they include the traditional costs along with safety and environmental cost estimates for real scenarios in Spain. This methodology is called ASEC (Algorithms with Safety and Environmental Criteria). These considerations raise the value of the global objective function, but permit a more realistic cost estimate that includes not only the internal costs involved in the problem but also the related externalities. Finally, real cases are discussed, and solutions are offered using the new ASEC methodology.

Author(s):  
Javier Faulin ◽  
Fernando Lera-López ◽  
Angel A. Juan

The object of logistic management is to optimise the whole value chain of the distribution of goods and merchandise. One of the main aspects of such an analysis is the optimisation of vehicle routes to deliver final products to customers. There are many algorithms to optimise the related vehicle routing problem. The objective function of that problem usually involves distance, cost, number of vehicles, or profits. This study also takes safety and environmental costs into account. Thus, the authors develop variants to traditional heuristic algorithms, in which they include the traditional costs along with safety and environmental cost estimates for real scenarios in Spain. This methodology is called ASEC (Algorithms with Safety and Environmental Criteria). These considerations raise the value of the global objective function, but permit a more realistic cost estimate that includes not only the internal costs involved in the problem but also the related externalities. Finally, real cases are discussed, and solutions are offered using the new ASEC methodology.


2010 ◽  
Vol 1 (2) ◽  
pp. 82-92 ◽  
Author(s):  
Gilbert Laporte

The Traveling Salesman Problem (TSP) and the Vehicle Routing Problem (VRP) are two of the most popular problems in the field of combinatorial optimization. Due to the study of these two problems, there has been a significant growth in families of exact and heuristic algorithms being used today. The purpose of this paper is to show how their study has fostered developments of the most popular algorithms now applied to the solution of combinatorial optimization problems. These include exact algorithms, classical heuristics and metaheuristics.


2017 ◽  
Vol 16 (05) ◽  
pp. 1339-1357 ◽  
Author(s):  
Kun Guo ◽  
Qishan Zhang

Reverse logistics (RL) emerges as a hot topic in both research and business with the increasing attention on the collection and recycling of the waste products. Since Location and Routing Problem (LRP) in RL is NP-complete, heuristic algorithms, especially those built upon swarm intelligence, are very popular in this research. In this paper, both Vehicle Routing Problem (RP) and Location Allocation Problem (LAP) of RL are considered as a whole. First, the features of LRP in RL are analyzed. Second, a mathematical model of the problem is developed. Then, a novel discrete artificial bee colony (ABC) algorithm with greedy adjustment is proposed. The experimental results show that the new algorithm can approach the optimal solutions efficiently and effectively.


Author(s):  
A.K. Pamosoaji ◽  
P.K. Dewa ◽  
J.V. Krisnanta

A multi-objective distribution routing algorithm by using modified Clarke and Wright Saving algorithm is presented. The problem to solve is to deliver loads to a number of outlets based load requirement. The objective function to minimize is the distance saving and traveling time of the resulted route started from depot to the outlets and return to the original depot. Problem to solve is generating a distribution route in a week considering traffic condition for each day. The original Clarke and Wright saving algorithm is modified such that the resulted routes (from a depot to some outlets) accommodates some constraints such as the maximum allowable traveling time, maximum number of delivery shifts, and maximum number of vehicles. The algorithm is applied to a distributor company with nine outlets, two vehicles, and two delivery shifts. In addition, the traffic condition on the outlet-to-outlet and the depot-to-outlet routes is considered. The simulation of the proposed algorithm shows that the algorithm can generate routes that comply with shift’s maximum delivery time and the vehicles’ capacities. 


2018 ◽  
Vol 3 (01) ◽  
Author(s):  
Rosalina Rosalina ◽  
Hokki Putra Handika

Transportation Management System is very needed in optimize efficiency and effectiveness on logistics company. One of the most important part of transportation management system is determining delivery route from a depot to each customer. A lot of studies have been done about determining the best route in a shipping ritation with various algorithms. In the previous research, determination of delivery route is done without any implementation in the application. During the route determination is still done manually it will make a flow process in the company is not maximize. Model development aims to make an implementation application that serves to determine delivery route based on the problem of vehicle routing problem using the nearest neighbour method which is restricted to heavy loads in the transportation. Implementation of route determination an application will be done based on business process in transportation company, named PT. X,  so it is necessary to observe the company. Compared to previous research, this research will determine delivery route in application based on the problem of vehicle routing problem using the nearest neighbour method.


Sign in / Sign up

Export Citation Format

Share Document