摘要
Based on a study of traditional routes problem for vehicles together with reference to Set Covering Problem and Lagrangian Relaxation, discusses the optimization of routes for private fleet and entrusted carriers. It aims to transfer the traditional VRP into Set Covering Problem so as to propose an MP-based heuristic calculation model. This model is based on mathematical planning, and is an integration of precise calculation method and heuristic calculation method, which can serve as a decision making accordance for corporations to realize the goal of the smallest vehicle scale and the highest use efficiency. ? ASCE.
- 单位