Combinatorial auction for transportation matching service: Formulation and adaptive large neighborhood search heuristic

Combinatorial auction for transportation matching service: Formulation and adaptive large neighborhood search heuristic

This paper considers the problem of matching multiple shippers and multi-transporters for pickups and drop-offs, where the goal is to select a subset of group jobs (shipper bids) that maximizes profit. This is the underlying winner determination problem in an online auction-based vehicle sharing pla...

Full description

Saved in:
Bibliographic Details
Main Authors: LI, Baoxiang, LAU, Hoong Chuin
Format: text
Language:English
Published: Institutional Knowledge at Singapore Management University 2017
Subjects:
Pickup-and-delivery problem with jobs dependency
Winner determination problem
Logistics
Computer Sciences
Operations Research, Systems Engineering and Industrial Engineering
Transportation
Online Access:https://ink.library.smu.edu.sg/sis_research/3868
https://ink.library.smu.edu.sg/context/sis_research/article/4870/viewcontent/CombinatorialAuction_TransportationMatchingService_2017.pdf
Tags: Add Tag
No Tags, Be the first to tag this record!
Institution: Singapore Management University
Language: English

Internet

https://ink.library.smu.edu.sg/sis_research/3868
https://ink.library.smu.edu.sg/context/sis_research/article/4870/viewcontent/CombinatorialAuction_TransportationMatchingService_2017.pdf

Similar Items