Random start local search and tabu search for a discrete lot-sizing and scheduling problem

• Tipo: Artigo em Livro de Atas de Conferência Internacional
• Data: 2004

Autores

Pereira, A (Autor) Outra; Carvalho, F (Autor) Outra; Constantino, M (Autor) Outra; Pedroso, JP (Autor) FCUP

Ata de Conferência Internacional

Título: Metaheuristics: Computer Decision-Making

Páginas: 575-600

Indexação

ISI Web of Knowledge - 0 Citações

Classificação Científica

FOS: Ciências da engenharia e tecnologias > Biotecnologia industrial

Outras Informações

ID Authenticus: P-000-D7W

DOI: 10.1007/978-1-4757-4137-7_27

Abstract (EN): In this paper we describe random start local search and tabu search for solving a multi-item, multi-machine discrete lot sizing and scheduling problem with sequence dependent changeover costs. We present two construction heuristics with a random component; one of them is purely random and another is based on the linear programming relaxation of the mixed integer programming model. They are used to generate initial solutions for random start local search and tabu search. We also propose two ways of exploring the neighborhoods, one based on a random subset of the neighborhood, and another based on exploring the whole neighborhood. Construction and improvement methods were combined on random start local search and tabu search, leading to a total of eight different methods. We present results of extensive computer experiments for analyzing the performance of all methods and their comparison with branch-and-bound, and conclude with some remarks on the different approaches to the problem.

Idioma: Inglês

Tipo (Avaliação Docente): Científica

Nº de páginas: 26