- A container vehicle routing problem with soft time window
- 点击次数：
- 论文类型： 会议论文
- 发表时间： 2007-11-05
- 收录刊物： EI、CPCI-S、Scopus
- 页面范围： 750-755
- 摘要： Considering simultaneous pick-ups and deliveries, we present a model of local container vehicle routing with soft time window and capacity constraints. A genetic algorithm is developed by improving solution encoding, its operators and involution strategy. Based on the Solomon's customer problem, experiments show that the proposed model and algorithm are potentially efficient and useful in solving container forwarder vehicle routing problems with simultaneous pick-up and delivery service.
