A two‐stage method for the shipper lane selection problem with time windows in transportation service procurement
From MaRDI portal
Publication:6195025
DOI10.1111/itor.13243OpenAlexW4313524326MaRDI QIDQ6195025
No author found.
Publication date: 12 March 2024
Published in: International Transactions in Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1111/itor.13243
mixed integer linear programmingtime windowsshipper lane selection problemiterative-improvement mechanism
Cites Work
- A tabu search heuristic for the vehicle routing problem with private fleet and common carrier
- Product-oriented time window assignment for a multi-compartment vehicle routing problem
- A heuristic algorithm for the truckload and less-than-truckload problem
- An Online Mechanism for Multi-Unit Demand and its Application to Plug-in Hybrid Electric Vehicle Charging
- Combinatorial Auctions: A Survey
- Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
- Branch-and-Price-and-Cut for the Split-Delivery Vehicle Routing Problem with Time Windows
- The lane covering problem with time windows
- Equilibria of Greedy Combinatorial Auctions
- Linear Reformulation of Polynomial Discrete Programming for Fast Computation
- Modeling the Pre Auction Stage The Truckload Case
This page was built for publication: A two‐stage method for the shipper lane selection problem with time windows in transportation service procurement
