2009 IEEE International Symposium on Parallel & Distributed Processing, 2009
... In CC Ribeiro and P. Hansen, editors, Essays and Surveys in Metaheuristics, Kluwer Academic P... more ... In CC Ribeiro and P. Hansen, editors, Essays and Surveys in Metaheuristics, Kluwer Academic Publishers, Norwell, MA, pages 263308. [13] PM Francis, KR Smilowitz and M. Tzur (2008). ... [19] A. Le Bouthillier and TG Crainic (2005). ...
Proceedings of the 11th Annual Conference Companion on Genetic and Evolutionary Computation Conference: Late Breaking Papers, 2009
... Of course, enhancement of offspring through local search or more complex meta-heuristics, lea... more ... Of course, enhancement of offspring through local search or more complex meta-heuristics, leading to Lamar-ckian evolution, has proved its worth and is included from the beginning as appropriate for each specific application. ... [10] BL Golden, AA Assad and EW Wasil (2002). ...
In this paper, we consider empty freight car distribution in a scheduled railway system. We analy... more In this paper, we consider empty freight car distribution in a scheduled railway system. We analyze the cost structure for the repositioning of empty cars, and conclude that the distribution cost shows an economy-of-scale behavior. In addition to the cost proportional to the number of cars sent from origin to destination, there is a cost related to car-handling operations at yards, which depends on the number of car groups that are handled. Thus, if we can find a transportation pattern in which fewer but larger groups of cars are built, the total distribution cost can be decreased. The objective of the paper is to propose an optimization model that explicitly takes this economy-of-scale effect into account. We use a time-dependent network to describe the possible car movements in time and space, and show how this network can be transformed into a network with fixed costs on links representing movements of cars with identical origin and destination terminals. The resulting optimizati...
We propose an algorithmic framework that successfully addresses three vehicle routing problems: t... more We propose an algorithmic framework that successfully addresses three vehicle routing problems: the multidepot VRP, the periodic VRP, and the multidepot periodic VRP with capacitated vehicles and constrained route duration. The metaheuristic combines the exploration breadth of population-based evolutionary search, the aggressive-improvement capabilities of neighborhood-based metaheuristics, and advanced population-diversity management schemes. Extensive computational experiments show that the method performs impressively in terms of computational efficiency and solution quality, identifying either the best known solutions, including the optimal ones, or new best solutions for all currently available benchmark instances for the three problem classes. The proposed method also proves extremely competitive for the capacitated VRP.
2009 IEEE International Symposium on Parallel & Distributed Processing, 2009
... In CC Ribeiro and P. Hansen, editors, Essays and Surveys in Metaheuristics, Kluwer Academic P... more ... In CC Ribeiro and P. Hansen, editors, Essays and Surveys in Metaheuristics, Kluwer Academic Publishers, Norwell, MA, pages 263308. [13] PM Francis, KR Smilowitz and M. Tzur (2008). ... [19] A. Le Bouthillier and TG Crainic (2005). ...
Proceedings of the 11th Annual Conference Companion on Genetic and Evolutionary Computation Conference: Late Breaking Papers, 2009
... Of course, enhancement of offspring through local search or more complex meta-heuristics, lea... more ... Of course, enhancement of offspring through local search or more complex meta-heuristics, leading to Lamar-ckian evolution, has proved its worth and is included from the beginning as appropriate for each specific application. ... [10] BL Golden, AA Assad and EW Wasil (2002). ...
In this paper, we consider empty freight car distribution in a scheduled railway system. We analy... more In this paper, we consider empty freight car distribution in a scheduled railway system. We analyze the cost structure for the repositioning of empty cars, and conclude that the distribution cost shows an economy-of-scale behavior. In addition to the cost proportional to the number of cars sent from origin to destination, there is a cost related to car-handling operations at yards, which depends on the number of car groups that are handled. Thus, if we can find a transportation pattern in which fewer but larger groups of cars are built, the total distribution cost can be decreased. The objective of the paper is to propose an optimization model that explicitly takes this economy-of-scale effect into account. We use a time-dependent network to describe the possible car movements in time and space, and show how this network can be transformed into a network with fixed costs on links representing movements of cars with identical origin and destination terminals. The resulting optimizati...
We propose an algorithmic framework that successfully addresses three vehicle routing problems: t... more We propose an algorithmic framework that successfully addresses three vehicle routing problems: the multidepot VRP, the periodic VRP, and the multidepot periodic VRP with capacitated vehicles and constrained route duration. The metaheuristic combines the exploration breadth of population-based evolutionary search, the aggressive-improvement capabilities of neighborhood-based metaheuristics, and advanced population-diversity management schemes. Extensive computational experiments show that the method performs impressively in terms of computational efficiency and solution quality, identifying either the best known solutions, including the optimal ones, or new best solutions for all currently available benchmark instances for the three problem classes. The proposed method also proves extremely competitive for the capacitated VRP.
Uploads