Classical Hybrid Approaches on a Transportation Problem with Gas Emissions Constraints
Nowadays the efforts of humanity to keep the planet safe are considerable. This aspect is reflected in everyday problems, including the minimization of vehicle’s air pollution. In order to keep a green planet, in particular transportation problems, the main purpose is on limiting the pollution with gas emissions. In a specific capacitated fixed-charge transportation problem with fixed capacities for distribution centers and customers with particular demands the objective is to keep the pollution factor in a given range while the total cost of the transportation is as low as possible. In order to solve this problem, we have developed some hybrid variants of the nearest neighbor classical approach. The proposed algorithms are tested and analyzed on a set of instances used in the literature. The preliminary results point out that our approaches are attractive and appropriate for solving the described transportation problem.
KeywordsHybrid heuristics Transportation Problem Optimization
Unable to display preview. Download preview PDF.
- 2.Chira, C., Pintea, C.-M., Dumitrescu, D.: Sensitive Stigmergic Agent Systems: a Hybrid Approach to Combinatorial Optimization. In: Innovations in Hybrid Intelligent Systems, Advances in Soft Computing, vol. 44, pp. 33–39. Springer (2008)Google Scholar
- 3.Cost, S., Salzberg, S.: A weighted nearest neighbor algorithm for learning with sym-bolic features. Machine Learning 10, 57–78 (1993)Google Scholar
- 5.Devroye, L., Wagner, T.J.: Nearest neighbor methods in discrimination. In: Krishnaiah, P.R., Kanal, L.N. (eds.) Handbook of Statistics, vol. 2, North-Holland (1982)Google Scholar
- 6.Fayyad, U.M., Piatetsky-Shapiro, G., Smyth, P., Uthurusamy, R.: Advances in Knowledge Discovery and Data Mining. AAAI Press/MIT Press (1996)Google Scholar
- 7.Gersho, A., Gray, R.M.: Vector Quantization and Signal Compression. Kluwer Academic, Boston (1991)Google Scholar
- 9.Hugo, A., Pistikopoulos, E.: Environmentally conscious process planning under uncertainty. In: Floudas, C.A., Agrawal, R. (eds.) Sixth International Conference on Foundations of Computer Aided Process Design, CACHE Corporation, Princeton (2004)Google Scholar
- 11.Pintea, C.-M., Chira, C., Dumitrescu, D., Pop, P.C.: Sensitive Ants in Solving the Generalized Vehicle Routing Problem. Int. J. Comput. Commun. & Control VI(4), 731–738 (2011)Google Scholar
- 12.Pintea, C.-M., Sitar, C.P., Hajdu-Macelaru, M., Petrica, P.: A Hybrid Classical Approach to a Fixed-Charged Transportation Problem. In: Corchado, E., Snášel, V., Abraham, A., Woźniak, M., Graña, M., Cho, S.-B. (eds.) HAIS 2012, Part III. LNCS, vol. 7208, pp. 557–566. Springer, Heidelberg (2012)CrossRefGoogle Scholar
- 13.Pintea, C.-M.: Combinatorial optimization with bio-inspired computing, PhD Thesis, Babes-Bolyai University (2008)Google Scholar
- 14.Santibanez-Gonzalez, E., Del, R., Robson Mateus, G., Pacca Luna, H.: Solving a public sector sustainable supply chain problem: A Genetic Algorithm approach. In: Proc. of Int. Conf. of Artificial Intelligence (ICAI), Las Vegas, USA, pp. 507–512 (2011)Google Scholar