A Hybrid Pareto Based Multi Objective Evolutionary Algorithm for a Partial Flexible Open-Shop Scheduling Problem

Shortest path problem (SPP) has various applications in areas such as telecommunications, transportation and emergency services, and postal services among others. As a result, several algorithms have been developed to solve the SPP and related problems. The current paper extends the TANYAKUMU labelling method for solving the Travelling salesman problem (TSP) to solve SPP in directed transportation networks. Numerical illustrations are used to prove the validity of the proposed method. The main contributions of this paper are as follows: (i) modification of TSP algorithm to solve single source SPP, (ii) the developed method numerically evaluated on four increasingly complex problems of sizes 11×11, 21×21, 23×23 and 26×26 and lastly (iii) the solutions obtained from solving these four problems are compared with those obtained by Minimum incoming weight label (MIWL) algorithm. The proposed algorithm computed the same shortest paths as the MIWL algorithm on all four problems.

show abstract

Método de construcción de dígrafos a partir de redes viales reales en mapas digitales con aplicaciones en la búsqueda de rutas óptimas

Ortega

López-Sauceda

Carrillo

et al. 2019

Inf. constr.

View full text Add to dashboard Cite

Actualmente las redes viales en zonas urbanas sufren obstrucciones, ya sea por manifestaciones, embotellamientos, u otro tipo de bloqueo, causando el cierre momentáneo o permanente de vías o zonas de tránsito que obligan a conductores a establecer nuevas rutas. Una solución es la creación de rutas alternativas en mapas digitales a partir de dígrafos relacionados con las características de una red vial real, y la aplicación de algoritmos de optimización de rutas. En este trabajo se propone un método para construir dígrafos con una aplicación en la API de Google Maps en la extracción visual de elementos como vértices (intersecciones), aristas (calles) y flechas de sentido (dirección vial), lo que permite la aplicación del algoritmo de Dijkstra en busca de rutas alternativas.

show abstract

scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.

Contact Info

customersupport@researchsolutions.com

10624 S. Eastern Ave., Ste. A-614

Henderson, NV 89052, USA

This site is protected by reCAPTCHA and the Google Privacy Policy and Terms of Service apply.

Blog Terms and Conditions API Terms Privacy Policy Contact Cookie Preferences Do Not Sell or Share My Personal Information

Made with 💙 for researchers

Part of the Research Solutions Family.

A Hybrid Pareto Based Multi Objective Evolutionary Algorithm for a Partial Flexible Open-Shop Scheduling Problem

Cited by 3 publications

References 25 publications

Mapping of Optimum Freight Route by Using Hybrid VNS Algorithm to Sustain the Economic Viability of a Landslide Prone Area: A Case Study of Tripura

Mapping of Optimum Freight Route by Using Hybrid VNS Algorithm to Sustain the Economic Viability of a Landslide Prone Area: A Case Study of Tripura

Extended TANYAKUMU Labelling Method to Compute Shortest Paths in Directed Networks

Método de construcción de dígrafos a partir de redes viales reales en mapas digitales con aplicaciones en la búsqueda de rutas óptimas

Contact Info

Product

Resources

About