Please use this identifier to cite or link to this item:
Title: Random move tabu search for freight proportion allocation problem
Authors: Lim, A
Qin, HU
Xu, J
Xu, Z 
Issue Date: 2008
Source: The 20th IEEE International Conference on Tools with Artificial Intelligence, 2008. ICTAI '08. Dayton, Ohio, USA, November 3-5, 2008, p. 307-314
Abstract: We study a freight proportion allocation problem (FPAP), which is a kind of transportation problem faced by MG, one of the worldpsilas leading grocery retailers. MG has a large quantity of freight for carriers to ship to Europe. During the process of freight allocation, the shipper must consider three constraints, which are minimum quantity commitment (MQC), quantity limit per carrier and cost balance among sales divisions. With these constraints,the FPAP becomes computationally intractable. By incorporating random move subroutine, we devised a special Tabu search procedure to solve this problem. Different from classical Tabu search who usually runs in the feasible regions, random move Tabu search enables the search process to enter into infeasible regions and visit disjointed feasible regions. Extensive experiments have been conducted to measure the performance of our proposed Tabu search and CPLEX solver and have shown that the random move Tabu search behaves better.
Keywords: Freight handling
Goods distribution
Search problems
ISBN: 978-0-7695-3440-4
DOI: 10.1109/ICTAI.2008.20
Appears in Collections:Conference Paper

View full-text via PolyU eLinks SFX Query
Show full item record

Page view(s)

Last Week
Last month
Citations as of Sep 23, 2020

Google ScholarTM



Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.