Jove
Visualize
Contact Us
JoVE
x logofacebook logolinkedin logoyoutube logo
ABOUT JoVE
OverviewLeadershipBlogJoVE Help Center
AUTHORS
Publishing ProcessEditorial BoardScope & PoliciesPeer ReviewFAQSubmit
LIBRARIANS
TestimonialsSubscriptionsAccessResourcesLibrary Advisory BoardFAQ
RESEARCH
JoVE JournalMethods CollectionsJoVE Encyclopedia of ExperimentsArchive
EDUCATION
JoVE CoreJoVE BusinessJoVE Science EducationJoVE Lab ManualFaculty Resource CenterFaculty Site
Terms & Conditions of Use
Privacy Policy
Policies

Related Concept Videos

Laminar Flow01:27

Laminar Flow

523
Laminar flow represents a smooth, orderly fluid motion where particles move along parallel paths, resulting in minimal mixing between layers. Streamlined particle paths characterize this flow regime and occur under conditions where viscous forces dominate over inertial forces. The distinction between laminar, transitional, and turbulent flow is primarily determined by the Reynolds number, a dimensionless quantity calculated as:
523
Uniform Depth Channel Flow: Problem Solving01:18

Uniform Depth Channel Flow: Problem Solving

53
To calculate the flow rate for a trapezoidal channel, first, identify the bottom width, side slope, and flow depth of the channel. The cross-sectional area (A) corresponding to the depth of flow (y), channel bottom width (B), and side slope (θ) is determined by:Next, calculate the wetted perimeter, which includes the bottom width and the sloped side lengths in contact with the water. Using the values of the cross-sectional area and the wetted perimeter, determine the hydraulic radius by...
53
Plane Potential Flows01:23

Plane Potential Flows

314
Plane potential flows simplify fluid motion by assuming the fluid to be irrotational and incompressible. These characteristics allow these flows to be described by a velocity potential function, ϕ, representing the flow speed in a given direction, and a stream function, ψ, that visualizes the flow path, both governed by Laplace's equation. These parameters help in estimating flow patterns, velocity distributions, and pressure fields around various hydraulic structures.
Uniform...
314
Pipe Flowrate Measurement: Problem Solving01:28

Pipe Flowrate Measurement: Problem Solving

226
A spray tank system is engineered to uniformly distribute a pest-control liquid across plants by using a pressurized mechanism. The tank, pressurized to 150 kPa, holds the pesticide at a height of 0.80 meters. Liquid flows from the tank through a 1.9 meter pipe with a diameter of 0.015 meters, angled at 0.698 radians, ultimately reaching a 0.007 meter nozzle that sprays the pesticide. Accurate calculation of the system's flow rate is crucial to ensure uniform application, and this is...
226
Rapidly Varying Flow01:24

Rapidly Varying Flow

45
Rapidly varying flow (RVF) in open channels is characterized by abrupt changes in flow depth over a short distance, with the rate of depth change relative to distance often approaching unity. These flows are inherently complex due to their transient and multi-dimensional nature, making exact analysis difficult. However, approximate solutions using simplified models provide valuable insights into their behavior.Key Features of Rapidly Varying FlowRVF is commonly observed in scenarios involving...
45
Laminar Flow: Problem Solving01:24

Laminar Flow: Problem Solving

98
Laminar flow occurs when a fluid moves smoothly in parallel layers with minimal mixing and turbulence. In fluid mechanics, ensuring laminar flow within a pipe is essential for precise control of flow characteristics, especially in engineering applications. The key factor in determining whether flow remains laminar is the Reynolds number, a dimensionless quantity that depends on the fluid's velocity, density, viscosity, and the pipe's diameter. A Reynolds number of 2100 or lower...
98

You might also read

Related Articles

Articles linked to this work by shared authors, journal, and citation graph.

Sort by
Same author

Magnetic Resonance Spectroscopy Deep Learning with Magnetic Resonance Background Generator Enables In Vivo Metabolite Quantification of Hepatic Encephalopathy.

IEEE transactions on bio-medical engineering·2026
Same author

Sequential site engineering of an Fe-N<sub>4</sub> oxidase-like nanozyme for colorimetric detection of alkaline phosphatase.

