Skip to main content
SpringerLink
Log in

Tabu Search Approaches for Two Car Sequencing Problems with Smoothing Constraints

  • Chapter
Book cover Metaheuristics for Production Systems

Part of the book series: Operations Research/Computer Science Interfaces Series ((ORCS,volume 60))

Abstract

Nowadays, new constraints, known as smoothing constraints , are attracting a growing attention in the area of job scheduling , and in particular for car sequencing problems, where cars must be scheduled before production in an order respecting various constraints (colors, optional equipments, due dates, etc.), while avoiding overloading some important resources. The first objective of the car industry is to assign a production day to each customer-ordered car and the second one consists of scheduling the order of cars to be put on the line for each production day, while satisfying as many requirements as possible of the plant shops (e.g., paint shop, assembly line). The goal of this chapter is to propose Tabu search approaches for two car sequencing problems involving smoothing constraints. The first one is denoted (P1) and was the subject of the ROADEF 2005 international Challenge proposed by the automobile manufacturer Renault, whereas the second one is denoted (P2) and extends some important features of (P1).

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 109.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Aarts EHI, Laarhoven PJM (1985) Statistical cooling: a general approach to combinatorial optimization problems. Philips J Res 40:193–226

    Google Scholar 

  2. Allahverdi A, Ng CT, Cheng TCE, Kovalyov MY (2008) A survey of scheduling problems with setup times or costs. Eur J Oper Res 187:985–1032

    Article  Google Scholar 

  3. Becker C, Scholl A (2006) A survey on problems and methods in generalized assembly line balancing. Eur J Oper Res 168(3):694–715

    Article  Google Scholar 

  4. Blum C, Roli A (2003) Metaheuristics in combinatorial optimization: overview and conceptual comparison ACM Comput Surv 35(3):268–308

    Article  Google Scholar 

  5. Calegari P, Coray C, Hertz A, Kobler D, Kuonen P (1999) A taxonomy of evolutionary algorithms in combinatorial optimization. J Heuristics 5:145–158

    Article  Google Scholar 

  6. Cordeau J-F, Laporte G, Pasin F (2008) Iterated tabu search for the car sequencing problem. Eur J Oper Res 191(3):945–956

    Article  Google Scholar 

  7. Dincbas M, Simonis H, Hentenryck PV (1997) Solving the car-sequencing problem. In: Kodratoff Y (ed) ECAI, Munich, 88:290–295

    Google Scholar 

  8. Ehrgott M (2005) Multicritera optimization. Springer, Berlin

    Google Scholar 

  9. Estellon B, Gardi F, Nouioua K (2008) Two local search approaches for solving real-life car sequencing problems. Eur J Oper Res 191(3):928–944

    Article  Google Scholar 

  10. Faigle U, Kern W (1992) Some convergence results for probabilistic tabu search. ORSA J Comput 4:32–37

    Article  Google Scholar 

  11. Gagné C, Zinflou A (2012) An hybrid algorithm for the industrial car sequencing problem. In: Proceedings of the IEEE world congress on computational intelligence, Brisbane, June 2012

    Google Scholar 

  12. Garey M, Johnson DS (1979) Computer and intractability: a guide to the theory of NP-completeness. Freeman, San Francisco

    Google Scholar 

  13. Gendreau M, Potvin J-Y (2010) Handbook of metaheuristics. Volume 146 of international series in operations research & management science. Springer, New York

    Google Scholar 

  14. Gent IP (1998) Two results on car-sequencing problems. Technical report APES-02-1998

    Google Scholar 

  15. Glover F (1986) Future paths for integer programming and linkage to artificial intelligence. Comput Oper Res 13:533–549

    Article  Google Scholar 

  16. Glover F, Hanafi S (2002) Tabu search and finite convergence. Discret Appl Math 119(1–2): 3–36

    Article  Google Scholar 

  17. Grefenstette JJ (1987) Incorporating problem specific knowledge into genetic algorithms. In: Davis L (ed) Genetic algorithms and simulated annealing. Morgan Kaufmann Publishers, Los Altos, Munich. pp 42–60

    Google Scholar 

  18. Hajek B (1988) Cooling schedules for optimal annealing. Math Oper Res 13:311–329

    Article  Google Scholar 

  19. Hao J-K, Galinier P, Habib M (1999) Métaheuristiques pour l’optimisation combinatoire et l’affectation sous contraintes. Revue d’Intelligence Artificielle

    Google Scholar 

  20. Hentenryck PV, Simonis H, Dincbas H (1992) Constraint satisfaction using constraint logic programming. Artif Intell 58:113–159

    Article  Google Scholar 

  21. Jones DF, Mirrazavi SK, Tamiz M (2002) Multi-objective meta-heuristics: an overview of the current state-of-the-art. Eur J Oper Res 137(1):1–9

    Article  Google Scholar 

  22. Nguyen A (2013) Private communication. Renault R&D – Paris

    Google Scholar 

  23. Osman IH, Laporte G (1996) Metaheuristics: a bibliography. Ann Oper Res 63:513–623

    Article  Google Scholar 

  24. Perron L, Shaw P (2004) Combining forces to solve the car sequencing problem. In: Régin J-C, Rueher M (eds) CPAIOR 2004. LNCS, vol 3011. Springer, Berlin/Heidelberg, pp 225–239

    Google Scholar 

  25. Pinedo M (2008) Scheduling: theory, algorithms, and systems multi-coloring. Prentice Hall, New Jersey

    Google Scholar 

  26. Régin JC, Puget JF (1997) A filtering algorithm for global sequencing constraints. In: Smolka G (ed) Principles and practice of constraint programming. LNCS, vol 1330. Springer, Berlin/New York, pp 32–46

    Google Scholar 

  27. Respen J, Zufferey N, Amaldi E (2012) Heuristics for a multi-machine multi-objective job scheduling problem with smoothing costs. In: 1st IEEE international conference on logistics operations management, vol LOM 2012, Le Havre, 17–19 Oct 2012

    Google Scholar 

  28. Ribeiro CC, Aloise D, Noronha TF, Rocha C, Urrutia S (2008) A hybrid heuristic for a multi-objective real-life car sequencing problem with painting and assembly line constraints. Eur J Oper Res 191(3):981–992

    Article  Google Scholar 

  29. Sherali HD, Driscoll PJ (2002) On tightening the relaxations of Miller-Tucker-Zemlin formulations for asymmetric traveling salesman problems. Oper Res 50(4):656–669

    Article  Google Scholar 

  30. Solnon C, Cung VD, Nguyen A, Artigues C (2008) The car sequencing problem: overview of state-of-the-art methods and industrial case-study of the ROADEF 2005 challenge problem. Eur J Oper Res 191(3):912–927

    Article  Google Scholar 

  31. Taillard ED, Gambardella LM, Gendreau M, Potvin J-Y (2001) Adaptive memory programming: a unified view of metaheuristics. Eur J Oper Res 135:1–16

    Article  Google Scholar 

  32. Talbi E-G (2002) A taxonomy of hybrid metaheuristics. J Heuristics 8(5):541–564

    Article  Google Scholar 

  33. Webster S, Jog PD, Gupta A (1998) A genetic algorithm for scheduling job families on a single machine with arbitrary earliness/tardiness penalties and an unrestricted common due date. Int J Prod Res 36(9):2543–2551

    Article  Google Scholar 

  34. Woolsey R, Swanson HS (1975) Operations research for immediate applications. Harper and Row, New York

    Google Scholar 

  35. Zinflou A, Gagné C, Gravel M (2009) Solving the industrial car sequencing problem in a Pareto sense. In: The 12th international workshop on nature inspired distributed computing, Rome, May 2009

    Google Scholar 

  36. Zufferey N (2012) Metaheuristics: some principles for an efficient design. Comput Technol Appl 3(6):446–462

    Google Scholar 

  37. Zufferey N, Studer M, Silver EA (2006) Tabu search for a car sequencing problem. In: Proceedings of the 19th international Florida artificial intelligence research society conference, Melbourne, 11–13 May 2006, pp 457–462

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Geneva School of Economics and Management, GSEM – University of Geneva, Geneva, Switzerland

    Nicolas Zufferey

Authors
  1. Nicolas Zufferey
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Nicolas Zufferey .

Editor information

Editors and Affiliations

  1. CRISTAL Laboratory, Lille 1 University, Villeneuve d'Ascq, France

    El-Ghazali Talbi

  2. LOSI Laboratory, University of Technology of Troyes, Troyes, France

    Farouk Yalaoui

  3. LOSI Laboratory, University of Technology of Troyes, Troyes, France

    Lionel Amodeo

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer International Publishing Switzerland

About this chapter

Cite this chapter

Zufferey, N. (2016). Tabu Search Approaches for Two Car Sequencing Problems with Smoothing Constraints. In: Talbi, EG., Yalaoui, F., Amodeo, L. (eds) Metaheuristics for Production Systems. Operations Research/Computer Science Interfaces Series, vol 60. Springer, Cham. https://doi.org/10.1007/978-3-319-23350-5_8

Download citation

Publish with us

Policies and ethics

Search

Navigation