Abstract
Forward Backward Transformation and its realization, Enhanced Differential Evolution algorithm is one of the permutative versions of Differential Evolution, which has been developed to solve permutative combinatorial optimization problems. Novel domain conversions routines, alongside special enhancement routines and local search heuristic have been incorporated into the canonical Differential Evolution in order to make it more robust and effective. Three unique and challenging problems of Flow Shop Scheduling, Quadratic Assignment and Traveling Salesman have been solved, utilizing this new approach. The promising results obtained have been compared and analysed against other benchmark heuristics and published work.
Access provided by Autonomous University of Puebla. Download to read the full chapter text
Chapter PDF
Similar content being viewed by others
Keywords
- Local Search
- Differential Evolution
- Travel Salesman Problem
- Travel Salesman Problem
- Differential Evolution Algorithm
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Battitti, R., Tecchiolli, G.: The reactive tabu search. ORCA Journal on Computing 6, 126–140 (1994)
Burkard, R., Rendl, F.: A thermodynamically motivated simulation procedure for combinatorial optimisation problems. Eur. J. Oper. Res. 17, 169–174 (1994)
Carlier, J.: Ordonnancements a Contraintes Disjonctives. RAIRO. Oper. Res. 12, 333–351 (1978)
Chen, C., Vempati, V., Aljaber, N.: An application of genetic algorithms for the flow shop problems. Eur. J. Oper. Res. 80, 359–396 (1995)
Connolly, D.: An improved annealing scheme for the QAP. Eur. J. Oper. Res. 46, 93–100 (1990)
Davendra, D.: Differential Evolution Algorithm for Flow Shop Scheduling, Bachelor Degree Thesis, University of the South Pacific (2001)
Davendra, D.: Hybrid Differential Evolution Algorithm for Discrete Domain Problems. Master Degree Thesis, University of the South Pacific (2003)
Davendra, D., Onwubolu, G.: Flow Shop Scheduling using Enhanced Differential Evolution. In: Proceeding of the 21st European Conference on Modelling and Simulation, Prague, Czech Republic, June 4-5, pp. 259–264 (2007)
Davendra, D., Onwubolu, G.: Enhanced Differential Evolution hybrid Scatter Search for Discrete Optimisation. In: Proceeding of the IEEE Congress on Evolutionary Computation, Singapore, September 25-28, pp. 1156–1162 (2007)
Dorigo, M., Maniezzo, V., Colorni, A.: The Ant System: optimisation by a colony of cooperating agents. IEEE Trans. Syst. Man Cybern B Cybern. 26(1), 29–41 (1996)
Dorigo, M., Gambardella, L.: Ant Colony System: A Co-operative Learning Approach to the Traveling Salesman Problem. IEEE Trans. Evol. Comput. 1, 53–65 (1997)
Durbin, R., Willshaw, D.: An analogue approach to the travelling salesman problem using the elastic net method. Nature 326, 689–691 (1987)
Gambardella, L., Thaillard, E., Dorigo, M.: Ant Colonies for the Quadratic Assignment Problem. Int. J. Oper. Res. 50, 167–176 (1999)
Glover, F.: A template for scatter search and path relinking. In: Hao, J.-K., Lutton, E., Ronald, E., Schoenauer, M., Snyers, D. (eds.) AE 1997. LNCS, vol. 1363, pp. 13–54. Springer, Heidelberg (1998)
Heller, J.: Some Numerical Experiments for an MJ Flow Shop and its Decision-Theoretical aspects. Oper. Res. 8, 178–184 (1960)
Ho, Y., Chang, Y.-L.: A new heuristic method for the n job, m-machine flow-shop problem. Eur. J. Oper. Res. 52, 194–202 (1991)
Kara, L., Atkar, P., Conner, D.: Traveling Salesperson Problem (TSP) Using Shochastic Search. In: Advanced AI Assignment, Carnegie Mellon Assignment, Pittsbergh, Pennsylvania, p. 15213 (2003)
Koopmans, T., Beckmann, M.: Assignment problems and the location of economic activities. Econometrica 25, 53–76 (1957)
Lampinen, J., Zelinka, I.: Mechanical engineering design optimisation by Differential evolution. In: Corne, D., Dorigo, M., Glover, F. (eds.) New Ideas in Optimisation, pp. 127–146. McGraw Hill, International, UK (1999)
Lawler, E., Lensta, J., Rinnooy, K., Shmoys, D.: Sequencing and scheduling: algorithms and complexity. In: Graves, S., Rinnooy, K., Zipkin, P. (eds.) Logistics of Production and Inventory, pp. 445–522. North Holland, Amsterdam (1995)
Lin, F., Kao, C., Hsu: Applying the genetic approach to simulated annealing in solving NPhard problems. IEEE Trans. Syst. Man Cybern. B Cybern. 23, 1752–1767 (1993)
Nowicki, E., Smutnicki, C.: A fast tabu search algorithm for the permutative flow shop problem. Eur. J. Oper. Res. 91, 160–175 (1996)
Onwubolu, G.: Optimisation using Differential Evolution Algorithm. Technical Report TR-2001-05, IAS (October 2001)
Onwubolu, G.: Emerging Optimisation Techniques in Production Planning and Control. Imperial Collage Press, London (2002)
Onwubolu, G., Clerc, M.: Optimal path for automated drilling operations by a new heuristic approach using particle swamp optimisation. Int. J. Prod. Res. 42(3), 473–491 (2004)
Onwubolu, G., Davendra, D.: Scheduling flow shops using differential evolution algorithm. Eur. J. Oper. Res. 171, 674–679 (2006)
Onwubolu, G., Kumalo, T.: Optimisation of multi pass tuning operations with genetic algorithms. Int. J. Prod. Res. 39(16), 3727–3745 (2001)
Onwubolu, G., Mutingi, M.: Genetic algorithm for minimising tardiness in flow-shop scheduling. Prod. Plann. Contr. 10(5), 462–471 (1999)
Pinedo, M.: Scheduling: theory, algorithms and systems. Prentice Hall, Inc., New Jersey (1995)
Price, K.: An introduction to differential evolution. In: Corne, D., Dorigo, M., Glover, F. (eds.) New Ideas in Optimisation, pp. 79–108. McGraw Hill, International (1999)
Price, K., Storn, R.: Differential evolution homepage (2001) (Cited September 10, 2008), http://www.ICSI.Berkeley.edu/~storn/code.html
Reeves, C.: A Genetic Algorithm for Flowshop Sequencing. Comput. Oper. Res. 22, 5–13 (1995)
Reeves, C., Yamada, T.: Genetic Algorithms, path relinking and flowshop sequencing problem. Evol. Comput. 6, 45–60 (1998)
Sahni, S., Gonzalez, T.: P-complete approximation problems. J. ACM 23, 555–565 (1976)
Taillard, E.: Robust taboo search for the quadratic assignment problem. Parallel Comput. 17, 443–455 (1991)
Taillard, E.: Benchmarks for basic scheduling problems. Eur. J. Oper. Res. 64, 278–285 (1993)
Tasgetiren, M., Liang, Y.-C., Sevkli, M., Gencyilmaz, G.: Differential Evolution Algorithm for Permutative Flowshops Sequencing Problem with Makespan Criterion. In: 4th International Symposium on Intelligent Manufacturing Systems, IMS 2004, Sakaraya, Turkey, September 5-8, pp. 442–452 (2004)
Widmer, M., Hertz, A.: A new heuristic method for the flow shop sequencing problem. Eur. J. Oper. Res. 41, 186–193 (1989)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Davendra, D., Onwubolu, G. (2009). Forward Backward Transformation. In: Onwubolu, G.C., Davendra, D. (eds) Differential Evolution: A Handbook for Global Permutation-Based Combinatorial Optimization. Studies in Computational Intelligence, vol 175. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-92151-6_3
Download citation
DOI: https://doi.org/10.1007/978-3-540-92151-6_3
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-92150-9
Online ISBN: 978-3-540-92151-6
eBook Packages: EngineeringEngineering (R0)