Talanta·2026
Same author

Bridging data and discovery: a survey on knowledge graphs in AI for science.

National science review·2026
Same author

Joint power-time resource optimization for multi-tag RFID wireless power transfer via model predictive control and ADMM.

PloS one·2026
Same author

Low blood zinc exacerbates minimal hepatic encephalopathy via altered functional brain activity.

Digestive and liver disease : official journal of the Italian Society of Gastroenterology and the Italian Association for the Study of the Liver·2026
Same author

Scalable homology detection with ERAST.

Nature biotechnology·2026

Related Experiment Video

Updated: May 25, 2025

Spatial Multiobjective Optimization of Agricultural Conservation Practices using a SWAT Model and an Evolutionary Algorithm
11:53

Spatial Multiobjective Optimization of Agricultural Conservation Practices using a SWAT Model and an Evolutionary Algorithm

Published on: December 9, 2012

12.9K

An improved salp swarm algorithm for permutation flow shop vehicle routing problem.

Yanguang Cai1,2, Huajun Chen3,4

  • 1School of Automation, Guangdong University of Technology, Guangzhou, 510006, China.

Scientific Reports
|February 25, 2025
PubMed
Summary
This summary is machine-generated.

This study introduces an improved salp swarm algorithm to solve the permutation flow shop vehicle routing problem. The algorithm effectively minimizes production and transportation costs through collaborative optimization, outperforming existing methods.

Keywords:
Collaborative schedulingDiscrete manufacturingFlow shopVehicle routing

More Related Videos

Evaluation of an Exclusive Spur Dike U-Turn Design with Radar-Collected Data and Simulation
11:41

Evaluation of an Exclusive Spur Dike U-Turn Design with Radar-Collected Data and Simulation

Published on: February 1, 2020

20.3K
Large Scale Energy Efficient Sensor Network Routing Using a Quantum Processor Unit
05:30

Large Scale Energy Efficient Sensor Network Routing Using a Quantum Processor Unit

Published on: September 8, 2023

474

Related Experiment Videos

Last Updated: May 25, 2025

Spatial Multiobjective Optimization of Agricultural Conservation Practices using a SWAT Model and an Evolutionary Algorithm
11:53

Spatial Multiobjective Optimization of Agricultural Conservation Practices using a SWAT Model and an Evolutionary Algorithm

Published on: December 9, 2012

12.9K
Evaluation of an Exclusive Spur Dike U-Turn Design with Radar-Collected Data and Simulation
11:41

Evaluation of an Exclusive Spur Dike U-Turn Design with Radar-Collected Data and Simulation

Published on: February 1, 2020

20.3K
Large Scale Energy Efficient Sensor Network Routing Using a Quantum Processor Unit
05:30

Large Scale Energy Efficient Sensor Network Routing Using a Quantum Processor Unit

Published on: September 8, 2023

474

Area of Science:

  • Operations Research
  • Manufacturing Engineering
  • Logistics Management

Background:

  • Discrete manufacturing relies on permutation flow shop scheduling.
  • Timely delivery and reduced inventory costs are critical business needs.
  • Integrating production scheduling with logistics is essential for cost minimization.

Purpose of the Study:

  • To address the permutation flow shop vehicle routing problem.
  • To develop a collaborative optimization model for production and logistics scheduling.
  • To propose an efficient algorithm for solving this integrated problem.

Main Methods:

  • Mathematical modeling of the permutation flow shop vehicle routing problem.
  • Development of an improved salp swarm algorithm (SSA).
  • Incorporation of local search operations within the SSA to enhance population exploration.

Main Results:

  • The improved SSA demonstrated superior optimization capabilities compared to simulated annealing, genetic algorithms, and particle swarm optimization.
  • Simulation results validated the algorithm's effectiveness.
  • The proposed algorithm successfully solved the permutation flow shop vehicle routing problem in example applications.

Conclusions:

  • The developed mathematical model and improved SSA provide an effective approach for collaborative optimization of production and logistics scheduling.
  • The algorithm's enhanced exploration capability leads to better optimization performance.
  • This research offers a practical solution for enterprises seeking to minimize total production and transportation costs.