2,851 research outputs found

    Multi-objective evolutionary algorithms for optimal scheduling

    Get PDF
    The research topic of the thesis is the extension of evolutionary multi-objective optimization for real-world scheduling problems. Several novel algorithms are proposed: the diversity indicator-based multi-objective evolutionary algorithm (DI-MOEA) can achieve a uniformly distributed solution set; the preference-based MOEA can obtain preferred solutions; the edge-rotated cone can improve the performance of MOEAs for many-objective optimization; and dynamic MOEA takes the stability as an extra objective. Besides the classical flexible job shop scheduling, the thesis proposes solutions for the novel problem domain of vehicle fleet maintenance scheduling optimization (VFMSO). The problem originated from the CIMPLO (Cross-Industry Predictive Maintenance Optimization Platform) project and the project partners Honda and KLM. The VFMSO problem is to determine the maintenance schedule for the vehicle fleet, meaning to find the best maintenance order, location and time for each component in the vehicle fleet based on the predicted remaining useful lifetimes of components and conditions of available workshops. The maintenance schedule is optimized to bring business advantages to industries, i.e., to reduce maintenance time, increase safety and save repair expenses. After formulating the problem as a scalable benchmark in an industrially relevant setting, the proposed algorithms have been successfully used to solve VFMSO problem instances.This work is part of the research programme Smart Industry SI2016 with project name CIMPLO and project number 15465, which is (partly) financed by the Netherlands Organisation for Scientific Research (NWO)Algorithms and the Foundations of Software technolog

    On green routing and scheduling problem

    Full text link
    The vehicle routing and scheduling problem has been studied with much interest within the last four decades. In this paper, some of the existing literature dealing with routing and scheduling problems with environmental issues is reviewed, and a description is provided of the problems that have been investigated and how they are treated using combinatorial optimization tools

    Forecasting Recharging Demand to Integrate Electric Vehicle Fleets in Smart Grids

    Get PDF
    Electric vehicle fleets and smart grids are two growing technologies. These technologies provided new possibilities to reduce pollution and increase energy efficiency. In this sense, electric vehicles are used as mobile loads in the power grid. A distributed charging prioritization methodology is proposed in this paper. The solution is based on the concept of virtual power plants and the usage of evolutionary computation algorithms. Additionally, the comparison of several evolutionary algorithms, genetic algorithm, genetic algorithm with evolution control, particle swarm optimization, and hybrid solution are shown in order to evaluate the proposed architecture. The proposed solution is presented to prevent the overload of the power grid

    Network Topology and Time Criticality Effects in the Modularised Fleet Mix Problem

    Get PDF
    In this paper, we explore the interplay between network topology and time criticality in a military logistics system. A general goal of this work (and previous work) is to evaluate land transportation requirements or, more specifically, how to design appropriate fleets of military general service vehicles that are tasked with the supply and re-supply of military units dispersed in an area of operation. The particular focus of this paper is to gain a better understanding of how the logistics environment changes when current Army vehicles with fixed transport characteristics are replaced by a new generation of modularised vehicles that can be configured task-specifically. The experimental work is conducted within a well developed strategic planning simulation environment which includes a scenario generation engine for automatically sampling supply and re-supply missions and a multi-objective meta-heuristic search algorithm (i.e. Evolutionary Algorithm) for solving the particular scheduling and routing problems. The results presented in this paper allow for a better understanding of how (and under what conditions) a modularised vehicle fleet can provide advantages over the currently implemented system

    Applications of Genetic Algorithm and Its Variants in Rail Vehicle Systems: A Bibliometric Analysis and Comprehensive Review

    Get PDF
    Railway systems are time-varying and complex systems with nonlinear behaviors that require effective optimization techniques to achieve optimal performance. Evolutionary algorithms methods have emerged as a popular optimization technique in recent years due to their ability to handle complex, multi-objective issues of such systems. In this context, genetic algorithm (GA) as one of the powerful optimization techniques has been extensively used in the railway sector, and applied to various problems such as scheduling, routing, forecasting, design, maintenance, and allocation. This paper presents a review of the applications of GAs and their variants in the railway domain together with bibliometric analysis. The paper covers highly cited and recent studies that have employed GAs in the railway sector and discuss the challenges and opportunities of using GAs in railway optimization problems. Meanwhile, the most popular hybrid GAs as the combination of GA and other evolutionary algorithms methods such as particle swarm optimization (PSO), ant colony optimization (ACO), neural network (NN), fuzzy-logic control, etc with their dedicated application in the railway domain are discussed too. More than 250 publications are listed and classified to provide a comprehensive analysis and road map for experts and researchers in the field helping them to identify research gaps and opportunities
    corecore