A time-space formulation for the locomotive routing problem at the Canadian National Railways

2021 ◽  
pp. 105629
Author(s):  
Pedro L. Miranda ◽  
Jean-François Cordeau ◽  
Emma Frejinger
Keyword(s):  
Routing Problem ◽  
Time Space ◽  
Space Formulation

Time-Space Synesthesia: An Event-Related Brain Potential (ERP) Study

2007 ◽  
Author(s):  
Ursina Teuscher ◽  
David Brang ◽  
Lee Edwards ◽  
Marguerite McQuire ◽  
Vilayanur S. Ramachandran ◽  
...  
Keyword(s):  
Brain Potential ◽  
Time Space

Fuzzy multi-objective location and routing problem

2020 ◽  
Vol 39 (3) ◽  
pp. 3259-3273
Author(s):  
Nasser Shahsavari-Pour ◽  
Najmeh Bahram-Pour ◽  
Mojde Kazemi
Keyword(s):  
Firefly Algorithm ◽  
High Reliability ◽  
Research Area ◽  
Nsga Ii ◽  
Location Routing Problem ◽  
Routing Problem ◽  
Location Allocation ◽  
Multi Objective ◽  
Location Routing ◽  
The Cost

The location-routing problem is a research area that simultaneously solves location-allocation and vehicle routing issues. It is critical to delivering emergency goods to customers with high reliability. In this paper, reliability in location and routing problems was considered as the probability of failure in depots, vehicles, and routs. The problem has two objectives, minimizing the cost and maximizing the reliability, the latter expressed by minimizing the expected cost of failure. First, a mathematical model of the problem was presented and due to its NP-hard nature, it was solved by a meta-heuristic approach using a NSGA-II algorithm and a discrete multi-objective firefly algorithm. The efficiency of these algorithms was studied through a complete set of examples and it was found that the multi-objective discrete firefly algorithm has a better Diversification Metric (DM) index; the Mean Ideal Distance (MID) and Spacing Metric (SM) indexes are only suitable for small to medium problems, losing their effectiveness for big problems.

Sign in / Sign up

Export Citation Format

Share Document