<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[Better.C的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/python_n</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; python_n]]></copyright><item><title><![CDATA[最短路问题求解 | Python+Gurobi-COPT-SCIP]]></title><link>https://blog.youkuaiyun.com/python_n/article/details/163779652</link><guid>https://blog.youkuaiyun.com/python_n/article/details/163779652</guid><author>python_n</author><pubDate>Sat, 15 Aug 2026 14:38:33 +0800</pubDate><description><![CDATA[本文介绍了使用Python结合三种主流求解器（Gurobi、COPT、SCIP）解决网络流问题中的最短路问题。文章首先通过早高峰通勤场景引出最短路问题，将路网抽象为带权有向图。然后详细讲解了数学建模过程，包括集合定义、参数设置、决策变量选择，以及目标函数和约束条件的建立。为便于验证，文中构造了一个小型路网案例，并分别给出了Python+Gurobi和Python+COPT的完整实现代码，包括数据定义、模型构建、求解过程和结果解析。这两种实现都采用流平衡约束的整数规划方法，能够准确计算出从起点到终点的最短路径]]></description><category></category></item><item><title><![CDATA[【MDVRP】Python+Gurobi求解运输问题建模实践四]]></title><link>https://blog.youkuaiyun.com/python_n/article/details/142021137</link><guid>https://blog.youkuaiyun.com/python_n/article/details/142021137</guid><author>python_n</author><pubDate>Sun, 08 Sep 2024 10:03:52 +0800</pubDate><description><![CDATA[采用Python+Gurobi求解多车场路径规划问题（MDVRP）]]></description><category></category></item><item><title><![CDATA[【VRPCB】Python+Gurobi求解运输问题建模实践三]]></title><link>https://blog.youkuaiyun.com/python_n/article/details/141252055</link><guid>https://blog.youkuaiyun.com/python_n/article/details/141252055</guid><author>python_n</author><pubDate>Fri, 16 Aug 2024 14:30:12 +0800</pubDate><description><![CDATA[采用Python+Gurobi求解带有集群回程需求的VRPCB问题]]></description><category></category></item><item><title><![CDATA[《车辆路径规划问题》专栏_安全提示3——关于抄袭并通过其本人有偿获取内容的安全提示]]></title><link>https://blog.youkuaiyun.com/python_n/article/details/141038677</link><guid>https://blog.youkuaiyun.com/python_n/article/details/141038677</guid><author>python_n</author><pubDate>Thu, 08 Aug 2024 23:34:47 +0800</pubDate><description><![CDATA[安全提示]]></description><category></category></item><item><title><![CDATA[VRPTW算法性能评测来啦！]]></title><link>https://blog.youkuaiyun.com/python_n/article/details/140812572</link><guid>https://blog.youkuaiyun.com/python_n/article/details/140812572</guid><author>python_n</author><pubDate>Wed, 31 Jul 2024 09:57:02 +0800</pubDate><description><![CDATA[累计运行6135432秒，只为做出更全面的评测。]]></description><category></category></item><item><title><![CDATA[【进阶六】Python实现SDVRPTW（需求拆分）常见求解算法——禁忌搜索+模拟退火算法（TS+SA）]]></title><link>https://blog.youkuaiyun.com/python_n/article/details/138242072</link><guid>https://blog.youkuaiyun.com/python_n/article/details/138242072</guid><author>python_n</author><pubDate>Sat, 27 Apr 2024 10:09:06 +0800</pubDate><description><![CDATA[基于python语言，采用经典禁忌搜索（TS）+模拟退火（SA）对 带硬时间窗的需求拆分车辆路径规划问题（SDVRPTW） 进行求解。]]></description><category></category></item><item><title><![CDATA[【进阶六】Python实现SDVRPTW常见求解算法——量子粒子群算法（QDPSO）]]></title><link>https://blog.youkuaiyun.com/python_n/article/details/138176708</link><guid>https://blog.youkuaiyun.com/python_n/article/details/138176708</guid><author>python_n</author><pubDate>Thu, 25 Apr 2024 09:42:48 +0800</pubDate><description><![CDATA[基于python语言，采用经典量子离散粒子群算法（QDPSO）对 带硬时间窗的需求拆分车辆路径规划问题（SDVRPTW） 进行求解。]]></description><category></category></item><item><title><![CDATA[【进阶六】Python实现SDVRPTW常见求解算法——离散粒子群算法（DPSO）]]></title><link>https://blog.youkuaiyun.com/python_n/article/details/137738116</link><guid>https://blog.youkuaiyun.com/python_n/article/details/137738116</guid><author>python_n</author><pubDate>Sun, 14 Apr 2024 10:20:34 +0800</pubDate><description><![CDATA[基于python语言，采用经典离散粒子群算法（DPSO）对 带硬时间窗的需求拆分车辆路径规划问题（SDVRPTW） 进行求解。]]></description><category></category></item><item><title><![CDATA[【进阶六】Python实现SDVRPTW常见求解算法——差分进化算法（DE）]]></title><link>https://blog.youkuaiyun.com/python_n/article/details/137640918</link><guid>https://blog.youkuaiyun.com/python_n/article/details/137640918</guid><author>python_n</author><pubDate>Thu, 11 Apr 2024 15:40:42 +0800</pubDate><description><![CDATA[基于python语言，采用经典差分进化算法（DE）对 带硬时间窗的需求拆分车辆路径规划问题（SDVRPTW） 进行求解。]]></description><category></category></item><item><title><![CDATA[【进阶六】Python实现SDVRPTW常见求解算法——自适应大邻域算法（ALNS）]]></title><link>https://blog.youkuaiyun.com/python_n/article/details/137536892</link><guid>https://blog.youkuaiyun.com/python_n/article/details/137536892</guid><author>python_n</author><pubDate>Tue, 09 Apr 2024 09:38:44 +0800</pubDate><description><![CDATA[基于python语言，采用经典自适应大邻域算法（ALNS）对 带硬时间窗的需求拆分车辆路径规划问题（SDVRPTW） 进行求解。]]></description><category></category></item><item><title><![CDATA[【进阶六】Python实现SDVRPTW常见求解算法——蚁群算法（ACO）]]></title><link>https://blog.youkuaiyun.com/python_n/article/details/137493885</link><guid>https://blog.youkuaiyun.com/python_n/article/details/137493885</guid><author>python_n</author><pubDate>Mon, 08 Apr 2024 09:55:18 +0800</pubDate><description><![CDATA[基于python语言，采用经典蚁群算法（ACO）对 带硬时间窗的需求拆分车辆路径规划问题（SDVRPTW） 进行求解。]]></description><category></category></item><item><title><![CDATA[【进阶六】Python实现SDVRPTW常见求解算法——遗传算法（GA）]]></title><link>https://blog.youkuaiyun.com/python_n/article/details/137293709</link><guid>https://blog.youkuaiyun.com/python_n/article/details/137293709</guid><author>python_n</author><pubDate>Wed, 03 Apr 2024 15:28:23 +0800</pubDate><description><![CDATA[基于python语言，采用经典遗传算法（GA）对 带硬时间窗的需求拆分车辆路径规划问题（SDVRP） 进行求解。]]></description><category></category></item><item><title><![CDATA[【进阶五】Python实现SDVRP（需求拆分）常见求解算法——禁忌搜索+模拟退火算法（TS+SA）]]></title><link>https://blog.youkuaiyun.com/python_n/article/details/136932235</link><guid>https://blog.youkuaiyun.com/python_n/article/details/136932235</guid><author>python_n</author><pubDate>Fri, 22 Mar 2024 10:20:45 +0800</pubDate><description><![CDATA[基于python语言，采用经典禁忌搜索（TS）+模拟退火（SA）对 需求拆分车辆路径规划问题（SDVRP） 进行求解。]]></description><category></category></item><item><title><![CDATA[【进阶五】Python实现SDVRP（需求拆分）常见求解算法——量子粒子群算法（QDPSO）]]></title><link>https://blog.youkuaiyun.com/python_n/article/details/136916546</link><guid>https://blog.youkuaiyun.com/python_n/article/details/136916546</guid><author>python_n</author><pubDate>Thu, 21 Mar 2024 18:21:33 +0800</pubDate><description><![CDATA[基于python语言，采用经典量子粒子群算法（QDPSO）对 需求拆分车辆路径规划问题（SDVRP） 进行求解。]]></description><category></category></item><item><title><![CDATA[【进阶五】Python实现SDVRP（需求拆分）常见求解算法——离散粒子群算法（DPSO）]]></title><link>https://blog.youkuaiyun.com/python_n/article/details/136872235</link><guid>https://blog.youkuaiyun.com/python_n/article/details/136872235</guid><author>python_n</author><pubDate>Wed, 20 Mar 2024 12:03:56 +0800</pubDate><description><![CDATA[基于python语言，采用经典离散粒子群算法（DPSO）对 需求拆分车辆路径规划问题（SDVRP） 进行求解。]]></description><category></category></item><item><title><![CDATA[【进阶五】Python实现SDVRP（需求拆分）常见求解算法——差分进化算法（DE）]]></title><link>https://blog.youkuaiyun.com/python_n/article/details/136838461</link><guid>https://blog.youkuaiyun.com/python_n/article/details/136838461</guid><author>python_n</author><pubDate>Tue, 19 Mar 2024 12:28:03 +0800</pubDate><description><![CDATA[基于python语言，采用经典差分进化算法（DE）对 需求拆分车辆路径规划问题（SDVRP） 进行求解。]]></description><category></category></item><item><title><![CDATA[【进阶五】Python实现SDVRP（需求拆分）常见求解算法——自适应大邻域算法（ALNS）]]></title><link>https://blog.youkuaiyun.com/python_n/article/details/136805836</link><guid>https://blog.youkuaiyun.com/python_n/article/details/136805836</guid><author>python_n</author><pubDate>Mon, 18 Mar 2024 13:02:43 +0800</pubDate><description><![CDATA[基于python语言，采用经典自适应大邻域算法（ALNS）对 需求拆分车辆路径规划问题（SDVRP） 进行求解。]]></description><category></category></item><item><title><![CDATA[【进阶五】Python实现SDVRP（需求拆分）常见求解算法——蚁群算法（ACO）]]></title><link>https://blog.youkuaiyun.com/python_n/article/details/136711263</link><guid>https://blog.youkuaiyun.com/python_n/article/details/136711263</guid><author>python_n</author><pubDate>Thu, 14 Mar 2024 15:23:47 +0800</pubDate><description><![CDATA[基于python语言，采用经典遗传算法（ACO）对 需求拆分车辆路径规划问题（SDVRP） 进行求解。]]></description><category></category></item><item><title><![CDATA[【进阶五】Python实现SDVRP（需求拆分）常见求解算法——遗传算法（GA）]]></title><link>https://blog.youkuaiyun.com/python_n/article/details/136659364</link><guid>https://blog.youkuaiyun.com/python_n/article/details/136659364</guid><author>python_n</author><pubDate>Tue, 12 Mar 2024 19:52:04 +0800</pubDate><description><![CDATA[基于python语言，采用经典遗传算法（GA）对 需求拆分车辆路径规划问题（SDVRP） 进行求解。]]></description><category></category></item><item><title><![CDATA[VRPSolverEasy：可求解多种VRP变体（rich vehicle routing）问题的精确算法python包]]></title><link>https://blog.youkuaiyun.com/python_n/article/details/135396634</link><guid>https://blog.youkuaiyun.com/python_n/article/details/135396634</guid><author>python_n</author><pubDate>Thu, 04 Jan 2024 21:55:24 +0800</pubDate><description><![CDATA[绝对干活，算法小白的福利。]]></description><category></category></item></channel></rss>