Using metaheuristics in solving dispatching problems

Using metaheuristics in solving dispatching problems

0.00 Avg rating0 Votes
Article ID: iaor1996514
Country: Belgium
Volume: 34
Start Page Number: 33
End Page Number: 62
Publication Date: Jun 1994
Journal: Belgian Journal of Operations Research, Statistics and Computer Science
Authors:
Keywords: programming: travelling salesman, heuristics, optimization: simulated annealing
Abstract:

This paper presents some aspects of delivery routes organization in companies. It also explains why metaheuristics can be very useful for dispatching computerization. Two main metaheuristics are presented: Tabu Search and Simulated Annealing. The paper briefly presents the way simple metaheuristics can be adapted to ‘solve’ real problems, which are remote from standardized ones such as T.S.P. The approach is illustrated by its application to a case with time windows constraints.

Reviews

Required fields are marked *. Your email address will not be published.