Using constraint programming for split delivery scheduling in scarce resource environment

This source preferred by Hongnian Yu

This data was imported from Scopus:

Authors: Choosri, N., Yu, H. and Atkins, A.S.

Journal: SKIMA 2011 - 5th International Conference on Software, Knowledge Information, Industrial Management and Applications

Pages: 53-59

ISBN: 9781467302463

DOI: 10.1109/SKIMA.2011.6089984

The research proposes a novel generic fleet scheduling for a split delivery with scarce resource problem. The research presents the problem in Constraint Satisfaction Problem (CSP) and further tackling it using Constraint Programming. The prototype system has been developed to evaluate the proposed method using problem statement case study from one of the large agricultural product supplier in the north of Thailand. The developed system deals with practical constraints including hard constraints e.g. vehicle capacity, time window, vehicle usage restriction and fleet constraints, and soft constraint which is a minimising of using subcontractor. The results showed a primary success of the proposed method in providing efficiency decision for agricultural transport planning. © 2011 IEEE.

The data on this page was last updated at 05:01 on March 20, 2019.