FRINK Linked Data Fragments server

Matches in SemOpenAlex for { <https://semopenalex.org/work/W2947950562> ?p ?o ?g. }

• W2947950562 endingPage "74924" @default.
• W2947950562 startingPage "74909" @default.
• W2947950562 abstract "Usually, machine and automated guided vehicle (AGV) scheduling are studied simultaneously. However, previous studies often used a fixed number of AGVs or did not consider routing problems and transportation time. This paper focuses on the machine and AGV scheduling problem in a flexible manufacturing system by simultaneously considering the optimal number of AGVs, the shortest transportation time, a path planning problem, and a conflict-free routing problem (CFRP). To study these problems simultaneously, we propose a genetic algorithm combined with the Dijkstra algorithm that is based on a time window. The tri-string chromosome coding method is designed to ensure that the solutions are feasible after the genetic operator has been applied. Global, local, and random searches are adopted in reasonable proportions to improve the quality and diversity of the initial population. The Dijkstra algorithm based on the time window is embedded into the genetic algorithm to search for the shortest route, detect collisions for multiple vehicles simultaneously, and finally, solve the shortest CFRP. The objective is to minimize the makespan while considering the influence of the number of AGVs. Increasing the number of AGVs has a significant impact on the makespan in the initial stage. However, the makespan tends to stabilize as the number of AGVs reaches some threshold. To balance the relationship between the minimum makespan and the optimal number of AGVs, we set the minimum decrease rate to 5% when determining the minimum makespan and confirming the corresponding number of AGVs to be the optimal value. In this paper, to verify the effectiveness of our approach, we propose two sets of computational experiments. The first set of results shows that the proposed algorithm is as efficient and effective at solving the scheduling problem as the benchmark approaches. The second set of computational experiments indicates that the proposed approach is applicable for solving integrated scheduling problems in flexible manufacturing systems." @default.
• W2947950562 created "2019-06-07" @default.
• W2947950562 creator A5023475171 @default.
• W2947950562 creator A5024316677 @default.
• W2947950562 creator A5060335491 @default.
• W2947950562 creator A5062307604 @default.
• W2947950562 creator A5069821717 @default.
• W2947950562 date "2019-01-01" @default.
• W2947950562 modified "2023-10-10" @default.
• W2947950562 title "Approach to Integrated Scheduling Problems Considering Optimal Number of Automated Guided Vehicles and Conflict-Free Routing in Flexible Manufacturing Systems" @default.
• W2947950562 cites W1551740464 @default.
• W2947950562 cites W1890212682 @default.
• W2947950562 cites W1965618732 @default.
• W2947950562 cites W1969120386 @default.
• W2947950562 cites W1983350566 @default.
• W2947950562 cites W2009747959 @default.
• W2947950562 cites W2017462525 @default.
• W2947950562 cites W2018545447 @default.
• W2947950562 cites W2021709881 @default.
• W2947950562 cites W2025582715 @default.
• W2947950562 cites W2030370304 @default.
• W2947950562 cites W2036338518 @default.
• W2947950562 cites W2037277508 @default.
• W2947950562 cites W2044456402 @default.
• W2947950562 cites W2046678043 @default.
• W2947950562 cites W2061424608 @default.
• W2947950562 cites W2064563962 @default.
• W2947950562 cites W2067884717 @default.
• W2947950562 cites W2068142293 @default.
• W2947950562 cites W2074892100 @default.
• W2947950562 cites W2082699240 @default.
• W2947950562 cites W2105060405 @default.
• W2947950562 cites W2109586413 @default.
• W2947950562 cites W2110169180 @default.
• W2947950562 cites W2116577034 @default.
• W2947950562 cites W2119926658 @default.
• W2947950562 cites W2123986336 @default.
• W2947950562 cites W2126496459 @default.
• W2947950562 cites W2135997825 @default.
• W2947950562 cites W2147541698 @default.
• W2947950562 cites W2168291556 @default.
• W2947950562 cites W2233663212 @default.
• W2947950562 cites W2344852273 @default.
• W2947950562 cites W2582693844 @default.
• W2947950562 cites W2593221340 @default.
• W2947950562 cites W2604280268 @default.
• W2947950562 cites W2605359652 @default.
• W2947950562 cites W2737607509 @default.
• W2947950562 cites W2786026826 @default.
• W2947950562 cites W2790365984 @default.
• W2947950562 cites W4243867916 @default.
• W2947950562 cites W4253331343 @default.
• W2947950562 cites W597432580 @default.
• W2947950562 cites W653441760 @default.
• W2947950562 doi "https://doi.org/10.1109/access.2019.2919109" @default.
• W2947950562 hasPublicationYear "2019" @default.
• W2947950562 type Work @default.
• W2947950562 sameAs 2947950562 @default.
• W2947950562 citedByCount "42" @default.
• W2947950562 countsByYear W29479505622020 @default.
• W2947950562 countsByYear W29479505622021 @default.
• W2947950562 countsByYear W29479505622022 @default.
• W2947950562 countsByYear W29479505622023 @default.
• W2947950562 crossrefType "journal-article" @default.
• W2947950562 hasAuthorship W2947950562A5023475171 @default.
• W2947950562 hasAuthorship W2947950562A5024316677 @default.
• W2947950562 hasAuthorship W2947950562A5060335491 @default.
• W2947950562 hasAuthorship W2947950562A5062307604 @default.
• W2947950562 hasAuthorship W2947950562A5069821717 @default.
• W2947950562 hasBestOaLocation W29479505621 @default.
• W2947950562 hasConcept C123784306 @default.
• W2947950562 hasConcept C126255220 @default.
• W2947950562 hasConcept C132525143 @default.
• W2947950562 hasConcept C144024400 @default.
• W2947950562 hasConcept C149923435 @default.
• W2947950562 hasConcept C154945302 @default.
• W2947950562 hasConcept C173870130 @default.
• W2947950562 hasConcept C206729178 @default.
• W2947950562 hasConcept C22590252 @default.
• W2947950562 hasConcept C2776068756 @default.
• W2947950562 hasConcept C2908647359 @default.
• W2947950562 hasConcept C31258907 @default.
• W2947950562 hasConcept C33923547 @default.
• W2947950562 hasConcept C41008148 @default.
• W2947950562 hasConcept C55416958 @default.
• W2947950562 hasConcept C74172769 @default.
• W2947950562 hasConcept C79403827 @default.
• W2947950562 hasConcept C80444323 @default.
• W2947950562 hasConceptScore W2947950562C123784306 @default.
• W2947950562 hasConceptScore W2947950562C126255220 @default.
• W2947950562 hasConceptScore W2947950562C132525143 @default.
• W2947950562 hasConceptScore W2947950562C144024400 @default.
• W2947950562 hasConceptScore W2947950562C149923435 @default.
• W2947950562 hasConceptScore W2947950562C154945302 @default.
• W2947950562 hasConceptScore W2947950562C173870130 @default.
• W2947950562 hasConceptScore W2947950562C206729178 @default.
• W2947950562 hasConceptScore W2947950562C22590252 @default.
• W2947950562 hasConceptScore W2947950562C2776068756 @default.

• next