Publication
Title
Efficient metaheuristics to solve the intermodal terminal location problem
Author
Abstract
The objective of the intermodal terminal location problem is to determine which of a set of potential terminal locations to use and how to route the supply and demand of a set of customers (representing zones of supply and demand) through the network (by both uni- and intermodal transport) so as to minimize the total cost. Two different metaheuristic procedures are developed that both consist of two phases: a solution construction phase (either GRASP or attribute based hill climber) and a solution improvement phase based on local search. Innovative in this approach is the integration of a fast heuristic procedure to approximate the total cost given the set of open terminals. Both metaheuristics are compared to the results of an MIP solver. A thorough performance assessment uncovers that both metaheuristics generate close-to-optimal solutions in very short computing times. An argument in favor of the ABHC approach is that it is parameter-free and hence more transparent and likely to be accepted in a business or policy environment. (C) 2011 Elsevier Ltd. All rights reserved.
Language
English
Source (journal)
Computers & operations research. - New York, N.Y.
Publication
New York, N.Y. : 2012
ISSN
0305-0548
Volume/pages
39:9(2012), p. 2079-2090
ISI
000301216600013
Full text (Publisher's DOI)
Full text (publisher's version - intranet only)
UAntwerpen
Faculty/Department
Research group
Publication type
Subject
Affiliation
Publications with a UAntwerp address
External links
Web of Science
Record
Identification
Creation 14.05.2012
Last edited 08.07.2017
To cite this reference