The procurement of transportation services via large-scale combinatorial auctions involves a couple of complex decisions whose outcome highly influences the performance of the tender process. This paper examines the shipper's task of selecting a subset of the submitted bids which efficiently...

This paper introduces a bi-objective winner-determination problem and presents a multiobjectivegenetic algorithm to solve it. The problem examined arises in the procurement of transportation contractsvia combinatorial auctions. It is modeled as an extension to the set-covering problem and...

The procurement of transportation services via large-scale combinatorial auctions involves a couple of complex decisions whose outcome highly influences the performance of the tender process. This paper examines the shipper's task of selecting a subset of the submitted bids which efficiently...

Customers are making increasing demands on the flexibility and the promptness of transportation services. In order to meet these requirements, planning methods are needed which are able to intelligently react on dynamically revealed information. Algorithms for dispatching transportation requests...

The Pickup and Delivery Problem with Time Windows (PDPTW) is a generalization of the well studied Vehicle Routing Problem with Time Windows (VRPTW). Since it models several typical planning situations in operational transportation logistics and public transit, the PDPTW has attracted growing...