Model for Vehicle Routing Plan
with Mixed-Demand and Its Lasso Solution

YE Zhi-jian; DUWen; ZHOUHe-fang

Volume 16 Issue 3

Jun. 2003

Turn off MathJax

Article Contents

Journal of Southwest Jiaotong University > 2003 > 16(3): 341-344.

YE Zhi-jian, DUWen, ZHOUHe-fang. Model for Vehicle Routing Planwith Mixed-Demand and Its Lasso Solution[J]. Journal of Southwest Jiaotong University, 2003, 16(3): 341-344.

Citation:

YE Zhi-jian, DUWen, ZHOUHe-fang. Model for Vehicle Routing Plan with Mixed-Demand and Its Lasso Solution[J]. Journal of Southwest Jiaotong University, 2003, 16(3): 341-344.

YE Zhi-jian, DUWen, ZHOUHe-fang. Model for Vehicle Routing Planwith Mixed-Demand and Its Lasso Solution[J]. Journal of Southwest Jiaotong University, 2003, 16(3): 341-344.

Citation:

YE Zhi-jian, DUWen, ZHOUHe-fang. Model for Vehicle Routing Plan with Mixed-Demand and Its Lasso Solution[J]. Journal of Southwest Jiaotong University, 2003, 16(3): 341-344.

PDF( 0 KB)

Model for Vehicle Routing Plan with Mixed-Demand and Its Lasso Solution

Publish Date: 25 Jun 2003

Abstract

Abstract

When customers have a mixed demand for delivering and fetchinggoods, the solution can not be obtained using the traditional TSP (travelling salesman problem) algorithms because of the restraint of the demand for delivery and fetching and the capacity of vehicles. To solve this problem, a model of customer subset distribution is set up. Based on the customer subset distribution, the lasso solution is proposed to select the route with the minimum distribution cost.
- transportation,
- modeling,
- mixed-demand,
- vehicle routing plan,
- model of customer subset distribution,
- lasso solution