检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:Pengfei Zhou Haigui Kang Li Lin
机构地区:[1]School of Civil and Hydraulic Engineering of Dalian University of Technology [2]不详
出 处:《China-USA Business Review》2004年第4期55-61,共7页美中经济评论(英文版)
摘 要:The problem of local container vehicle routing is one of the most important problems for container forwarders in modem container logistics and transportation. The objective of the problem is to minimize the service cost and make the customers not exceed vehicle's travel time. in this paper, we propose an optimizing model of local container vehicle routing with time window constraints, which supports rail or maritime intermodal operations. Then we concentrate on developing a GA-TSP algorithm through improving solution encoding, genetic algorithm (GA) operators and involution strategy. Based on the Solomon's customer problem, an experimental evaluation of the proposed model is performed. It has been found that the proposed model is potentially efficient and useful in solving local container vehicle routing problems.
关 键 词:container transportation intermodal operations vehicle routing problem genetic algorithm
分 类 号:U491.2[交通运输工程—交通运输规划与管理]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.31