A heuristic algorithm for the auto-carrier loading problem Online publication date: Sat, 14-Nov-2015
by Huey-Kuo Chen
International Journal of Shipping and Transport Logistics (IJSTL), Vol. 8, No. 1, 2016
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.
Online publication date: Sat, 14-Nov-2015
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Shipping and Transport Logistics (IJSTL):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email email@example.com