Guided restarting local search for production planning

نویسندگان

  • Gregor Papa
  • Vida Vukasinovic
  • Peter Korosec
چکیده

Planning problems can be solved with a large variety of different approaches, and a significant amount of work has been devoted to the automation of planning processes using different kinds of methods. This paper focuses on the use of specific local search algorithms for real-world production planning based on experiments with real-world data, and presents an adapted local search guided by evolutionary metaheuristics. To make algorithms efficient, many specifics need to be considered and included in the problem solving. We demonstrate that the use of specialized local searches can significantly improve the convergence and efficiency of the algorithm. The paper also includes an experimental study of the efficiency of two memetic algorithms, and presents a real-world software implementation for the production planning. & 2011 Elsevier Ltd. All rights reserved.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A new memetic algorithm for mitigating tandem automated guided vehicle system partitioning problem

Automated Guided Vehicle System (AGVS) provides the flexibility and automation demanded by Flexible Manufacturing System (FMS). However, with the growing concern on responsible management of resource use, it is crucial to manage these vehicles in an efficient way in order reduces travel time and controls conflicts and congestions. This paper presents the development process of a new Memetic Alg...

متن کامل

Improving Plan Quality through Heuristics for Guiding and Pruning the Search: A Study Using LAMA

Admissible heuristics are essential for optimal planning in the context of search algorithms like A*, and they can also be used in the context of suboptimal planning in order to find quality-bounded solutions. In satisfacing planning, on the other hand, admissible heuristics are not exploited by the best-first search algorithms of existing planners even when a time window is available for impro...

متن کامل

Predicting Normal People’s Reaction Time based on Hippocampal Local Efficiency During a Memory-Guided Attention Task

Background: There are some convincing shreds of evidence indicating that memory can direct attention. The local efficiency of an area in the brain, as a quantitative feature in a complex network, indicates how the surrounding nodes can transfer the information when a specific node is omitted. This feature is a scale for measuring efficient integration of information in the brain. Objectives:...

متن کامل

Using memetic algorithms with guided local search to solve assembly sequence planning

The goal of assembly planning consists in generating feasible sequences to assemble a product and selecting an efficient assembly sequence from which related constraint factors such as geometric features, assembly time, tools, and machines are considered to arrange a feasible assembly sequence based on planner’s individual heuristics. Suchlike planning may implement genetic algorithms to go tow...

متن کامل

A vehicle routing problem with backhauls and time windows: a guided local search solution

This paper presents a guided local search heuristic to solve a vehicle routing problem with backhauls and time windows. The VRPBTW with and without customer precedence are both considered. Customer precedence requires that all linehaul customers be visited before any backhaul customer. The basic approach is to construct an initial infeasible solution and then use a guided local search to improv...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Eng. Appl. of AI

دوره 25  شماره 

صفحات  -

تاریخ انتشار 2012