Agent-based transportation planning compared with scheduling heuristics

Here we consider the problem of dynamically assigning vehicles to transportation orders that have di¤erent time windows and should be handled in real time. We introduce a new agent-based system for the planning and scheduling of these transportation networks. Intelligent vehicle agents schedule their own routes. They interact with job agents, who strive for minimum transportation costs, using a Vickrey auction for each incoming order. We use simulation to compare the on-time delivery percentage and the vehicle utilization of an agent-based planning system to a traditional system based on OR heuristics (look-ahead rules, serial scheduling). Numerical experiments show that a properly designed multi-agent system may perform as good as or even better than traditional methods

Supply chain management: An opportunity for metaheuristics

In today’s highly competitive and global marketplace the pressure on organizations to find new ways to create and deliver value to customers grows ever stronger. In the last two decades, logistics and supply chain has moved to the center stage. There has been a growing recognition that it is through an effective management of the logistics function and the supply chain that the goal of cost reduction and service enhancement can be achieved. The key to success in Supply Chain Management (SCM) require heavy emphasis on integration of activities, cooperation, coordination and information sharing throughout the entire supply chain, from suppliers to customers. To be able to respond to the challenge of integration there is the need of sophisticated decision support systems based on powerful mathematical models and solution techniques, together with the advances in information and communication technologies. The industry and the academia have become increasingly interested in SCM to be able to respond to the problems and issues posed by the changes in the logistics and supply chain. We present a brief discussion on the important issues in SCM. We then argue that metaheuristics can play an important role in solving complex supply chain related problems derived by the importance of designing and managing the entire supply chain as a single entity. We will focus specially on the Iterated Local Search, Tabu Search and Scatter Search as the ones, but not limited to, with great potential to be used on solving the SCM related problems. We will present briefly some successful applications.Supply chain management, metaheuristics, iterated local search, tabu search and scatter search

Comparison of agent-based scheduling to look-ahead heuristics for real-time transportation problems

We consider the real-time scheduling of full truckload transportation orders with time windows that arrive during schedule execution. Because a fast scheduling method is required, look-ahead heuristics are traditionally used to solve these kinds of problems. As an alternative, we introduce an agent-based approach where intelligent vehicle agents schedule their own routes. They interact with job agents, who strive for minimum transportation costs, using a Vickrey auction for each incoming order. This approach offers several advantages: it is fast, requires relatively little information and facilitates easy schedule adjustments in reaction to information updates. We compare the agent-based approach to more traditional hierarchical heuristics in an extensive simulation experiment. We find that a properly designed multiagent approach performs as good as or even better than traditional methods. Particularly, the multi-agent approach yields less empty miles and a more stable service level

Simulation in Automated Guided Vehicle System Design

The intense global competition that manufacturing companies face today results in an increase of product variety and shorter product life cycles. One response to this threat is agile manufacturing concepts. This requires materials handling systems that are agile and capable of reconfiguration. As competition in the world marketplace becomes increasingly customer-driven, manufacturing environments must be highly reconfigurable and responsive to accommodate product and process changes, with rigid, static automation systems giving way to more flexible types. Automated Guided Vehicle Systems (AGVS) have such capabilities and AGV functionality has been developed to improve flexibility and diminish the traditional disadvantages of AGV-systems. The AGV-system design is however a multi-faceted problem with a large number of design factors of which many are correlating and interdependent. Available methods and techniques exhibit problems in supporting the whole design process. A research review of the work reported on AGVS development in combination with simulation revealed that of 39 papers only four were industrially related. Most work was on the conceptual design phase, but little has been reported on the detailed simulation of AGVS. Semi-autonomous vehicles (SA V) are an innovative concept to overcome the problems of inflexible -systems and to improve materials handling functionality. The SA V concept introduces a higher degree of autonomy in industrial AGV -systems with the man-in-the-Ioop. The introduction of autonomy in industrial applications is approached by explicitly controlling the level of autonomy at different occasions. The SA V s are easy to program and easily reconfigurable regarding navigation systems and material handling equipment. Novel approaches to materials handling like the SA V -concept place new requirements on the AGVS development and the use of simulation as a part of the process. Traditional AGV -system simulation approaches do not fully meet these requirements and the improved functionality of AGVs is not used to its full power. There is a considerflble potential in shortening the AGV -system design-cycle, and thus the manufacturing system design-cycle, and still achieve more accurate solutions well suited for MRS tasks. Recent developments in simulation tools for manufacturing have improved production engineering development and the tools are being adopted more widely in industry. For the development of AGV -systems this has not fully been exploited. Previous research has focused on the conceptual part of the design process and many simulation approaches to AGV -system design lack in validity. In this thesis a methodology is proposed for the structured development of AGV -systems using simulation. Elements of this methodology address the development of novel functionality. The objective of the first research case of this research study was to identify factors for industrial AGV -system simulation. The second research case focuses on simulation in the design of Semi-autonomous vehicles, and the third case evaluates a simulation based design framework. This research study has advanced development by offering a framework for developing testing and evaluating AGV -systems, based on concurrent development using a virtual environment. The ability to exploit unique or novel features of AGVs based on a virtual environment improves the potential of AGV-systems considerably.University of Skovde. European Commission for funding the INCO/COPERNICUS Projec

