fr
Chapitre de livre
Anglais

All-terrain tabu search approaches for production management problems

Date de publication2018
Résumé

A metaheuristic is a refined solution method able to find a satisfying solution to a difficult problem in a reasonable amount of time. A local search metaheuristic works on a single solution and tries to improve it iteratively. Tabu search is one of the most famous local search, where at each iteration, a neighbor solution is generated from the current solution by performing a specific modification (called a move) on the latter. The goal of this chapter is to present tabu search approaches with enhanced exploration and exploitationmechanisms. For this purpose, the following ingredients are discussed: different neighborhood structures (i.e., different types of moves), guided restarts based on a distance function, and deconstruction/reconstruction techniques. The resulting all-terrain tabu search approaches are illustrated for various production problems: car sequencing, job scheduling, resource allocation, and inventory management.

Citation (format ISO)
ZUFFEREY, Nicolas, RESPEN, Jean, THEVENIN, Simon. All-terrain tabu search approaches for production management problems. In: Recent Development of Metaheuristics. [s.l.] : [s.n.], 2018.
Fichiers principaux (1)
Book chapter (Accepted version)
accessLevelPrivate
Identifiants
  • PID : unige:100778
ISBN978-3-319-58252-8
457vues
0téléchargements

Informations techniques

Création14.12.2017 19:20:00
Première validation14.12.2017 19:20:00
Heure de mise à jour15.03.2023 07:41:52
Changement de statut15.03.2023 07:41:51
Dernière indexation17.01.2024 01:56:15
All rights reserved by Archive ouverte UNIGE and the University of GenevaunigeBlack