Authors:
Elham Jelodari Mamaghani
;
Haoxun Chen
and
Christian Prins
Affiliation:
Industrial Systems Optimization Laboratory, Charles Delaunay Institute and UMR CNRS 6281, University of Technology of Troyes, Troyes 10004 and France
Keyword(s):
Carrier Collaboration, Bid Generation, Periodic Vehicle Routing Problem, Pickup and Delivery, Profit.
Related
Ontology
Subjects/Areas/Topics:
Applications
;
Artificial Intelligence
;
e-Business
;
Enterprise Information Systems
;
Industrial Engineering
;
Knowledge Discovery and Information Retrieval
;
Knowledge-Based Systems
;
Logistics
;
Management Sciences
;
Methodologies and Technologies
;
Operational Research
;
Optimization
;
OR in Transportation
;
Pattern Recognition
;
Routing
;
Scheduling
;
Software Engineering
;
Symbolic Systems
Abstract:
In this article, a new vehicle routing problem appeared in carrier collaboration via a combinatorial auction (CA) is studied. A carrier with reserved requests wants to determine within a time horizon of multi periods (days) which requests to serve among a set of selective requests open for bid of the auction to maximize its profit. In each period, the carrier has a set of reserved requests that must be served by the carrier itself. Each request is specified by a pair of pickup and delivery locations, a quantity, and two time windows for pickup and delivery respectively. The objective of the carrier is to determine which selective requests may be served in each period in addition of its reserved requests and determine optimal routes to serve the reserved and selective requests to maximize its total profit. For this NP-hard problem, a mixed-integer linear programming model is formulated and a genetic algorithm combined with simulated annealing is proposed. The algorithm is evaluated on
instances with 6 to 100 requests. The computational results show this algorithm significantly outperform CPLEX solver, not only in computation time but also in solution quality.
(More)