ridm@nrct.go.th   ระบบคลังข้อมูลงานวิจัยไทย   รายการโปรดที่คุณเลือกไว้

A robust two-phase heuristic algorithm for the truck scheduling problem in a resource-constrained crossdock.

หน่วยงาน Nanyang Technological University, Singapore

รายละเอียด

ชื่อเรื่อง : A robust two-phase heuristic algorithm for the truck scheduling problem in a resource-constrained crossdock.
นักวิจัย : Shakeri, Mojtaba. , Low, Malcolm Yoke Hean. , Turner, Stephen John. , Lee, Eng Wah.
คำค้น : DRNTU::Engineering::Computer science and engineering.
หน่วยงาน : Nanyang Technological University, Singapore
ผู้ร่วมงาน : -
ปีพิมพ์ : 2555
อ้างอิง : Shakeri, M., Low, M. Y. H., Turner, S. J.,& Lee, E. W. (2012). A robust two-phase heuristic algorithm for the truck scheduling problem in a resource-constrained crossdock. Computers & Operations Research, 39(11), 2564-2577. , 0305-0548 , http://hdl.handle.net/10220/13131 , http://dx.doi.org/10.1016/j.cor.2012.01.002
ที่มา : -
ความเชี่ยวชาญ : -
ความสัมพันธ์ : Computers & operations research
ขอบเขตของเนื้อหา : -
บทคัดย่อ/คำอธิบาย :

This paper studies truck scheduling in a resource-constrained crossdock. The problem decides on the sequence of incoming and outgoing trucks at the dock doors of the crossdocking terminal, subject to the availability of crossdock resources including dock doors and material handling systems. The resources are assumed non-preemptive making it necessary to address the feasibility of the problem before its optimality as it might be entrapped in deadlock and no feasible solution is produced. The paper thus aims at developing an algorithmic approach capable of establishing solution feasibility for truck scheduling problem instances of various types and difficulty levels which at the same time can be readily implemented in an industrial setting. The proposed approach is a two-phase heuristic algorithm where in the first phase, a heuristic search is deployed to construct a feasible sequence of trucks for the assignment to dock doors and in the second, a rule-based heuristic is used to assign each sequenced truck to a proper dock door, subject to a limited number of forklifts, such that significant savings in the truck schedule length are achieved. Extensive experiments are conducted to evaluate the efficiency of the algorithm in terms of deadlock avoidance and solution quality. The evaluation is carried out against the solutions generated by the exact mathematical model of the problem and a constructive heuristic developed for a similar truck scheduling problem. Experimental results demonstrate that the proposed algorithm is robust in avoiding deadlock and generates feasible solutions for the instances where the other two approaches cannot. Furthermore, significant improvement in the solution quality is achieved by augmenting the algorithm to a re-starting heuristic.

บรรณานุกรม :
Shakeri, Mojtaba. , Low, Malcolm Yoke Hean. , Turner, Stephen John. , Lee, Eng Wah. . (2555). A robust two-phase heuristic algorithm for the truck scheduling problem in a resource-constrained crossdock..
    กรุงเทพมหานคร : Nanyang Technological University, Singapore.
Shakeri, Mojtaba. , Low, Malcolm Yoke Hean. , Turner, Stephen John. , Lee, Eng Wah. . 2555. "A robust two-phase heuristic algorithm for the truck scheduling problem in a resource-constrained crossdock.".
    กรุงเทพมหานคร : Nanyang Technological University, Singapore.
Shakeri, Mojtaba. , Low, Malcolm Yoke Hean. , Turner, Stephen John. , Lee, Eng Wah. . "A robust two-phase heuristic algorithm for the truck scheduling problem in a resource-constrained crossdock.."
    กรุงเทพมหานคร : Nanyang Technological University, Singapore, 2555. Print.
Shakeri, Mojtaba. , Low, Malcolm Yoke Hean. , Turner, Stephen John. , Lee, Eng Wah. . A robust two-phase heuristic algorithm for the truck scheduling problem in a resource-constrained crossdock.. กรุงเทพมหานคร : Nanyang Technological University, Singapore; 2555.