Redirigiendo al acceso original de articulo en 18 segundos...
Inicio  /  Algorithms  /  Vol: 16 Par: 12 (2023)  /  Artículo
ARTÍCULO
TITULO

Solving NP-Hard Challenges in Logistics and Transportation under General Uncertainty Scenarios Using Fuzzy Simheuristics

Angel A. Juan    
Markus Rabe    
Majsa Ammouriova    
Javier Panadero    
David Peidro and Daniel Riera    

Resumen

In the field of logistics and transportation (L&T), this paper reviews the utilization of simheuristic algorithms to address NP-hard optimization problems under stochastic uncertainty. Then, the paper explores an extension of the simheuristics concept by introducing a fuzzy layer to tackle complex optimization problems involving both stochastic and fuzzy uncertainties. The hybrid approach combines simulation, metaheuristics, and fuzzy logic, offering a feasible methodology to solve large-scale NP-hard problems under general uncertainty scenarios. These scenarios are commonly encountered in L&T optimization challenges, such as the vehicle routing problem or the team orienteering problem, among many others. The proposed methodology allows for modeling various problem components?including travel times, service times, customers? demands, or the duration of electric batteries?as deterministic, stochastic, or fuzzy items. A cross-problem analysis of several computational experiments is conducted to validate the effectiveness of the fuzzy simheuristic methodology. Being a flexible methodology that allows us to tackle NP-hard challenges under general uncertainty scenarios, fuzzy simheuristics can also be applied in fields other than L&T.

 Artículos similares

       
 
Patcharin Buayen and Jeeraporn Werapun    
The multiple knapsack problem (0/1-mKP) is a valuable NP-hard problem involved in many science-and-engineering applications. In current research, there exist two main approaches: 1. the exact algorithms for the optimal solutions (i.e., branch-and-bound, ... ver más
Revista: Algorithms

 
Xinyi Yang, Ziyi Wang, Hengxi Zhang, Nan Ma, Ning Yang, Hualin Liu, Haifeng Zhang and Lei Yang    
Combinatorial optimization problems (COPs) are a class of NP-hard problems with great practical significance. Traditional approaches for COPs suffer from high computational time and reliance on expert knowledge, and machine learning (ML) methods, as powe... ver más
Revista: Algorithms

 
Aaron Barbosa, Elijah Pelofske, Georg Hahn and Hristo N. Djidjev    
Quantum annealers, such as the device built by D-Wave Systems, Inc., offer a way to compute solutions of NP-hard problems that can be expressed in Ising or quadratic unconstrained binary optimization (QUBO) form. Although such solutions are typically of ... ver más
Revista: Algorithms

 
Serafino Cicerone and Gabriele Di Stefano    
The mixture of data in real life exhibits structure or connection property in nature. Typical data include biological data, communication network data, image data, etc. Graphs provide a natural way to represent and analyze these types of data and their r... ver más
Revista: Algorithms

 
BongJoo Jeong, Jun-Hee Han and Ju-Yong Lee    
This study considers a scheduling problem for a flow shop with urgent jobs and limited waiting times. The urgent jobs and limited waiting times are major considerations for scheduling in semiconductor manufacturing systems. The objective function is to m... ver más
Revista: Algorithms