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.

[1]  Minghe Sun,et al.  A tabu search heuristic procedure for the fixed charge transportation problem , 1998, Eur. J. Oper. Res..

[2]  Gregory Piatetsky-Shapiro,et al.  Advances in Knowledge Discovery and Data Mining , 2004, Lecture Notes in Computer Science.

[3]  Richard A. Harshman,et al.  Indexing by Latent Semantic Analysis , 1990, J. Am. Soc. Inf. Sci..

[4]  Allen Gersho,et al.  Vector quantization and signal compression , 1991, The Kluwer international series in engineering and computer science.

[5]  F. L. Hitchcock.  The Distribution of a Product from Several Sources to Numerous Localities , 1941 .

[6]  Camelia-Mihaela Pintea,et al.  Sensitive Stigmergic Agent Systems - A Hybrid Approach to Combinatorial Optimization , 2008, Innovations in Hybrid Intelligent Systems.

[7]  Geraldo Robson Mateus,et al.  Solving a Public Sector Sustainable Supply Chain Problem : A Genetic Algorithm Approach , 2011 .

[8]  Petrica C. Pop,et al.  A Hybrid Classical Approach to a Fixed-Charged Transportation Problem , 2012, HAIS.

[9]  Reza Tavakkoli-Moghaddam,et al.  Solving a capacitated fixed-charge transportation problem by artificial immune and genetic algorithms with a Prüfer number representation , 2011, Expert Syst. Appl..

[10]  K. Spielberg.  On the fixed charge transportation problem , 1964, ACM National Conference.

[11]  Stefan Seuring,et al.  From a literature review to a conceptual framework for sustainable supply chain management , 2008 .

[12]  L. Devroye,et al.  8 Nearest neighbor methods in discrimination , 1982, Classification, Pattern Recognition and Reduction of Dimensionality.

[13]  Camelia-Mihaela Pintea.  Combinatorial optimization with bio-inspired computing , 2008 .

[14]  Petrica C. Pop,et al.  Sensitive Ants in Solving the Generalized Vehicle Routing Problem , 2011, Int. J. Comput. Commun. Control.

[15]  Steven Salzberg,et al.  A Weighted Nearest Neighbor Algorithm for Learning with Symbolic Features , 2004, Machine Learning.