Results for "metaheuristics" : Scipedia

Revista Internacional de Métodos Numéricos para Cálculo y Diseño en Ingeniería

A memetic algorithm based on Artificial Bee Colony for optimal synthesis of mechanisms

Abstract

In this paper a novel proposal of a modular hybrid algorithm as a tool for solving real-world engineering problems is presented. A memetic algorithm, MemMABC, is implemented with this approach and applied to solve two case studies of mechanism design, in order to evaluate its efficiency [...]

638
read

Optimum project of cantilever retaining wall using Search Group Algorithm and Backtracking Search Algorithm

Abstract

This paper investigates the performance of the metaheuristic algorithms Search Group Algorithm (SGA) and Backtracking Search Algorithm (BSA) on the optimum design of a cantilever retaining walls. Based on the studies of the literature, dimensional and structural design [...]

0
read

Enfoque UTE - Scientific Engineering Journal

Parametric Analysis of BFOA for Minimization Problems Using a Benchmark Function

Abstract

This paper presents the social foraging behavior of Escherichia coli (E. Coli) bacteria based on Bacteria Foraging Optimization algorithms (BFOA) to find optimization and distributed control values. The search strategy for E. coli is very complex to express and the dynamics of the [...]

2
read

Collection of open reports in transport research

Heuristics for NP-hard optimization problems

Abstract

"jats:p" We provide several examples showing that local search, the most basic metaheuristics, may be a very competitive choice for solving computationally hard optimization problems. In addition, generation of starting solutions by greedy heuristics should be at least considered [...]

1
read

Imran Ali Chaudhry's personal collection

A research survey: review of flexible job shop scheduling techniques

Abstract

In the last 25 years, extensive research has been carried out addressing the flexible job shop scheduling (JSS) problem. A variety of techniques ranging from exact methods to hybrid techniques have been used in this research. The paper aims at presenting the development of flexible [...]

3
read

Collection of open chapters of books in transport research

Genetic Algorithms Applied to Air Traffic Management

Abstract

International audience; The constant increase in air traffic, since the beginning of the commercial aviation, has led to problems of saturation on airports, approaching areas,or higher airspace.Whereas the aircraft are largely optimized and automated, the air traffic control is still [...]

1
read

Collection of open chapters of books in transport research

Recent developments of metaheuristics

Abstract

International audience; To sustain the rapidly increasing air traffic demand, the future air traffic management system will rely on a concept, called Trajectory-Based Operations (TBO), that will require aircraft to follow an assigned 4D trajectory (time-constrained trajectory) with [...]

0
read

Collection of open thesis in transport research

Racionalización de la red de autobuses de tránsito rápido (BRT): análisis de diferentes objetivos : aplicación a la ciudad de México

Abstract

El objetivo de la tesis es diseñar un método metaheurístico basado en búsqueda tabú para resolver el problema del transporte BRT en el Distrito Federal con dos objetivos. Se propone aplicar técnicas metaheurísticas a problemas de optimización reales en el sector transporte. [...]

0
read

Collection of closed articles in transport research

Hybrid simulated annealing and tabu search method for the electric travelling salesman problem with time windows and mixed charging rates

Abstract

The electric travelling salesman problem with time windows (ETSPTW) is an extension of the well-known travelling salesman problem with time windows (TSPTW). The ETSPTW additionally considers recharging operations of the electric vehicle at identical charging stations. However, different charging technologies used at public or private stations result in different charging times of the electric vehicles. Therefore, this study extends the ETSPTW by additionally considering charging operations at customer locations with different charging rates, called hereafter the electric travelling salesman problem with time windows and mixed charging rates (ETSPTW-MCR). To the best of our knowledge, this is the first study that considers both private and public charging stations for the ETSPTW. In addition to the extended version of the ETSPTW, this paper introduces a new and effective hybrid Simulated Annealing/Tabu Search (SA/TS) algorithm to solve the ETSPTW-MCR problem efficiently. Distinct from the existing hybridization of SA and TS, the proposed hybrid SA/TS algorithm employs efficient search procedures based on the TSPTW restrictions, a modified solution acceptance criterion, and an advanced tabu list structure. Moreover, an improved dynamic programming procedure is integrated to optimally find the charging station visits in shorter computational times. The proposed hybrid SA/TS is tested on several TSPTW and ETSPTW benchmark problems and compared with well-known solution approaches. Results of these experiments show that the proposed algorithm outperforms the other considered competitor algorithms both with regard to solution quality and computational time. Furthermore, 26 new best results are obtained for the ETSPTW instances. In addition, the hybrid algorithm is applied to a new problem set generated for the ETSPTW-MCR by extending the ETSPTW problems found in the literature. Comparisons with the ETSPTW results show that significant distance savings are found for most of the instances by charging the electric vehicle at customer locations. As a result of the computational studies, it should be concluded that the proposed algorithm is capable of finding efficient and more realistic route plans for the electric vehicles. ispartof: EXPERT SYSTEMS WITH APPLICATIONS vol:134 pages:279-303 status: Published online

Abstract

2
read