• 文献检索
  • 文档翻译
  • 深度研究
  • 学术资讯
  • Suppr Zotero 插件Zotero 插件
  • 邀请有礼
  • 套餐&价格
  • 历史记录
应用&插件
Suppr Zotero 插件Zotero 插件浏览器插件Mac 客户端Windows 客户端微信小程序
定价
高级版会员购买积分包购买API积分包
服务
文献检索文档翻译深度研究API 文档MCP 服务
关于我们
关于 Suppr公司介绍联系我们用户协议隐私条款
关注我们

Suppr 超能文献

核心技术专利:CN118964589B侵权必究
粤ICP备2023148730 号-1Suppr @ 2026

文献检索

告别复杂PubMed语法,用中文像聊天一样搜索,搜遍4000万医学文献。AI智能推荐,让科研检索更轻松。

立即免费搜索

文件翻译

保留排版,准确专业,支持PDF/Word/PPT等文件格式,支持 12+语言互译。

免费翻译文档

深度研究

AI帮你快速写综述,25分钟生成高质量综述,智能提取关键信息,辅助科研写作。

立即免费体验

一种用于随机订单分配问题的改进自适应可变邻域搜索算法。

An improved adaptive variable neighborhood search algorithm for stochastic order allocation problem.

作者信息

Zhang Zhenzhong, Zhang Ling, Li Weichun

机构信息

CAAC Academy, Civil Aviation Flight University of China, Chengdu, 618307, China.

School of Modern Posts, Chongqing University of Posts and Telecommunications, Chongqing, 400065, China.

出版信息

Sci Rep. 2025 Jan 2;15(1):481. doi: 10.1038/s41598-024-84663-y.

DOI:10.1038/s41598-024-84663-y
PMID:39748093
原文链接:https://pmc.ncbi.nlm.nih.gov/articles/PMC11695832/
Abstract

In practical supply chain operations, efficient order allocation significantly enhances the overall efficiency of the supply chain. Real production environments are plagued by numerous uncertainties, such as unpredictable customer orders, which greatly amplify the complexity of solving practical allocation problems. This study focuses on the problem of allocating orders to parallel machines with varying efficiencies under uncertain and high-dimensional conditions. To maximize the expected profit of order processing, a mathematical model for a high-dimensional stochastic optimization problem is developed, considering the uncertainty due to potential customer order cancellations in a real-world production. By integrating an intelligent optimization algorithm for the order assignment problem with a scenario generation approach, a novel framework for intelligent stochastic optimization is proposed. This framework employs an intelligent optimization algorithm suitable for the generalized assignment problem to search for improved solutions and utilizes the scenario generation method to produce the necessary scenarios for evaluating solutions in high-dimension. Experimental results demonstrate that the proposed approach effectively addresses the high-dimensional stochastic order allocation problem, outperforming the compared method in terms of efficiency and capability.

摘要

在实际的供应链运作中,高效的订单分配显著提高了供应链的整体效率。实际生产环境受到众多不确定性因素的困扰,如不可预测的客户订单,这极大地增加了解决实际分配问题的复杂性。本研究聚焦于在不确定和高维条件下,将订单分配给效率各异的并行机器的问题。为了使订单处理的预期利润最大化,考虑到实际生产中潜在客户订单取消所带来的不确定性,建立了一个高维随机优化问题的数学模型。通过将订单分配问题的智能优化算法与场景生成方法相结合,提出了一种新颖的智能随机优化框架。该框架采用适用于广义分配问题的智能优化算法来搜索改进解,并利用场景生成方法生成必要的场景,以在高维中评估解。实验结果表明,所提出的方法有效地解决了高维随机订单分配问题,在效率和能力方面优于比较方法。

https://cdn.ncbi.nlm.nih.gov/pmc/blobs/4f89/11695832/02487d311275/41598_2024_84663_Fig4_HTML.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/4f89/11695832/809ca0deb058/41598_2024_84663_Fig1_HTML.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/4f89/11695832/47bb38507265/41598_2024_84663_Fig2_HTML.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/4f89/11695832/dc4c14520b56/41598_2024_84663_Fig3_HTML.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/4f89/11695832/02487d311275/41598_2024_84663_Fig4_HTML.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/4f89/11695832/809ca0deb058/41598_2024_84663_Fig1_HTML.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/4f89/11695832/47bb38507265/41598_2024_84663_Fig2_HTML.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/4f89/11695832/dc4c14520b56/41598_2024_84663_Fig3_HTML.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/4f89/11695832/02487d311275/41598_2024_84663_Fig4_HTML.jpg

