A heuristic algorithm for the auto-carrier loading problem

NCUIR > Engineering College > Department of Civil Engineering > journal & Dissertation > Item 987654321/100384

Please use this identifier to cite or link to this item: https://ir.lib.ncu.edu.tw/handle/987654321/100384

Title:	A heuristic algorithm for the auto-carrier loading problem
Authors:	陳惠國;Chen, Huey-Kuo
Contributors:	工學院土木工程學系
Date:	2016-01-01
Issue Date:	2026-04-21 14:00:00 (UTC+8)
Publisher:	Inderscience Publishers (IEL)
Abstract:	摘要： This paper studies the auto-carrier loading problem (ACLP) formulated as an integer mathematical programming model in which the associated objective function seeks to minimise the total number of reloads along the scheduled auto-carrier route. This study makes necessary modification of the previous Agbegha et al.'s (1998) formulation. A heuristic algorithm is then proposed and demonstrated in detail with nine instances that have appeared in the literature. The nine instances are the various loading results for examples assigning vehicles on different auto-carrier configurations and, for each configuration, taking into consideration constraints imposed by different types of vehicle. Computational experiments indicate that the proposed heuristic algorithm is superior to Agbegha et al.'s (1998) method by obtaining better or at least the same quality solutions. 其他題名： ijstl 出版者： Inderscience Publishers (IEL) 出版日期： 2016 出處： International journal of shipping and transport logistics, 2016, Vol.8 (1), p.21-50 版權： Copyright © 2016 Inderscience Enterprises Ltd. 識別號： ISSN: 1756-6517 識別號： EISSN: 1756-6525 識別號： DOI: 10.1504/IJSTL.2016.073313
Appears in Collections:	[Department of Civil Engineering] journal & Dissertation

Files in This Item:

File	Description	Size	Format
index.html		0Kb	HTML	19	View/Open

社群 sharing

Loading...