Optimal Ship Maintenance Scheduling Under Restricted Conditions and Constrained Resources

The research presented in this dissertation addresses the application of evolution algorithms, i.e. Genetic Algorithm (GA) and Differential Evolution algorithm (DE) to scheduling problems in the presence of restricted conditions and resource limitations. This research is motivated by the scheduling of engineering design tasks in shop scheduling problems and ship maintenance scheduling problems to minimize total completion time. The thesis consists of two major parts; the first corresponds to the first appended paper and deals with the computational complexity of mixed shop scheduling problems. A modified Genetic algorithm is proposed to solve the problem. Computational experiments, conducted to evaluate its performance against known optimal solutions for different sized problems, show its superiority in computation time and the high applicability in practical mixed shop scheduling problems. The second part considers the major theme in the second appended paper and is related to the ship maintenance scheduling problem and the extended research on the multi-mode resource-constrained ship scheduling problem. A heuristic Differential Evolution is developed and applied to solve these problems. A mathematical optimization model is also formulated for the multi-mode resource-constrained ship scheduling problem. Through the computed results, DE proves its effectiveness and efficiency in addressing both single and multi-objective ship maintenance scheduling problem

Modeling and Solving Flow Shop Scheduling Problem Considering Worker Resource

In this paper, an uninterrupted hybrid flow scheduling problem is modeled under uncertainty conditions. Due to the uncertainty of processing time in workshops, fuzzy programming method has been used to control the parameters of processing time and preparation time. In the proposed model, there are several jobs that must be processed by machines and workers, respectively. The main purpose of the proposed model is to determine the correct sequence of operations and assign operations to each machine and each worker at each stage, so that the total completion time (Cmax) is minimized. Also this paper, fuzzy programming method is used for control unspecified parameter has been used from GAMS software to solve sample problems. The results of problem solving in small and medium dimensions show that with increasing uncertainty, the amount of processing time and consequently the completion time increases. Increases from the whole work. On the other hand, with the increase in the number of machines and workers in each stage due to the high efficiency of the machines, the completion time of all works has decreased. Innovations in this paper include uninterrupted hybrid flow storage scheduling with respect to fuzzy processing time and preparation time in addition to payment time. The allocation of workers and machines to jobs is another innovation of this article

A real-time simulation-based optimisation environment for industrial scheduling

n order to cope with the challenges in industry today, such as changes in product diversity and production volume, manufacturing companies are forced to react more flexibly and swiftly. Furthermore, in order for them to survive in an ever-changing market, they also need to be highly competitive by achieving near optimal efficiency in their operations. Production scheduling is vital to the success of manufacturing systems in industry today, because the near optimal allocation of resources is essential in remaining highly competitive. The overall aim of this study is the advancement of research in manufacturing scheduling through the exploration of more effective approaches to address complex, real-world manufacturing flow shop problems. The methodology used in the thesis is in essence a combination of systems engineering, algorithmic design and empirical experiments using real-world scenarios and data. Particularly, it proposes a new, web services-based, industrial scheduling system framework, called OPTIMISE Scheduling System (OSS), for solving real-world complex scheduling problems. OSS, as implemented on top of a generic web services-based simulation-based optimisation (SBO) platform called OPTIMISE, can support near optimal and real-time production scheduling in a distributed and parallel computing environment. Discrete-event simulation (DES) is used to represent and flexibly cope with complex scheduling problems without making unrealistic assumptions which are the major limitations of existing scheduling methods proposed in the literature. At the same time, the research has gone beyond existing studies of simulation-based scheduling applications, because the OSS has been implemented in a real-world industrial environment at an automotive manufacturer, so that qualitative evaluations and quantitative comparisons of scheduling methods and algorithms can be made with the same framework. Furthermore, in order to be able to adapt to and handle many different types of real-world scheduling problems, a new hybrid meta-heuristic scheduling algorithm that combines priority dispatching rules and genetic encoding is proposed. This combination is demonstrated to be able to handle a wider range of problems or a current scheduling problem that may change over time, due to the flexibility requirements in the real-world. The novel hybrid genetic representation has been demonstrated effective through the evaluation in the real-world scheduling problem using real-world data

