|国家预印本平台
首页|时间窗约束下的车辆路径问题遗传算法研究

时间窗约束下的车辆路径问题遗传算法研究

Study on Genetic Algorithm for Vehicle Routing Problem with Hard Time Window

中文摘要英文摘要

物流配送是物流系统很重要的一环,它要求在规定的时间内将客户所需的货物以一定的方式运输到指定的地点,车辆路径问题是研究物流运输成本最小的配送问题。本文利用遗传算法求解在硬时间窗约束下的车辆路径问题,针对单配送中心硬时间窗约束下的非满载车辆路径问题在求解过程的复杂性,探讨一种启发式算法的解决方案。

Logistic distribution is very important in a logistic system.It requires that delivering the right goods customers requires to the right place by a certain method at the right time customers requires.Vehicle Routing Problem is a transport issue studying the minimum-cost of distribution logistics. Solving Vehicle Routing Problem with hard time window by Genetic Algorithm and exploring a heuristic solution for the complexity of vehicle routing problem of non-fully loaded and a single distribution with hard time window in this paper.

孟凡、常建娥

公路运输工程

硬时间窗车辆路径问题遗传算法

Hard Time WindowVehicle Routing ProblemGenetic Algorithm

孟凡,常建娥.时间窗约束下的车辆路径问题遗传算法研究[EB/OL].(2010-04-20)[2025-08-23].http://www.paper.edu.cn/releasepaper/content/201004-716.点此复制

评论