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.


Author(s):  
Pedram Memari ◽  
Reza Tavakkoli-Moghaddam ◽  
Fatemeh Navazi ◽  
Fariborz Jolai

Disasters cause a huge number of injured patients in a short time while existing emergency facilities encountered devastation and cannot respond properly. Here, the importance of implementing temporary emergency management becomes clear. This study aims to locate some temporary emergency stations across the area by maximal covering after a disaster. Furthermore, a multi-mode fleet is used for transferring patients using different modes of transportation (e.g. helicopter ambulance and bus ambulance). Since the type of patients may change over periods, medical servers can displace among temporary emergency stations dynamically according to disaster severity. For this purpose, a new bi-objective dynamic location-helicopter ambulance allocation-ambulance routing model with multi-medical servers is presented. The first objective function minimizes the operational costs related to the newly designed Emergency Medical Service along with the rate of human loss. The second objective function minimizes the critical time spent before the medical treatment. To validate the developed model, the augmented ε-constraint method is used and applied for the Tehran city, which shows the applicability of the model. Finally, two meta-heuristic algorithms are customized for large-sized problems, and the related results are compared based on multi-objective algorithms’ performance comparison metrics to find the more efficient one.


2007 ◽  
Vol 20 (3) ◽  
pp. 499-506
Author(s):  
Iskandar Karapetyan

Channel routing is an important phase of physical design of LSI and VLSI chips. The channel routing method was first proposed by Akihiro Hashimoto and James Stevens [1]. The method was extensively studied by many authors and applied to different technologies. At present there are known many effective heuristic algorithms for channel routing. A. LaPaugh [2] proved that the restrictive routing problem is NP-complete. In this paper we prove that for every positive integer k there is a restrictive channel C for which ?(C)>? (HG)+L(VG)+k, where ? (C) is the thickness of the channel, ?(HG) is clique number of the horizontal constraints graph HG and L(VG) is the length of the longest directed path in the vertical constraints graph VG.


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.


Sign in / Sign up

Export Citation Format

Share Document