相似文献

1
An improved adaptive variable neighborhood search algorithm for stochastic order allocation problem.一种用于随机订单分配问题的改进自适应可变邻域搜索算法。
Sci Rep. 2025 Jan 2;15(1):481. doi: 10.1038/s41598-024-84663-y.
2
An intelligent stochastic optimization approach for air cargo order allocation under carbon emission constraints.碳排放约束下航空货运订单分配的智能随机优化方法
PLoS One. 2025 Apr 10;20(4):e0319973. doi: 10.1371/journal.pone.0319973. eCollection 2025.
3
ISCCO: a deep learning feature extraction-based strategy framework for dynamic minimization of supply chain transportation cost losses.ISCCO:一种基于深度学习特征提取的供应链运输成本损失动态最小化策略框架。
PeerJ Comput Sci. 2024 Dec 12;10:e2537. doi: 10.7717/peerj-cs.2537. eCollection 2024.
4
Joint optimization of overbooking and seat allocation for high-speed railways considering stochastic demand.考虑随机需求的高速铁路超售和座位分配联合优化。
PLoS One. 2024 Nov 18;19(11):e0312745. doi: 10.1371/journal.pone.0312745. eCollection 2024.
5
Hybrid stochastic and robust optimization of a hybrid system with fuel cell for building electrification using an improved arithmetic optimization algorithm.基于改进算术优化算法的用于建筑电气化的含燃料电池混合系统的混合随机与鲁棒优化
Sci Rep. 2025 Jan 13;15(1):1779. doi: 10.1038/s41598-025-86074-z.
6
A sustainable supply chain network considering lot sizing with quantity discounts under disruption risks: centralized and decentralized models.考虑中断风险下带有数量折扣的批量规模的可持续供应链网络:集中式和分散式模型
J Comb Optim. 2022;44(3):1387-1432. doi: 10.1007/s10878-022-00891-w. Epub 2022 Aug 27.
7
Design and optimization of dynamic reliability-driven order allocation and inventory management decision model.动态可靠性驱动的订单分配与库存管理决策模型的设计与优化
PeerJ Comput Sci. 2024 Sep 13;10:e2294. doi: 10.7717/peerj-cs.2294. eCollection 2024.
8
A fuzzy interval optimization approach for p-hub median problem under uncertain information.不确定信息下 p-中心问题的模糊区间优化方法。
PLoS One. 2024 Mar 15;19(3):e0297295. doi: 10.1371/journal.pone.0297295. eCollection 2024.
9
An Improved Chimp-Inspired Optimization Algorithm for Large-Scale Spherical Vehicle Routing Problem with Time Windows.一种改进的受黑猩猩启发的优化算法,用于求解带时间窗的大规模球形车辆路径问题
Biomimetics (Basel). 2022 Dec 15;7(4):241. doi: 10.3390/biomimetics7040241.
10
Multi-resource allocation and care sequence assignment in patient management: a stochastic programming approach.患者管理中的多资源分配和护理顺序分配:随机规划方法。
Health Care Manag Sci. 2024 Sep;27(3):352-369. doi: 10.1007/s10729-024-09675-6. Epub 2024 May 30.

本文引用的文献

1
Vehicle logistics intermodal route optimization based on Tabu search algorithm.基于禁忌搜索算法的车辆物流多式联运路线优化
Sci Rep. 2024 May 24;14(1):11859. doi: 10.1038/s41598-024-60361-7.
2
A novel chaotic and neighborhood search-based artificial bee colony algorithm for solving optimization problems.一种基于混沌和邻域搜索的新型人工蜂群算法用于求解优化问题。
Sci Rep. 2023 Nov 22;13(1):20496. doi: 10.1038/s41598-023-44770-8.
3
Optimization of a molten iron scheduling problem with uncertain processing time using variable neighborhood search algorithm.
使用可变邻域搜索算法优化加工时间不确定的铁水调度问题
Sci Rep. 2022 May 4;12(1):7303. doi: 10.1038/s41598-022-10891-9.