Stochastic flow shop scheduling model for the Panama Canal

The Panama Canal can be modeled as a stochastic flexible flow shop for the purpose of scheduling. A metaheuristic stochastic optimization method (Nested Partition) was used to determine if current scheduling practices could be improved by reducing the makespan for vessel traffic. Results indicate that classifying the vessels according to the time that they spend transiting the canal and using some rules and metaheuristic technique for parallel flow shop improves the makespan. The schedules produced by this method show distinct patterns as described by the sequence of vessel types

Robust Aircraft Squadron Scheduling in the Face of Absenteeism

Air Force fighter aircraft squadrons the world over share a unique problem. Each requires complex training schedules coupling aircraft to pilots, the duo to missions and airspaces, and then the entire combination to a feasible time slot. Creating daily and weekly flight schedules that include shifts around the clock every day of the year with a set number of pilots is a time consuming job for manual schedulers within a squadron. Complicating matters is absenteeism. If one or more pilots are unable to perform their previously assigned tasks, due to sickness, aircraft failure, or reassignment, those tasks must be performed by pilots that were not previously scheduled. These changes can not conflict with the rules of Air Force regulations, squadron policy, the squadron commander, operations officer or flight training officer’s direction. Given these constraints, the goal of a new re-rostered schedule, in the event of absenteeism, should be to affect the previous schedule as little as possible. This research will develop a weekly flight schedule. The goal of this reformulated schedule is robustness to absenteeism. In order to find a robust schedule, a comparison will be done to select the most robust schedule from among 17 candidate schedules. The expected values for the number of changes for each schedule are compared, and a general conclusion will be provided using a new objective function to create a model that yields a robust schedule on the first attempt

Bottleneck Management through Strategic Sequencing in Smart Manufacturing Systems

Nowadays, industries put a significant emphasis on finding the optimum order for carrying out jobs in sequence. This is a crucial element in determining net productivity. Depending on the demand criterion, all production systems, including flexible manufacturing systems, follow a predefined sequence of job-based machine operations. The complexity of the problem increases with increasing machines and jobs to sequence, demanding the use of an appropriate sequencing technique. The major contribution of this work is to modify an existing algorithm with a very unusual machine setup and find the optimal sequence which will really minimize the makespan. This custom machine setup completes all tasks by maintaining precedence and satisfying all other constraints. This thesis concentrates on identifying the most effective technique of sequencing which will be validated in a lab environment and a simulated environment. It illustrates some of the key methods of addressing a circular non permutation flow shop sequencing problem with some additional constraints. Additionally, comparisons among the various heuristics algorithms are presented based on different sequencing criteria. The optimum sequence is provided as an input to a real-life machine set up and a simulated environment for selecting the best performing algorithm which is the basic goal of this research. To achieve this goal, at first, a code using python programming language was generated to find an optimum sequence. By analyzing the results, the makespan is increasing with the number of jobs but additional pallet constraint shows, adding more pallets will help to reduce makespan for both flow shops and job shops. Though the sequence obtained from both algorithms is different, for flow shops the makespan remains same for both cases but in the job shop scenario Nawaz, Enscore and Ham (NEH) algorithms always perform better than Campbell Dudek Smith (CDS) algorithms. For job shops with different combinations the makespan decreases mostly for maximum percentage of easy category jobs combined with equal percentage of medium and complex category jobs