Routing by Mized Set Programming

摘要：

This paper presents the solution to a routing problem (Pick-up and Delivery with Time Windows) by Mixed Set Programming which solves constraint satisfaction problems over a mixed domain of reals, integers, Booleans, references and sets 8. To illustrate the method, a complete constraint program in the NCL language 7,9 is presented.

关键词： Mized Set Programming Natural Constraint Language Pick-up and Delivery with Time Windows Vehicle Routing

作者: Jianyang Zhou

作者单位: ENGINEST, 1 allée de 1Alzette-54500 Vandoeuvre-Les-Nancy-France

会议类型: 国际会议

会议名称: The 8th International Symposium on Operations Research and Its Applications(第八届运筹及其应用国际专题讨论会 ISORA09)

会议地点: 张家界

会议语种:英文

页码: 157-166

在线出版日期: 2009-09-20（万方平台首次上网日期，不代表论文的发表时间）