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

Lagrange Multipliers: Problem Solving01:30

Lagrange Multipliers: Problem Solving

A silo with a cylindrical base, flat bottom, and hemispherical roof is a common design in agricultural and industrial storage due to its structural efficiency and ease of construction. Optimizing its dimensions to maximize storage capacity for a given amount of material—i.e., a fixed surface area—is a classic problem in applied calculus and engineering design. The key parameters are the radius r of the base and the height h of the cylindrical section.The total volume of the silo is obtained by...
Lagrange Multipliers: Two Constraints01:28

Lagrange Multipliers: Two Constraints

The method of Lagrange multipliers with two constraints is used to optimize a function subject to two independent constraints. In many applications, the objective function represents a quantity to be maximized or minimized, such as cost, area, distance, or energy. The two constraints represent requirements that the solution must satisfy, such as fixed volume, limited resources, or prescribed dimensions.For a function of three variables, each constraint forms a surface in three-dimensional space.
Distributed Loads: Problem Solving01:21

Distributed Loads: Problem Solving

Beams are structural elements commonly employed in engineering applications requiring different load-carrying capacities. The first step in analyzing a beam under a distributed load is to simplify the problem by dividing the load into smaller regions, which allows one to consider each region separately and calculate the magnitude of the equivalent resultant load acting on each portion of the beam. The magnitude of the equivalent resultant load for each region can be determined by calculating...
Lagrange Multipliers: One Constraint01:29

Lagrange Multipliers: One Constraint

In constrained optimization, the objective is to maximize or minimize a quantity while satisfying a fixed condition. A standard example is a rectangular pen built against a barn wall using 100 meters of fencing. Because the wall provides one side of the enclosure, only the other three sides require fencing. The problem is to find the dimensions that produce the greatest possible area.Let L represent the length parallel to the wall and W the width perpendicular to it. The area of the pen is A =...
Mechanistic Models: Compartment Models in Algorithms for Numerical Problem Solving01:29

Mechanistic Models: Compartment Models in Algorithms for Numerical Problem Solving

Mechanistic models play a crucial role in algorithms for numerical problem-solving, particularly in nonlinear mixed effects modeling (NMEM). These models aim to minimize specific objective functions by evaluating various parameter estimates, leading to the development of systematic algorithms. In some cases, linearization techniques approximate the model using linear equations.
In individual population analyses, different algorithms are employed, such as Cauchy's method, which uses a...
Rolling Resistance: Problem Solving01:17

Rolling Resistance: Problem Solving

Rolling resistance, also known as rolling friction, is the force that resists the motion of a rolling object, such as a wheel, tire, or ball, when it moves over a surface. It is caused by the deformation of the object and the surface in contact with each other, as well as other factors like internal friction, hysteresis, and energy losses within the materials. Rolling resistance opposes the object's motion, requiring additional energy to overcome it and maintain movement. In practical...

You might also read

Related Articles

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

Sort by
Same author

Characterizing the flow-pressure relationship for flexible and navigable suction ureteral access sheaths in retrograde intrarenal surgery.

Scientific reports·2026
Same author

Validation and Functional Exploration of Exosome-Derived ITGA9-AS1 and WNT5A-AS1 as Candidate Diagnostic Biomarkers for Schizophrenia.

Neuropsychiatric disease and treatment·2026
Same author

A machine learning-based classification model for interstitial lung disease in rheumatoid arthritis.

Frontiers in medicine·2026
Same author

Structural obstacles and the mediated efficiency paradox: A DEA-Tobit exploration of the heterogeneous role of tourism intention in China's tourism enterprises.

Acta psychologica·2026
Same author

Novel Non-Cytotoxic Acylphosphinates and Acylphosphine Oxides Photoinitiators.

Angewandte Chemie (International ed. in English)·2026
Same author

Single-cell spatial immune landscape of ASFV-infected porcine lung microenvironment.

Virulence·2026

Related Experiment Videos

Efficient bicycle-sharing rebalancing via demand distribution-based integer programming model and neural lagrangian

Qian Che1,2, Yangyang Xu3, Wanyuan Wang3

  • 1School of Data and Intelligent Policing Technology, Jiangsu Police Institute, Nanjing, China. cheqian@jspi.cn.

Scientific Reports
|July 10, 2026
PubMed
Summary
This summary is machine-generated.

This study introduces a new AI-driven framework, DD-IP-NLA, to optimize bicycle sharing systems. It addresses demand fluctuations and computational complexity, improving real-time rebalancing and user satisfaction.

Keywords:
Bicycle sharing rebalancingDemand distributionNeural-lagrangian acceleration

Related Experiment Videos

Area of Science:

  • Operations Research
  • Artificial Intelligence
  • Urban Mobility

Background:

  • Artificial Intelligence of Things (AIoT) has enabled large-scale bicycle sharing systems.
  • Supply-demand imbalances and uneven distribution are key challenges in these systems.
  • Current Integer Programming (IP) methods struggle with demand fluctuations and real-time application.

Purpose of the Study:

  • To develop an efficient and scalable rebalancing strategy for AIoT-enabled bicycle sharing systems.
  • To overcome the limitations of historical average demand models and high computational complexity in existing IP methods.
  • To improve user demand satisfaction and system profitability through real-time optimization.

Main Methods:

  • Proposed a Demand Distribution-based Integer Programming with Neural-Lagrangian Acceleration (DD-IP-NLA) framework.
  • DD-IP captures demand fluctuations using demand distribution vectors.
  • Neural-Lagrangian Acceleration (NLA) predicts near-optimal Lagrangian multipliers with a neural network.
  • DBSCAN clustering with a distance-demand similarity metric was used to reduce computational complexity for large-scale systems.

Main Results:

  • The DD-IP-NLA framework demonstrated superior performance in satisfying user demand compared to existing methods.
  • The proposed method significantly improved the profitability of bicycle sharing operations.
  • Experiments confirmed the scalability of DD-IP-NLA for large-scale systems, enabling real-time application.
  • The system effectively managed demand fluctuations and optimized bicycle distribution.

Conclusions:

  • DD-IP-NLA offers a robust solution for real-time bicycle rebalancing in AIoT-enabled sharing systems.
  • The framework effectively addresses the critical challenges of demand uncertainty and computational efficiency.
  • This approach enhances the operational efficiency, user satisfaction, and economic viability of urban bicycle sharing.