An Improved Tabu Search Algorithm for a Multi-Period Bid Generation Problem with the Consideration of Delivery Lead Time

International audienceIn addition to standard delivery costs, shippers are concerned with delivery lead times. Shorter delivery lead times provide better service to customers. This paper investigates the bid generation problem of a carrier in collaborative transportation realized via a combinatorial auction. In this paper, we propose a multi-period bid generation problem with two types of pickup and delivery requests, namely reserved and selective requests. This problem is an extension of pickup and delivery problem with time windows. This problem arises when a shipper applies an auction for the procurement of transportation services from carriers. In each period, the carrier may have reserved requests that must be served by itself. This carrier wants to determine within a time horizon of multi periods which requests to bid and serve among a set of selective requests open for bid and its multi-period routing plan to maximize its profit and minimize delivery lead times. This problem is NP-hard. We propose an Improved Tabu Search (ITS) algorithm to solve it. The algorithm is evaluated on instances with 20 to 100 requests. The computational results show that the proposed algorithm significantly outperforms CPLEX with much shorter computation times