• Home
  1. Home
  2. Multiple Neighborhoods in Tabu Search: Successful Applications for Operations Management
Proceedings chapter
English

Multiple Neighborhoods in Tabu Search: Successful Applications for Operations Management

Contributors

Zufferey, Nicolas

Presented at

Dubrovnik, 22-24 October 2015

Published in

Tihomir Vranešević (Ed.), 2015 M-Sphere Book of Papers: selected papers presented at 4th International M-Sphere Conference for Multidisciplinarity in Science and Business, p. 12-24

Publisher

Zagreb : M-Sphere

Publication date

2015

Abstract

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. In contrast with most of the existing literature, the goal of this paper is to present tabu search approaches where different neighborhood structures (i.e., different types of moves) are jointly used. The discussion is illustrated for various operations management problems: truck loading, job scheduling, inventory management, and dimensioning of assembly lines.

Keywords

  • Optimization
  • Operations management
  • Tabu search
  • Metaheuristics

UNIGE affiliation entities

Citation (ISO format)

ZUFFEREY, Nicolas. Multiple Neighborhoods in Tabu Search: Successful Applications for Operations Management. In: 2015 M-Sphere Book of Papers: selected papers presented at 4th International M-Sphere Conference for Multidisciplinarity in Science and Business. Tihomir Vranešević (Ed.). Dubrovnik. Zagreb : M-Sphere, 2015. p. 12–24.

Main files (1)

Proceedings chapter (Accepted version)

Identifiers

  • PID : unige:79974

Additional URL for this publication

https://issuu.com/tvranes/docs/2015_m-sphere_book_of_papers/5?e=0/32938325

ISBN

978-953-7930-08-0
498views
0downloads

Technical informations

Creation

06/01/2016 13:37:00

First validation

06/01/2016 13:37:00

Update

14/05/2025 07:05:45

Status update

14/05/2025 07:05:45

Last indexation

14/05/2025 07:05:46
All rights reserved by Archive ouverte UNIGE and the University of Geneva
OpenAIRE Indexed & Validated